/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/parallel-misc-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:53:43,803 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:53:43,857 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 00:53:43,860 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:53:43,861 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:53:43,882 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:53:43,882 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:53:43,882 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:53:43,882 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:53:43,882 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:53:43,882 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:53:43,882 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:53:43,883 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:53:43,883 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:53:43,883 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:53:43,883 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:53:43,883 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:53:43,883 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:53:43,883 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:53:43,883 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:53:43,883 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:53:43,883 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:53:43,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:53:43,883 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:53:43,884 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:53:43,884 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:53:43,884 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:53:43,884 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:53:43,884 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:53:43,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:53:43,884 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:53:43,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:53:43,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:53:43,884 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:53:43,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:53:43,884 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:53:43,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:53:43,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:53:43,886 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:53:43,886 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:53:43,886 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:53:43,886 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:53:43,886 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:53:43,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:53:43,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:53:43,886 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:53:43,886 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:53:43,886 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 00:53:44,105 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:53:44,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:53:44,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:53:44,114 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:53:44,115 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:53:44,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-4.wvr.c [2025-04-14 00:53:45,336 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a81a6d47a/1c0b2d5f1305400e9215bb9bcba72e29/FLAG970b4d9f7 [2025-04-14 00:53:45,541 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:53:45,541 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-4.wvr.c [2025-04-14 00:53:45,566 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a81a6d47a/1c0b2d5f1305400e9215bb9bcba72e29/FLAG970b4d9f7 [2025-04-14 00:53:46,338 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a81a6d47a/1c0b2d5f1305400e9215bb9bcba72e29 [2025-04-14 00:53:46,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:53:46,341 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:53:46,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:53:46,342 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:53:46,350 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:53:46,351 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:53:46" (1/1) ... [2025-04-14 00:53:46,351 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5156ca4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:46, skipping insertion in model container [2025-04-14 00:53:46,352 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:53:46" (1/1) ... [2025-04-14 00:53:46,363 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:53:46,532 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-4.wvr.c[2257,2270] [2025-04-14 00:53:46,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:53:46,541 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:53:46,570 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-4.wvr.c[2257,2270] [2025-04-14 00:53:46,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:53:46,588 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:53:46,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:46 WrapperNode [2025-04-14 00:53:46,590 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:53:46,591 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:53:46,591 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:53:46,591 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:53:46,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:46" (1/1) ... [2025-04-14 00:53:46,607 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:46" (1/1) ... [2025-04-14 00:53:46,623 INFO L138 Inliner]: procedures = 19, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 61 [2025-04-14 00:53:46,623 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:53:46,624 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:53:46,624 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:53:46,624 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:53:46,630 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:46" (1/1) ... [2025-04-14 00:53:46,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:46" (1/1) ... [2025-04-14 00:53:46,633 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:46" (1/1) ... [2025-04-14 00:53:46,648 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-14 00:53:46,648 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:46" (1/1) ... [2025-04-14 00:53:46,649 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:46" (1/1) ... [2025-04-14 00:53:46,652 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:46" (1/1) ... [2025-04-14 00:53:46,653 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:46" (1/1) ... [2025-04-14 00:53:46,653 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:46" (1/1) ... [2025-04-14 00:53:46,654 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:46" (1/1) ... [2025-04-14 00:53:46,656 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:53:46,657 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:53:46,657 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:53:46,657 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:53:46,657 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:46" (1/1) ... [2025-04-14 00:53:46,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:53:46,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:53:46,691 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 00:53:46,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 00:53:46,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:53:46,711 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 00:53:46,711 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 00:53:46,711 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 00:53:46,711 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 00:53:46,711 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 00:53:46,711 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 00:53:46,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:53:46,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:53:46,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:53:46,712 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:53:46,768 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:53:46,769 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:53:46,907 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:53:46,907 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:53:46,907 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:53:47,029 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:53:47,037 WARN L179 LargeBlockEncoding]: Complex 3:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:53:47,052 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:53:47,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:53:47 BoogieIcfgContainer [2025-04-14 00:53:47,053 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:53:47,054 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:53:47,054 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:53:47,057 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:53:47,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:53:46" (1/3) ... [2025-04-14 00:53:47,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dbf55dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:53:47, skipping insertion in model container [2025-04-14 00:53:47,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:46" (2/3) ... [2025-04-14 00:53:47,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dbf55dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:53:47, skipping insertion in model container [2025-04-14 00:53:47,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:53:47" (3/3) ... [2025-04-14 00:53:47,059 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-4.wvr.c [2025-04-14 00:53:47,070 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:53:47,071 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-4.wvr.c that has 4 procedures, 32 locations, 38 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-14 00:53:47,072 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:53:47,123 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 00:53:47,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 41 transitions, 103 flow [2025-04-14 00:53:47,180 INFO L116 PetriNetUnfolderBase]: 10/38 cut-off events. [2025-04-14 00:53:47,182 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 00:53:47,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 38 events. 10/38 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 32. Up to 3 conditions per place. [2025-04-14 00:53:47,185 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 41 transitions, 103 flow [2025-04-14 00:53:47,188 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 37 transitions, 92 flow [2025-04-14 00:53:47,193 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:53:47,202 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;@26468b26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:53:47,202 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 00:53:47,209 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:53:47,210 INFO L116 PetriNetUnfolderBase]: 10/36 cut-off events. [2025-04-14 00:53:47,210 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 00:53:47,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:47,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] [2025-04-14 00:53:47,211 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-14 00:53:47,214 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:47,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1000063919, now seen corresponding path program 1 times [2025-04-14 00:53:47,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:47,219 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297761903] [2025-04-14 00:53:47,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:53:47,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:47,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 00:53:47,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:53:47,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:53:47,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:47,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:53:47,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:47,676 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297761903] [2025-04-14 00:53:47,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297761903] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:53:47,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:53:47,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:53:47,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089069422] [2025-04-14 00:53:47,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:53:47,683 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:53:47,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:47,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:53:47,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:53:47,702 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 41 [2025-04-14 00:53:47,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 37 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:47,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:47,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 41 [2025-04-14 00:53:47,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:48,118 INFO L116 PetriNetUnfolderBase]: 1774/2406 cut-off events. [2025-04-14 00:53:48,118 INFO L117 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2025-04-14 00:53:48,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4964 conditions, 2406 events. 1774/2406 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 8993 event pairs, 234 based on Foata normal form. 0/1635 useless extension candidates. Maximal degree in co-relation 4653. Up to 1165 conditions per place. [2025-04-14 00:53:48,131 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 58 selfloop transitions, 6 changer transitions 29/95 dead transitions. [2025-04-14 00:53:48,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 95 transitions, 418 flow [2025-04-14 00:53:48,133 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:53:48,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:53:48,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2025-04-14 00:53:48,143 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6195121951219512 [2025-04-14 00:53:48,144 INFO L175 Difference]: Start difference. First operand has 37 places, 37 transitions, 92 flow. Second operand 5 states and 127 transitions. [2025-04-14 00:53:48,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 95 transitions, 418 flow [2025-04-14 00:53:48,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 95 transitions, 390 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-14 00:53:48,156 INFO L231 Difference]: Finished difference. Result has 38 places, 40 transitions, 133 flow [2025-04-14 00:53:48,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=133, PETRI_PLACES=38, PETRI_TRANSITIONS=40} [2025-04-14 00:53:48,160 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2025-04-14 00:53:48,160 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 40 transitions, 133 flow [2025-04-14 00:53:48,160 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:48,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:48,160 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:53:48,160 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:53:48,160 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-14 00:53:48,161 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:48,161 INFO L85 PathProgramCache]: Analyzing trace with hash 776744405, now seen corresponding path program 2 times [2025-04-14 00:53:48,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:48,161 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644624357] [2025-04-14 00:53:48,161 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:53:48,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:48,169 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-04-14 00:53:48,179 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:53:48,179 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:53:48,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:48,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:53:48,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:48,240 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644624357] [2025-04-14 00:53:48,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644624357] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:53:48,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:53:48,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:53:48,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737512608] [2025-04-14 00:53:48,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:53:48,241 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:53:48,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:48,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:53:48,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:53:48,241 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 41 [2025-04-14 00:53:48,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 40 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:48,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:48,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 41 [2025-04-14 00:53:48,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:48,456 INFO L116 PetriNetUnfolderBase]: 1481/2035 cut-off events. [2025-04-14 00:53:48,456 INFO L117 PetriNetUnfolderBase]: For 1228/1228 co-relation queries the response was YES. [2025-04-14 00:53:48,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4712 conditions, 2035 events. 1481/2035 cut-off events. For 1228/1228 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7688 event pairs, 374 based on Foata normal form. 246/1805 useless extension candidates. Maximal degree in co-relation 3845. Up to 1504 conditions per place. [2025-04-14 00:53:48,464 INFO L140 encePairwiseOnDemand]: 24/41 looper letters, 40 selfloop transitions, 2 changer transitions 13/57 dead transitions. [2025-04-14 00:53:48,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 57 transitions, 286 flow [2025-04-14 00:53:48,464 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:53:48,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:53:48,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-04-14 00:53:48,465 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5853658536585366 [2025-04-14 00:53:48,465 INFO L175 Difference]: Start difference. First operand has 38 places, 40 transitions, 133 flow. Second operand 3 states and 72 transitions. [2025-04-14 00:53:48,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 57 transitions, 286 flow [2025-04-14 00:53:48,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 57 transitions, 281 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:53:48,469 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 160 flow [2025-04-14 00:53:48,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2025-04-14 00:53:48,469 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2025-04-14 00:53:48,469 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 160 flow [2025-04-14 00:53:48,469 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:48,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:48,470 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-14 00:53:48,470 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:53:48,470 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-14 00:53:48,472 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:48,472 INFO L85 PathProgramCache]: Analyzing trace with hash -832651835, now seen corresponding path program 1 times [2025-04-14 00:53:48,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:48,472 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393781800] [2025-04-14 00:53:48,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:53:48,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:48,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 00:53:48,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 00:53:48,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:53:48,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:48,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:53:48,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:48,522 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393781800] [2025-04-14 00:53:48,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393781800] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:53:48,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:53:48,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:53:48,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325419622] [2025-04-14 00:53:48,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:53:48,522 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:53:48,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:48,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:53:48,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:53:48,523 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 41 [2025-04-14 00:53:48,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:48,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:48,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 41 [2025-04-14 00:53:48,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:48,640 INFO L116 PetriNetUnfolderBase]: 611/947 cut-off events. [2025-04-14 00:53:48,640 INFO L117 PetriNetUnfolderBase]: For 864/888 co-relation queries the response was YES. [2025-04-14 00:53:48,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2807 conditions, 947 events. 611/947 cut-off events. For 864/888 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3609 event pairs, 226 based on Foata normal form. 0/855 useless extension candidates. Maximal degree in co-relation 1990. Up to 509 conditions per place. [2025-04-14 00:53:48,646 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 50 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2025-04-14 00:53:48,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 56 transitions, 335 flow [2025-04-14 00:53:48,647 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:53:48,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:53:48,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-04-14 00:53:48,648 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5528455284552846 [2025-04-14 00:53:48,648 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 160 flow. Second operand 3 states and 68 transitions. [2025-04-14 00:53:48,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 56 transitions, 335 flow [2025-04-14 00:53:48,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 56 transitions, 315 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-04-14 00:53:48,653 INFO L231 Difference]: Finished difference. Result has 38 places, 37 transitions, 146 flow [2025-04-14 00:53:48,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=38, PETRI_TRANSITIONS=37} [2025-04-14 00:53:48,654 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2025-04-14 00:53:48,654 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 37 transitions, 146 flow [2025-04-14 00:53:48,654 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:48,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:48,655 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-14 00:53:48,655 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:53:48,655 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-14 00:53:48,656 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:48,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1570276700, now seen corresponding path program 1 times [2025-04-14 00:53:48,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:48,656 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667002301] [2025-04-14 00:53:48,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:53:48,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:48,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 00:53:48,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 00:53:48,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:53:48,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:48,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:53:48,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:48,723 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667002301] [2025-04-14 00:53:48,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667002301] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:53:48,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:53:48,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:53:48,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348548628] [2025-04-14 00:53:48,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:53:48,723 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:53:48,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:48,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:53:48,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:53:48,724 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 41 [2025-04-14 00:53:48,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 37 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:48,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:48,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 41 [2025-04-14 00:53:48,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:48,833 INFO L116 PetriNetUnfolderBase]: 684/1096 cut-off events. [2025-04-14 00:53:48,833 INFO L117 PetriNetUnfolderBase]: For 801/825 co-relation queries the response was YES. [2025-04-14 00:53:48,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3180 conditions, 1096 events. 684/1096 cut-off events. For 801/825 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4464 event pairs, 306 based on Foata normal form. 0/1070 useless extension candidates. Maximal degree in co-relation 1852. Up to 590 conditions per place. [2025-04-14 00:53:48,838 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 50 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2025-04-14 00:53:48,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 56 transitions, 334 flow [2025-04-14 00:53:48,839 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:53:48,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:53:48,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-04-14 00:53:48,839 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5528455284552846 [2025-04-14 00:53:48,839 INFO L175 Difference]: Start difference. First operand has 38 places, 37 transitions, 146 flow. Second operand 3 states and 68 transitions. [2025-04-14 00:53:48,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 56 transitions, 334 flow [2025-04-14 00:53:48,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 56 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:53:48,841 INFO L231 Difference]: Finished difference. Result has 39 places, 38 transitions, 160 flow [2025-04-14 00:53:48,841 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=39, PETRI_TRANSITIONS=38} [2025-04-14 00:53:48,842 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2025-04-14 00:53:48,842 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 38 transitions, 160 flow [2025-04-14 00:53:48,842 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:48,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:48,842 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-14 00:53:48,842 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:53:48,842 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-14 00:53:48,843 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:48,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1374026858, now seen corresponding path program 1 times [2025-04-14 00:53:48,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:48,843 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377955023] [2025-04-14 00:53:48,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:53:48,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:48,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 00:53:48,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:53:48,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:53:48,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:49,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:53:49,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:49,020 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377955023] [2025-04-14 00:53:49,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377955023] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:53:49,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:53:49,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:53:49,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882456673] [2025-04-14 00:53:49,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:53:49,021 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:53:49,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:49,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:53:49,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:53:49,021 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 41 [2025-04-14 00:53:49,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 38 transitions, 160 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:49,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:49,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 41 [2025-04-14 00:53:49,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:49,267 INFO L116 PetriNetUnfolderBase]: 1026/1631 cut-off events. [2025-04-14 00:53:49,267 INFO L117 PetriNetUnfolderBase]: For 1440/1466 co-relation queries the response was YES. [2025-04-14 00:53:49,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4886 conditions, 1631 events. 1026/1631 cut-off events. For 1440/1466 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 7525 event pairs, 164 based on Foata normal form. 136/1711 useless extension candidates. Maximal degree in co-relation 2449. Up to 883 conditions per place. [2025-04-14 00:53:49,275 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 54 selfloop transitions, 11 changer transitions 20/87 dead transitions. [2025-04-14 00:53:49,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 87 transitions, 508 flow [2025-04-14 00:53:49,275 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:53:49,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:53:49,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2025-04-14 00:53:49,276 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4425087108013937 [2025-04-14 00:53:49,276 INFO L175 Difference]: Start difference. First operand has 39 places, 38 transitions, 160 flow. Second operand 7 states and 127 transitions. [2025-04-14 00:53:49,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 87 transitions, 508 flow [2025-04-14 00:53:49,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 87 transitions, 502 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:53:49,284 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 261 flow [2025-04-14 00:53:49,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=261, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2025-04-14 00:53:49,284 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 12 predicate places. [2025-04-14 00:53:49,284 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 261 flow [2025-04-14 00:53:49,285 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:49,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:49,285 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-14 00:53:49,285 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:53:49,285 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-14 00:53:49,285 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:49,286 INFO L85 PathProgramCache]: Analyzing trace with hash -628510449, now seen corresponding path program 1 times [2025-04-14 00:53:49,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:49,286 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342388844] [2025-04-14 00:53:49,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:53:49,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:49,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 00:53:49,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:53:49,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:53:49,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:49,429 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-14 00:53:49,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:49,429 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342388844] [2025-04-14 00:53:49,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342388844] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:53:49,429 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264125117] [2025-04-14 00:53:49,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:53:49,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:53:49,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:53:49,431 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:53:49,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-14 00:53:49,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 00:53:49,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:53:49,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:53:49,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:49,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 00:53:49,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:53:49,608 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-14 00:53:49,609 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:53:49,689 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-14 00:53:49,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264125117] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:53:49,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:53:49,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 6] total 12 [2025-04-14 00:53:49,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631306456] [2025-04-14 00:53:49,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:53:49,690 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 00:53:49,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:49,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 00:53:49,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-04-14 00:53:49,691 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 41 [2025-04-14 00:53:49,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 261 flow. Second operand has 12 states, 12 states have (on average 8.5) internal successors, (102), 12 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:49,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:49,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 41 [2025-04-14 00:53:49,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:50,060 INFO L116 PetriNetUnfolderBase]: 1388/2183 cut-off events. [2025-04-14 00:53:50,061 INFO L117 PetriNetUnfolderBase]: For 5476/5476 co-relation queries the response was YES. [2025-04-14 00:53:50,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8262 conditions, 2183 events. 1388/2183 cut-off events. For 5476/5476 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10320 event pairs, 136 based on Foata normal form. 148/2231 useless extension candidates. Maximal degree in co-relation 7091. Up to 798 conditions per place. [2025-04-14 00:53:50,072 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 74 selfloop transitions, 27 changer transitions 5/108 dead transitions. [2025-04-14 00:53:50,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 108 transitions, 830 flow [2025-04-14 00:53:50,073 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 00:53:50,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 00:53:50,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 149 transitions. [2025-04-14 00:53:50,074 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36341463414634145 [2025-04-14 00:53:50,074 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 261 flow. Second operand 10 states and 149 transitions. [2025-04-14 00:53:50,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 108 transitions, 830 flow [2025-04-14 00:53:50,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 108 transitions, 778 flow, removed 26 selfloop flow, removed 2 redundant places. [2025-04-14 00:53:50,085 INFO L231 Difference]: Finished difference. Result has 58 places, 66 transitions, 552 flow [2025-04-14 00:53:50,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=552, PETRI_PLACES=58, PETRI_TRANSITIONS=66} [2025-04-14 00:53:50,086 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 21 predicate places. [2025-04-14 00:53:50,086 INFO L485 AbstractCegarLoop]: Abstraction has has 58 places, 66 transitions, 552 flow [2025-04-14 00:53:50,086 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.5) internal successors, (102), 12 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:50,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:50,086 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:53:50,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-14 00:53:50,287 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-14 00:53:50,287 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-14 00:53:50,287 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:50,287 INFO L85 PathProgramCache]: Analyzing trace with hash 2120862510, now seen corresponding path program 1 times [2025-04-14 00:53:50,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:50,288 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922419048] [2025-04-14 00:53:50,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:53:50,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:50,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 00:53:50,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:53:50,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:53:50,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:50,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:53:50,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:50,368 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922419048] [2025-04-14 00:53:50,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922419048] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:53:50,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:53:50,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:53:50,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423044399] [2025-04-14 00:53:50,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:53:50,368 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:53:50,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:50,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:53:50,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:53:50,369 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 41 [2025-04-14 00:53:50,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 66 transitions, 552 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:50,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:50,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 41 [2025-04-14 00:53:50,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:50,524 INFO L116 PetriNetUnfolderBase]: 1001/1565 cut-off events. [2025-04-14 00:53:50,524 INFO L117 PetriNetUnfolderBase]: For 5370/5370 co-relation queries the response was YES. [2025-04-14 00:53:50,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6766 conditions, 1565 events. 1001/1565 cut-off events. For 5370/5370 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6656 event pairs, 371 based on Foata normal form. 0/1529 useless extension candidates. Maximal degree in co-relation 4814. Up to 972 conditions per place. [2025-04-14 00:53:50,533 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 79 selfloop transitions, 6 changer transitions 0/87 dead transitions. [2025-04-14 00:53:50,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 87 transitions, 891 flow [2025-04-14 00:53:50,533 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:53:50,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:53:50,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-04-14 00:53:50,534 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4796747967479675 [2025-04-14 00:53:50,534 INFO L175 Difference]: Start difference. First operand has 58 places, 66 transitions, 552 flow. Second operand 3 states and 59 transitions. [2025-04-14 00:53:50,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 87 transitions, 891 flow [2025-04-14 00:53:50,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 87 transitions, 780 flow, removed 43 selfloop flow, removed 5 redundant places. [2025-04-14 00:53:50,542 INFO L231 Difference]: Finished difference. Result has 55 places, 61 transitions, 435 flow [2025-04-14 00:53:50,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=435, PETRI_PLACES=55, PETRI_TRANSITIONS=61} [2025-04-14 00:53:50,542 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 18 predicate places. [2025-04-14 00:53:50,542 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 61 transitions, 435 flow [2025-04-14 00:53:50,542 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:50,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:50,543 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:53:50,543 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 00:53:50,543 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-14 00:53:50,543 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:50,543 INFO L85 PathProgramCache]: Analyzing trace with hash -172702522, now seen corresponding path program 2 times [2025-04-14 00:53:50,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:50,543 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554868083] [2025-04-14 00:53:50,543 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:53:50,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:50,552 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 00:53:50,563 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:53:50,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:53:50,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:50,628 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-14 00:53:50,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:50,628 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554868083] [2025-04-14 00:53:50,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554868083] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:53:50,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:53:50,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:53:50,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483274763] [2025-04-14 00:53:50,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:53:50,629 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:53:50,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:50,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:53:50,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:53:50,629 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 41 [2025-04-14 00:53:50,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 61 transitions, 435 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:50,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:50,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 41 [2025-04-14 00:53:50,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:50,756 INFO L116 PetriNetUnfolderBase]: 878/1399 cut-off events. [2025-04-14 00:53:50,756 INFO L117 PetriNetUnfolderBase]: For 3697/3697 co-relation queries the response was YES. [2025-04-14 00:53:50,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5682 conditions, 1399 events. 878/1399 cut-off events. For 3697/3697 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5679 event pairs, 346 based on Foata normal form. 0/1399 useless extension candidates. Maximal degree in co-relation 4543. Up to 772 conditions per place. [2025-04-14 00:53:50,765 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 71 selfloop transitions, 6 changer transitions 0/79 dead transitions. [2025-04-14 00:53:50,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 79 transitions, 718 flow [2025-04-14 00:53:50,765 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:53:50,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:53:50,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-04-14 00:53:50,766 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4796747967479675 [2025-04-14 00:53:50,767 INFO L175 Difference]: Start difference. First operand has 55 places, 61 transitions, 435 flow. Second operand 3 states and 59 transitions. [2025-04-14 00:53:50,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 79 transitions, 718 flow [2025-04-14 00:53:50,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 79 transitions, 684 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-04-14 00:53:50,773 INFO L231 Difference]: Finished difference. Result has 54 places, 58 transitions, 404 flow [2025-04-14 00:53:50,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=404, PETRI_PLACES=54, PETRI_TRANSITIONS=58} [2025-04-14 00:53:50,774 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 17 predicate places. [2025-04-14 00:53:50,774 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 58 transitions, 404 flow [2025-04-14 00:53:50,774 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:50,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:50,774 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:53:50,774 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:53:50,774 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-14 00:53:50,775 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:50,775 INFO L85 PathProgramCache]: Analyzing trace with hash -446222342, now seen corresponding path program 1 times [2025-04-14 00:53:50,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:50,775 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774960152] [2025-04-14 00:53:50,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:53:50,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:50,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 00:53:50,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:53:50,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:53:50,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:50,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:53:50,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:50,929 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774960152] [2025-04-14 00:53:50,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774960152] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:53:50,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:53:50,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:53:50,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960686427] [2025-04-14 00:53:50,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:53:50,930 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:53:50,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:50,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:53:50,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:53:50,930 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 41 [2025-04-14 00:53:50,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 58 transitions, 404 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:50,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:50,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 41 [2025-04-14 00:53:50,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:51,201 INFO L116 PetriNetUnfolderBase]: 1242/2025 cut-off events. [2025-04-14 00:53:51,201 INFO L117 PetriNetUnfolderBase]: For 5875/5875 co-relation queries the response was YES. [2025-04-14 00:53:51,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7863 conditions, 2025 events. 1242/2025 cut-off events. For 5875/5875 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 9327 event pairs, 256 based on Foata normal form. 184/2209 useless extension candidates. Maximal degree in co-relation 6262. Up to 652 conditions per place. [2025-04-14 00:53:51,213 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 59 selfloop transitions, 36 changer transitions 25/122 dead transitions. [2025-04-14 00:53:51,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 122 transitions, 995 flow [2025-04-14 00:53:51,214 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 00:53:51,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 00:53:51,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2025-04-14 00:53:51,215 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38482384823848237 [2025-04-14 00:53:51,215 INFO L175 Difference]: Start difference. First operand has 54 places, 58 transitions, 404 flow. Second operand 9 states and 142 transitions. [2025-04-14 00:53:51,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 122 transitions, 995 flow [2025-04-14 00:53:51,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 122 transitions, 972 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-14 00:53:51,220 INFO L231 Difference]: Finished difference. Result has 67 places, 73 transitions, 726 flow [2025-04-14 00:53:51,220 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=726, PETRI_PLACES=67, PETRI_TRANSITIONS=73} [2025-04-14 00:53:51,221 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 30 predicate places. [2025-04-14 00:53:51,221 INFO L485 AbstractCegarLoop]: Abstraction has has 67 places, 73 transitions, 726 flow [2025-04-14 00:53:51,221 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:51,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:51,221 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:53:51,221 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 00:53:51,221 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-14 00:53:51,222 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:51,222 INFO L85 PathProgramCache]: Analyzing trace with hash -867083656, now seen corresponding path program 2 times [2025-04-14 00:53:51,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:51,222 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809687493] [2025-04-14 00:53:51,222 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:53:51,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:51,227 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-14 00:53:51,235 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:53:51,235 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:53:51,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:51,330 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-14 00:53:51,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:51,330 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809687493] [2025-04-14 00:53:51,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809687493] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:53:51,330 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366454034] [2025-04-14 00:53:51,330 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:53:51,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:53:51,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:53:51,332 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:53:51,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 00:53:51,364 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-14 00:53:51,381 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:53:51,381 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:53:51,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:51,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-14 00:53:51,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:53:51,448 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-14 00:53:51,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:53:51,507 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-14 00:53:51,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366454034] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:53:51,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:53:51,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 7] total 12 [2025-04-14 00:53:51,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957232889] [2025-04-14 00:53:51,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:53:51,507 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 00:53:51,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:51,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 00:53:51,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-04-14 00:53:51,508 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 41 [2025-04-14 00:53:51,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 73 transitions, 726 flow. Second operand has 12 states, 12 states have (on average 8.5) internal successors, (102), 12 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:51,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:51,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 41 [2025-04-14 00:53:51,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:51,966 INFO L116 PetriNetUnfolderBase]: 1902/3043 cut-off events. [2025-04-14 00:53:51,966 INFO L117 PetriNetUnfolderBase]: For 18629/18629 co-relation queries the response was YES. [2025-04-14 00:53:51,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14376 conditions, 3043 events. 1902/3043 cut-off events. For 18629/18629 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 15198 event pairs, 186 based on Foata normal form. 168/3211 useless extension candidates. Maximal degree in co-relation 13963. Up to 834 conditions per place. [2025-04-14 00:53:51,981 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 98 selfloop transitions, 67 changer transitions 25/192 dead transitions. [2025-04-14 00:53:51,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 192 transitions, 2120 flow [2025-04-14 00:53:51,981 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 00:53:51,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 00:53:51,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 196 transitions. [2025-04-14 00:53:51,982 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31869918699186994 [2025-04-14 00:53:51,982 INFO L175 Difference]: Start difference. First operand has 67 places, 73 transitions, 726 flow. Second operand 15 states and 196 transitions. [2025-04-14 00:53:51,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 192 transitions, 2120 flow [2025-04-14 00:53:51,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 192 transitions, 2028 flow, removed 46 selfloop flow, removed 2 redundant places. [2025-04-14 00:53:51,996 INFO L231 Difference]: Finished difference. Result has 83 places, 119 transitions, 1532 flow [2025-04-14 00:53:51,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1532, PETRI_PLACES=83, PETRI_TRANSITIONS=119} [2025-04-14 00:53:51,997 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 46 predicate places. [2025-04-14 00:53:51,997 INFO L485 AbstractCegarLoop]: Abstraction has has 83 places, 119 transitions, 1532 flow [2025-04-14 00:53:51,997 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.5) internal successors, (102), 12 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:51,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:51,997 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:53:52,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-14 00:53:52,201 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-14 00:53:52,201 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-14 00:53:52,201 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:52,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1269423316, now seen corresponding path program 3 times [2025-04-14 00:53:52,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:52,202 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676924050] [2025-04-14 00:53:52,202 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:53:52,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:52,206 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-14 00:53:52,213 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:53:52,213 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:53:52,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:52,307 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-14 00:53:52,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:52,307 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676924050] [2025-04-14 00:53:52,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676924050] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:53:52,307 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595076558] [2025-04-14 00:53:52,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:53:52,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:53:52,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:53:52,309 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:53:52,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 00:53:52,340 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-14 00:53:52,356 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:53:52,356 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:53:52,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:52,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-14 00:53:52,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:53:52,430 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-14 00:53:52,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:53:52,491 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-14 00:53:52,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595076558] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:53:52,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:53:52,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 8] total 13 [2025-04-14 00:53:52,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192148553] [2025-04-14 00:53:52,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:53:52,491 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-14 00:53:52,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:52,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-14 00:53:52,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-04-14 00:53:52,492 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 41 [2025-04-14 00:53:52,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 119 transitions, 1532 flow. Second operand has 13 states, 13 states have (on average 8.461538461538462) internal successors, (110), 13 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:52,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:52,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 41 [2025-04-14 00:53:52,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:52,849 INFO L116 PetriNetUnfolderBase]: 1561/2494 cut-off events. [2025-04-14 00:53:52,850 INFO L117 PetriNetUnfolderBase]: For 20928/20928 co-relation queries the response was YES. [2025-04-14 00:53:52,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13073 conditions, 2494 events. 1561/2494 cut-off events. For 20928/20928 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 11747 event pairs, 115 based on Foata normal form. 112/2606 useless extension candidates. Maximal degree in co-relation 13047. Up to 785 conditions per place. [2025-04-14 00:53:52,859 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 0 selfloop transitions, 0 changer transitions 164/164 dead transitions. [2025-04-14 00:53:52,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 164 transitions, 2210 flow [2025-04-14 00:53:52,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 00:53:52,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 00:53:52,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 144 transitions. [2025-04-14 00:53:52,860 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2701688555347092 [2025-04-14 00:53:52,860 INFO L175 Difference]: Start difference. First operand has 83 places, 119 transitions, 1532 flow. Second operand 13 states and 144 transitions. [2025-04-14 00:53:52,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 164 transitions, 2210 flow [2025-04-14 00:53:52,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 164 transitions, 2002 flow, removed 77 selfloop flow, removed 11 redundant places. [2025-04-14 00:53:52,882 INFO L231 Difference]: Finished difference. Result has 74 places, 0 transitions, 0 flow [2025-04-14 00:53:52,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1248, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=0, PETRI_PLACES=74, PETRI_TRANSITIONS=0} [2025-04-14 00:53:52,883 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 37 predicate places. [2025-04-14 00:53:52,883 INFO L485 AbstractCegarLoop]: Abstraction has has 74 places, 0 transitions, 0 flow [2025-04-14 00:53:52,883 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.461538461538462) internal successors, (110), 13 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:52,885 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-14 00:53:52,885 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-14 00:53:52,885 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-14 00:53:52,886 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-14 00:53:52,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-14 00:53:53,086 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:53:53,086 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1] [2025-04-14 00:53:53,089 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:53:53,089 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:53:53,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:53:53 BasicIcfg [2025-04-14 00:53:53,092 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:53:53,093 INFO L158 Benchmark]: Toolchain (without parser) took 6751.71ms. Allocated memory was 142.6MB in the beginning and 306.2MB in the end (delta: 163.6MB). Free memory was 100.2MB in the beginning and 160.5MB in the end (delta: -60.2MB). Peak memory consumption was 106.6MB. Max. memory is 8.0GB. [2025-04-14 00:53:53,093 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory was 87.8MB in the beginning and 87.7MB in the end (delta: 104.9kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:53:53,093 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.00ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 85.4MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-14 00:53:53,093 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.80ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 83.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:53:53,093 INFO L158 Benchmark]: Boogie Preprocessor took 32.27ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 82.4MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:53:53,093 INFO L158 Benchmark]: IcfgBuilder took 396.03ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 56.1MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-14 00:53:53,094 INFO L158 Benchmark]: TraceAbstraction took 6038.42ms. Allocated memory was 142.6MB in the beginning and 306.2MB in the end (delta: 163.6MB). Free memory was 55.6MB in the beginning and 160.5MB in the end (delta: -104.9MB). Peak memory consumption was 60.4MB. Max. memory is 8.0GB. [2025-04-14 00:53:53,094 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory was 87.8MB in the beginning and 87.7MB in the end (delta: 104.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 248.00ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 85.4MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.80ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 83.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 32.27ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 82.4MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 396.03ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 56.1MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 6038.42ms. Allocated memory was 142.6MB in the beginning and 306.2MB in the end (delta: 163.6MB). Free memory was 55.6MB in the beginning and 160.5MB in the end (delta: -104.9MB). Peak memory consumption was 60.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 93]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 50 locations, 69 edges, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.9s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 593 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 593 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 112 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1545 IncrementalHoareTripleChecker+Invalid, 1657 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 112 mSolverCounterUnsat, 0 mSDtfsCounter, 1545 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 250 GetRequests, 159 SyntacticMatches, 13 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1532occurred in iteration=10, InterpolantAutomatonStates: 74, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 348 NumberOfCodeBlocks, 348 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 411 ConstructedInterpolants, 0 QuantifiedInterpolants, 1025 SizeOfPredicates, 17 NumberOfNonLiveVariables, 484 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 3/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-14 00:53:53,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...