/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/pthread-theta/unwind1-100.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:46:31,664 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:46:31,717 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 01:46:31,724 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:46:31,725 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:46:31,748 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:46:31,748 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:46:31,749 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:46:31,749 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:46:31,749 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:46:31,749 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:46:31,749 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:46:31,749 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:46:31,749 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:46:31,749 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:46:31,750 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:46:31,750 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:46:31,750 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:46:31,750 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:46:31,750 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:46:31,750 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:46:31,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:46:31,751 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:46:31,751 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:46:31,751 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:46:31,751 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:46:31,751 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:46:31,751 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:46:31,751 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:46:31,751 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:46:31,751 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:46:31,751 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:46:31,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:46:31,752 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:46:31,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:46:31,752 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:46:31,752 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:46:31,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:46:31,752 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:46:31,752 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:46:31,752 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:46:31,752 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:46:31,752 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:46:31,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:46:31,752 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:46:31,752 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:46:31,752 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:46:31,752 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 01:46:31,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:46:31,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:46:31,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:46:31,973 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:46:31,974 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:46:31,976 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-theta/unwind1-100.i [2025-04-14 01:46:33,230 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cae725dcc/c95f6919dba341bea722cfbc02921fbe/FLAGbab512b1a [2025-04-14 01:46:33,461 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:46:33,461 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/unwind1-100.i [2025-04-14 01:46:33,473 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cae725dcc/c95f6919dba341bea722cfbc02921fbe/FLAGbab512b1a [2025-04-14 01:46:34,430 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cae725dcc/c95f6919dba341bea722cfbc02921fbe [2025-04-14 01:46:34,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:46:34,433 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:46:34,434 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:46:34,434 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:46:34,436 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:46:34,437 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:46:34" (1/1) ... [2025-04-14 01:46:34,437 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1576078a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:34, skipping insertion in model container [2025-04-14 01:46:34,437 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:46:34" (1/1) ... [2025-04-14 01:46:34,455 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:46:34,642 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/unwind1-100.i[33026,33039] [2025-04-14 01:46:34,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:46:34,660 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:46:34,695 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/unwind1-100.i[33026,33039] [2025-04-14 01:46:34,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:46:34,718 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:46:34,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:34 WrapperNode [2025-04-14 01:46:34,718 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:46:34,719 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:46:34,719 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:46:34,719 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:46:34,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:34" (1/1) ... [2025-04-14 01:46:34,735 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:34" (1/1) ... [2025-04-14 01:46:34,749 INFO L138 Inliner]: procedures = 169, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 51 [2025-04-14 01:46:34,749 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:46:34,749 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:46:34,749 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:46:34,749 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:46:34,755 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:34" (1/1) ... [2025-04-14 01:46:34,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:34" (1/1) ... [2025-04-14 01:46:34,760 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:34" (1/1) ... [2025-04-14 01:46:34,774 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 01:46:34,774 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:34" (1/1) ... [2025-04-14 01:46:34,774 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:34" (1/1) ... [2025-04-14 01:46:34,777 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:34" (1/1) ... [2025-04-14 01:46:34,777 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:34" (1/1) ... [2025-04-14 01:46:34,778 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:34" (1/1) ... [2025-04-14 01:46:34,778 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:34" (1/1) ... [2025-04-14 01:46:34,781 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:46:34,781 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:46:34,781 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:46:34,781 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:46:34,782 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:34" (1/1) ... [2025-04-14 01:46:34,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:46:34,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:46:34,812 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 01:46:34,817 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 01:46:34,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:46:34,832 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-04-14 01:46:34,832 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-04-14 01:46:34,832 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-04-14 01:46:34,832 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-04-14 01:46:34,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:46:34,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:46:34,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:46:34,833 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 01:46:34,911 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:46:34,912 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:46:35,029 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:46:35,030 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:46:35,030 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:46:35,124 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:46:35,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:46:35 BoogieIcfgContainer [2025-04-14 01:46:35,124 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:46:35,125 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:46:35,125 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:46:35,128 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:46:35,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:46:34" (1/3) ... [2025-04-14 01:46:35,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc8d9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:46:35, skipping insertion in model container [2025-04-14 01:46:35,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:34" (2/3) ... [2025-04-14 01:46:35,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc8d9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:46:35, skipping insertion in model container [2025-04-14 01:46:35,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:46:35" (3/3) ... [2025-04-14 01:46:35,132 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind1-100.i [2025-04-14 01:46:35,142 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:46:35,143 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind1-100.i that has 3 procedures, 18 locations, 17 edges, 1 initial locations, 1 loop locations, and 1 error locations. [2025-04-14 01:46:35,143 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:46:35,178 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 01:46:35,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 19 transitions, 52 flow [2025-04-14 01:46:35,217 INFO L116 PetriNetUnfolderBase]: 2/17 cut-off events. [2025-04-14 01:46:35,219 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 01:46:35,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 17 events. 2/17 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 14. Up to 2 conditions per place. [2025-04-14 01:46:35,220 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 19 transitions, 52 flow [2025-04-14 01:46:35,221 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 15 transitions, 39 flow [2025-04-14 01:46:35,229 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:46:35,238 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;@666814ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:46:35,238 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 01:46:35,243 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:46:35,243 INFO L116 PetriNetUnfolderBase]: 2/12 cut-off events. [2025-04-14 01:46:35,243 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-14 01:46:35,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:46:35,244 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-14 01:46:35,244 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:46:35,247 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:46:35,248 INFO L85 PathProgramCache]: Analyzing trace with hash 641203627, now seen corresponding path program 1 times [2025-04-14 01:46:35,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:46:35,253 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136336239] [2025-04-14 01:46:35,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:46:35,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:46:35,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-14 01:46:35,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-14 01:46:35,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:46:35,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:35,535 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 01:46:35,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:46:35,537 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136336239] [2025-04-14 01:46:35,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136336239] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:46:35,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:46:35,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:46:35,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238797111] [2025-04-14 01:46:35,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:46:35,542 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:46:35,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:46:35,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:46:35,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:46:35,564 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:46:35,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 15 transitions, 39 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 01:46:35,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:46:35,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:46:35,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:46:35,659 INFO L116 PetriNetUnfolderBase]: 102/168 cut-off events. [2025-04-14 01:46:35,660 INFO L117 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-04-14 01:46:35,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 168 events. 102/168 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 463 event pairs, 40 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 320. Up to 103 conditions per place. [2025-04-14 01:46:35,662 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 19 selfloop transitions, 3 changer transitions 2/24 dead transitions. [2025-04-14 01:46:35,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 24 transitions, 108 flow [2025-04-14 01:46:35,663 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:46:35,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:46:35,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2025-04-14 01:46:35,669 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4342105263157895 [2025-04-14 01:46:35,670 INFO L175 Difference]: Start difference. First operand has 20 places, 15 transitions, 39 flow. Second operand 4 states and 33 transitions. [2025-04-14 01:46:35,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 24 transitions, 108 flow [2025-04-14 01:46:35,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 24 transitions, 101 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 01:46:35,674 INFO L231 Difference]: Finished difference. Result has 21 places, 15 transitions, 46 flow [2025-04-14 01:46:35,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=46, PETRI_PLACES=21, PETRI_TRANSITIONS=15} [2025-04-14 01:46:35,678 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 1 predicate places. [2025-04-14 01:46:35,678 INFO L485 AbstractCegarLoop]: Abstraction has has 21 places, 15 transitions, 46 flow [2025-04-14 01:46:35,678 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 01:46:35,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:46:35,678 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:46:35,678 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:46:35,679 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:46:35,679 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:46:35,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1597523916, now seen corresponding path program 1 times [2025-04-14 01:46:35,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:46:35,679 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033019146] [2025-04-14 01:46:35,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:46:35,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:46:35,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-14 01:46:35,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-14 01:46:35,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:46:35,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:35,772 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 01:46:35,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:46:35,773 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033019146] [2025-04-14 01:46:35,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033019146] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:46:35,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:46:35,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:46:35,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383357593] [2025-04-14 01:46:35,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:46:35,774 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:46:35,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:46:35,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:46:35,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:46:35,774 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:46:35,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 15 transitions, 46 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 01:46:35,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:46:35,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:46:35,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:46:35,846 INFO L116 PetriNetUnfolderBase]: 47/95 cut-off events. [2025-04-14 01:46:35,846 INFO L117 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-04-14 01:46:35,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 95 events. 47/95 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 243 event pairs, 15 based on Foata normal form. 11/95 useless extension candidates. Maximal degree in co-relation 133. Up to 55 conditions per place. [2025-04-14 01:46:35,847 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 15 selfloop transitions, 3 changer transitions 9/27 dead transitions. [2025-04-14 01:46:35,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 27 transitions, 130 flow [2025-04-14 01:46:35,848 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:46:35,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:46:35,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2025-04-14 01:46:35,849 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-04-14 01:46:35,849 INFO L175 Difference]: Start difference. First operand has 21 places, 15 transitions, 46 flow. Second operand 5 states and 38 transitions. [2025-04-14 01:46:35,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 27 transitions, 130 flow [2025-04-14 01:46:35,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 27 transitions, 123 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-14 01:46:35,850 INFO L231 Difference]: Finished difference. Result has 25 places, 15 transitions, 55 flow [2025-04-14 01:46:35,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=55, PETRI_PLACES=25, PETRI_TRANSITIONS=15} [2025-04-14 01:46:35,850 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 5 predicate places. [2025-04-14 01:46:35,850 INFO L485 AbstractCegarLoop]: Abstraction has has 25 places, 15 transitions, 55 flow [2025-04-14 01:46:35,850 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 01:46:35,851 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:46:35,851 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:46:35,851 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 01:46:35,851 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:46:35,851 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:46:35,851 INFO L85 PathProgramCache]: Analyzing trace with hash 377675020, now seen corresponding path program 1 times [2025-04-14 01:46:35,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:46:35,851 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520173750] [2025-04-14 01:46:35,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:46:35,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:46:35,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-14 01:46:35,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-14 01:46:35,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:46:35,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:35,931 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 01:46:35,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:46:35,932 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520173750] [2025-04-14 01:46:35,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520173750] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:46:35,932 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551988413] [2025-04-14 01:46:35,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:46:35,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:46:35,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:46:35,935 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 01:46:35,936 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 01:46:35,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-14 01:46:35,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-14 01:46:35,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:46:35,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:35,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 01:46:35,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:46:36,063 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 01:46:36,063 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:46:36,116 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 01:46:36,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551988413] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:46:36,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:46:36,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2025-04-14 01:46:36,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768635815] [2025-04-14 01:46:36,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:46:36,117 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 01:46:36,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:46:36,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 01:46:36,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:46:36,118 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:46:36,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 15 transitions, 55 flow. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:46:36,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:46:36,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:46:36,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:46:36,261 INFO L116 PetriNetUnfolderBase]: 51/103 cut-off events. [2025-04-14 01:46:36,261 INFO L117 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-04-14 01:46:36,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 103 events. 51/103 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 222 event pairs, 12 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 195. Up to 44 conditions per place. [2025-04-14 01:46:36,266 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 25 selfloop transitions, 8 changer transitions 0/33 dead transitions. [2025-04-14 01:46:36,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 33 transitions, 169 flow [2025-04-14 01:46:36,266 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 01:46:36,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 01:46:36,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2025-04-14 01:46:36,267 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34210526315789475 [2025-04-14 01:46:36,267 INFO L175 Difference]: Start difference. First operand has 25 places, 15 transitions, 55 flow. Second operand 8 states and 52 transitions. [2025-04-14 01:46:36,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 33 transitions, 169 flow [2025-04-14 01:46:36,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 33 transitions, 159 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-14 01:46:36,268 INFO L231 Difference]: Finished difference. Result has 29 places, 18 transitions, 87 flow [2025-04-14 01:46:36,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=45, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=87, PETRI_PLACES=29, PETRI_TRANSITIONS=18} [2025-04-14 01:46:36,269 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2025-04-14 01:46:36,269 INFO L485 AbstractCegarLoop]: Abstraction has has 29 places, 18 transitions, 87 flow [2025-04-14 01:46:36,269 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:46:36,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:46:36,269 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:46:36,282 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 01:46:36,470 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:46:36,470 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:46:36,470 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:46:36,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1497668589, now seen corresponding path program 2 times [2025-04-14 01:46:36,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:46:36,471 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917086180] [2025-04-14 01:46:36,471 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:46:36,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:46:36,476 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-04-14 01:46:36,485 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-04-14 01:46:36,485 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:46:36,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:36,606 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:46:36,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:46:36,606 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917086180] [2025-04-14 01:46:36,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917086180] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:46:36,606 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431904233] [2025-04-14 01:46:36,606 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:46:36,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:46:36,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:46:36,608 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 01:46:36,610 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 01:46:36,657 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-04-14 01:46:36,669 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-04-14 01:46:36,670 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:46:36,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:36,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 01:46:36,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:46:36,741 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:46:36,742 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:46:36,824 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:46:36,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431904233] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:46:36,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:46:36,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-04-14 01:46:36,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779917352] [2025-04-14 01:46:36,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:46:36,824 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-14 01:46:36,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:46:36,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-14 01:46:36,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2025-04-14 01:46:36,825 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:46:36,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 18 transitions, 87 flow. Second operand has 19 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 19 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:46:36,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:46:36,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:46:36,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:46:36,988 INFO L116 PetriNetUnfolderBase]: 81/163 cut-off events. [2025-04-14 01:46:36,988 INFO L117 PetriNetUnfolderBase]: For 155/155 co-relation queries the response was YES. [2025-04-14 01:46:36,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 163 events. 81/163 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 359 event pairs, 22 based on Foata normal form. 30/189 useless extension candidates. Maximal degree in co-relation 415. Up to 63 conditions per place. [2025-04-14 01:46:36,992 INFO L140 encePairwiseOnDemand]: 15/19 looper letters, 42 selfloop transitions, 12 changer transitions 0/54 dead transitions. [2025-04-14 01:46:36,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 54 transitions, 301 flow [2025-04-14 01:46:36,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 01:46:36,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 01:46:36,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 86 transitions. [2025-04-14 01:46:36,994 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3481781376518219 [2025-04-14 01:46:36,994 INFO L175 Difference]: Start difference. First operand has 29 places, 18 transitions, 87 flow. Second operand 13 states and 86 transitions. [2025-04-14 01:46:36,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 54 transitions, 301 flow [2025-04-14 01:46:36,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 54 transitions, 278 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-04-14 01:46:36,997 INFO L231 Difference]: Finished difference. Result has 43 places, 24 transitions, 150 flow [2025-04-14 01:46:36,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=150, PETRI_PLACES=43, PETRI_TRANSITIONS=24} [2025-04-14 01:46:36,998 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 23 predicate places. [2025-04-14 01:46:36,998 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 24 transitions, 150 flow [2025-04-14 01:46:36,998 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 19 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:46:36,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:46:36,998 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:46:37,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-14 01:46:37,199 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,SelfDestructingSolverStorable3 [2025-04-14 01:46:37,199 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:46:37,200 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:46:37,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1882097533, now seen corresponding path program 3 times [2025-04-14 01:46:37,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:46:37,200 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68955172] [2025-04-14 01:46:37,200 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:46:37,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:46:37,206 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 6 equivalence classes. [2025-04-14 01:46:37,211 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 10 of 18 statements. [2025-04-14 01:46:37,211 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:46:37,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:37,256 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 01:46:37,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:46:37,256 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68955172] [2025-04-14 01:46:37,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68955172] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:46:37,256 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383384279] [2025-04-14 01:46:37,256 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:46:37,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:46:37,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:46:37,259 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 01:46:37,260 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 01:46:37,301 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 6 equivalence classes. [2025-04-14 01:46:37,311 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 10 of 18 statements. [2025-04-14 01:46:37,311 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:46:37,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:37,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 01:46:37,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:46:37,336 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 01:46:37,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:46:37,372 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 01:46:37,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383384279] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:46:37,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:46:37,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-04-14 01:46:37,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140437192] [2025-04-14 01:46:37,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:46:37,374 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:46:37,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:46:37,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:46:37,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:46:37,374 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:46:37,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 24 transitions, 150 flow. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:46:37,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:46:37,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:46:37,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:46:37,446 INFO L116 PetriNetUnfolderBase]: 143/289 cut-off events. [2025-04-14 01:46:37,446 INFO L117 PetriNetUnfolderBase]: For 390/390 co-relation queries the response was YES. [2025-04-14 01:46:37,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1035 conditions, 289 events. 143/289 cut-off events. For 390/390 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 919 event pairs, 48 based on Foata normal form. 5/290 useless extension candidates. Maximal degree in co-relation 742. Up to 141 conditions per place. [2025-04-14 01:46:37,449 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 23 selfloop transitions, 2 changer transitions 22/47 dead transitions. [2025-04-14 01:46:37,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 47 transitions, 369 flow [2025-04-14 01:46:37,449 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:46:37,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:46:37,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2025-04-14 01:46:37,450 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4105263157894737 [2025-04-14 01:46:37,450 INFO L175 Difference]: Start difference. First operand has 43 places, 24 transitions, 150 flow. Second operand 5 states and 39 transitions. [2025-04-14 01:46:37,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 47 transitions, 369 flow [2025-04-14 01:46:37,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 47 transitions, 280 flow, removed 36 selfloop flow, removed 5 redundant places. [2025-04-14 01:46:37,456 INFO L231 Difference]: Finished difference. Result has 45 places, 22 transitions, 112 flow [2025-04-14 01:46:37,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=45, PETRI_TRANSITIONS=22} [2025-04-14 01:46:37,459 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 25 predicate places. [2025-04-14 01:46:37,459 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 22 transitions, 112 flow [2025-04-14 01:46:37,459 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:46:37,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:46:37,459 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:46:37,465 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 01:46:37,663 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:46:37,663 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:46:37,663 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:46:37,663 INFO L85 PathProgramCache]: Analyzing trace with hash -88312365, now seen corresponding path program 1 times [2025-04-14 01:46:37,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:46:37,664 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132686430] [2025-04-14 01:46:37,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:46:37,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:46:37,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 01:46:37,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:46:37,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:46:37,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:37,846 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:46:37,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:46:37,846 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132686430] [2025-04-14 01:46:37,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132686430] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:46:37,847 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069287069] [2025-04-14 01:46:37,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:46:37,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:46:37,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:46:37,849 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:46:37,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 01:46:37,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 01:46:37,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:46:37,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:46:37,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:37,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-14 01:46:37,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:46:38,047 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:46:38,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:46:38,269 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:46:38,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069287069] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:46:38,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:46:38,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2025-04-14 01:46:38,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331119000] [2025-04-14 01:46:38,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:46:38,270 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-14 01:46:38,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:46:38,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-14 01:46:38,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=922, Unknown=0, NotChecked=0, Total=1482 [2025-04-14 01:46:38,271 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:46:38,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 22 transitions, 112 flow. Second operand has 39 states, 39 states have (on average 3.230769230769231) internal successors, (126), 39 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:46:38,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:46:38,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:46:38,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:46:38,764 INFO L116 PetriNetUnfolderBase]: 134/272 cut-off events. [2025-04-14 01:46:38,764 INFO L117 PetriNetUnfolderBase]: For 3085/3085 co-relation queries the response was YES. [2025-04-14 01:46:38,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 903 conditions, 272 events. 134/272 cut-off events. For 3085/3085 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 618 event pairs, 9 based on Foata normal form. 60/332 useless extension candidates. Maximal degree in co-relation 832. Up to 76 conditions per place. [2025-04-14 01:46:38,766 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 78 selfloop transitions, 25 changer transitions 0/103 dead transitions. [2025-04-14 01:46:38,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 103 transitions, 576 flow [2025-04-14 01:46:38,766 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-14 01:46:38,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-04-14 01:46:38,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 167 transitions. [2025-04-14 01:46:38,767 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33805668016194335 [2025-04-14 01:46:38,767 INFO L175 Difference]: Start difference. First operand has 45 places, 22 transitions, 112 flow. Second operand 26 states and 167 transitions. [2025-04-14 01:46:38,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 103 transitions, 576 flow [2025-04-14 01:46:38,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 103 transitions, 564 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-04-14 01:46:38,771 INFO L231 Difference]: Finished difference. Result has 74 places, 34 transitions, 296 flow [2025-04-14 01:46:38,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=296, PETRI_PLACES=74, PETRI_TRANSITIONS=34} [2025-04-14 01:46:38,774 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 54 predicate places. [2025-04-14 01:46:38,774 INFO L485 AbstractCegarLoop]: Abstraction has has 74 places, 34 transitions, 296 flow [2025-04-14 01:46:38,774 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.230769230769231) internal successors, (126), 39 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:46:38,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:46:38,774 INFO L206 CegarLoopForPetriNet]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:46:38,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-14 01:46:38,974 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:46:38,975 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:46:38,975 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:46:38,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1284024467, now seen corresponding path program 2 times [2025-04-14 01:46:38,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:46:38,976 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754630788] [2025-04-14 01:46:38,976 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:46:38,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:46:38,981 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-14 01:46:38,989 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-14 01:46:38,990 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:46:38,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:39,397 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:46:39,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:46:39,397 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754630788] [2025-04-14 01:46:39,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754630788] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:46:39,397 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882391705] [2025-04-14 01:46:39,398 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:46:39,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:46:39,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:46:39,401 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:46:39,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-14 01:46:39,432 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-14 01:46:39,445 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-14 01:46:39,445 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:46:39,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:39,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 01:46:39,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:46:39,980 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:46:39,980 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:46:40,738 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:46:40,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882391705] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:46:40,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:46:40,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 25] total 73 [2025-04-14 01:46:40,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501099911] [2025-04-14 01:46:40,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:46:40,739 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2025-04-14 01:46:40,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:46:40,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2025-04-14 01:46:40,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1439, Invalid=4111, Unknown=0, NotChecked=0, Total=5550 [2025-04-14 01:46:40,742 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:46:40,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 34 transitions, 296 flow. Second operand has 75 states, 75 states have (on average 3.1333333333333333) internal successors, (235), 75 states have internal predecessors, (235), 0 states have call successors, (0), 0 states 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 01:46:40,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:46:40,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:46:40,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:46:42,375 INFO L116 PetriNetUnfolderBase]: 254/512 cut-off events. [2025-04-14 01:46:42,375 INFO L117 PetriNetUnfolderBase]: For 26320/26320 co-relation queries the response was YES. [2025-04-14 01:46:42,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2093 conditions, 512 events. 254/512 cut-off events. For 26320/26320 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1178 event pairs, 9 based on Foata normal form. 120/632 useless extension candidates. Maximal degree in co-relation 2015. Up to 196 conditions per place. [2025-04-14 01:46:42,378 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 150 selfloop transitions, 49 changer transitions 0/199 dead transitions. [2025-04-14 01:46:42,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 199 transitions, 1264 flow [2025-04-14 01:46:42,379 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-14 01:46:42,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2025-04-14 01:46:42,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 323 transitions. [2025-04-14 01:46:42,380 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34 [2025-04-14 01:46:42,380 INFO L175 Difference]: Start difference. First operand has 74 places, 34 transitions, 296 flow. Second operand 50 states and 323 transitions. [2025-04-14 01:46:42,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 199 transitions, 1264 flow [2025-04-14 01:46:42,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 199 transitions, 1039 flow, removed 98 selfloop flow, removed 14 redundant places. [2025-04-14 01:46:42,390 INFO L231 Difference]: Finished difference. Result has 133 places, 58 transitions, 507 flow [2025-04-14 01:46:42,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=507, PETRI_PLACES=133, PETRI_TRANSITIONS=58} [2025-04-14 01:46:42,390 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 113 predicate places. [2025-04-14 01:46:42,390 INFO L485 AbstractCegarLoop]: Abstraction has has 133 places, 58 transitions, 507 flow [2025-04-14 01:46:42,391 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 3.1333333333333333) internal successors, (235), 75 states have internal predecessors, (235), 0 states have call successors, (0), 0 states 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 01:46:42,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:46:42,391 INFO L206 CegarLoopForPetriNet]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:46:42,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-14 01:46:42,591 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:46:42,592 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:46:42,592 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:46:42,592 INFO L85 PathProgramCache]: Analyzing trace with hash 116305427, now seen corresponding path program 3 times [2025-04-14 01:46:42,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:46:42,592 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416294482] [2025-04-14 01:46:42,593 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:46:42,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:46:42,598 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 24 equivalence classes. [2025-04-14 01:46:42,611 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) and asserted 54 of 54 statements. [2025-04-14 01:46:42,611 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2025-04-14 01:46:42,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:43,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:46:43,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:46:43,700 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416294482] [2025-04-14 01:46:43,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416294482] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:46:43,700 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401304996] [2025-04-14 01:46:43,700 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:46:43,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:46:43,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:46:43,702 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:46:43,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-14 01:46:43,739 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 24 equivalence classes. [2025-04-14 01:46:43,763 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) and asserted 54 of 54 statements. [2025-04-14 01:46:43,763 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2025-04-14 01:46:43,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:43,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-14 01:46:43,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:46:45,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:46:45,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:46:47,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:46:47,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401304996] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:46:47,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:46:47,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 49, 49] total 145 [2025-04-14 01:46:47,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611631493] [2025-04-14 01:46:47,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:46:47,816 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 147 states [2025-04-14 01:46:47,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:46:47,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2025-04-14 01:46:47,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5747, Invalid=15715, Unknown=0, NotChecked=0, Total=21462 [2025-04-14 01:46:47,824 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:46:47,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 58 transitions, 507 flow. Second operand has 147 states, 147 states have (on average 3.068027210884354) internal successors, (451), 147 states have internal predecessors, (451), 0 states have call successors, (0), 0 states 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 01:46:47,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:46:47,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:46:47,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:46:53,389 INFO L116 PetriNetUnfolderBase]: 494/992 cut-off events. [2025-04-14 01:46:53,389 INFO L117 PetriNetUnfolderBase]: For 242561/242561 co-relation queries the response was YES. [2025-04-14 01:46:53,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3726 conditions, 992 events. 494/992 cut-off events. For 242561/242561 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2297 event pairs, 9 based on Foata normal form. 240/1232 useless extension candidates. Maximal degree in co-relation 3625. Up to 376 conditions per place. [2025-04-14 01:46:53,394 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 294 selfloop transitions, 97 changer transitions 0/391 dead transitions. [2025-04-14 01:46:53,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 391 transitions, 2339 flow [2025-04-14 01:46:53,394 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2025-04-14 01:46:53,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2025-04-14 01:46:53,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 635 transitions. [2025-04-14 01:46:53,397 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.341031149301826 [2025-04-14 01:46:53,397 INFO L175 Difference]: Start difference. First operand has 133 places, 58 transitions, 507 flow. Second operand 98 states and 635 transitions. [2025-04-14 01:46:53,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 391 transitions, 2339 flow [2025-04-14 01:46:53,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 391 transitions, 2047 flow, removed 121 selfloop flow, removed 25 redundant places. [2025-04-14 01:46:53,435 INFO L231 Difference]: Finished difference. Result has 253 places, 106 transitions, 987 flow [2025-04-14 01:46:53,436 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=98, PETRI_FLOW=987, PETRI_PLACES=253, PETRI_TRANSITIONS=106} [2025-04-14 01:46:53,436 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 233 predicate places. [2025-04-14 01:46:53,436 INFO L485 AbstractCegarLoop]: Abstraction has has 253 places, 106 transitions, 987 flow [2025-04-14 01:46:53,437 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 147 states, 147 states have (on average 3.068027210884354) internal successors, (451), 147 states have internal predecessors, (451), 0 states have call successors, (0), 0 states 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 01:46:53,437 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:46:53,437 INFO L206 CegarLoopForPetriNet]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:46:53,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-14 01:46:53,637 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:46:53,637 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:46:53,638 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:46:53,638 INFO L85 PathProgramCache]: Analyzing trace with hash 70334739, now seen corresponding path program 4 times [2025-04-14 01:46:53,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:46:53,638 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37365579] [2025-04-14 01:46:53,638 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:46:53,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:46:53,644 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 102 statements into 2 equivalence classes. [2025-04-14 01:46:53,673 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 102 of 102 statements. [2025-04-14 01:46:53,673 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:46:53,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:57,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:46:57,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:46:57,321 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37365579] [2025-04-14 01:46:57,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37365579] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:46:57,321 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597634486] [2025-04-14 01:46:57,321 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:46:57,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:46:57,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:46:57,323 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:46:57,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-14 01:46:57,363 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 102 statements into 2 equivalence classes. [2025-04-14 01:46:57,398 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 102 of 102 statements. [2025-04-14 01:46:57,398 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:46:57,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:57,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 99 conjuncts are in the unsatisfiable core [2025-04-14 01:46:57,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:47:00,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:00,632 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:47:03,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:03,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597634486] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:47:03,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:47:03,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 200 [2025-04-14 01:47:03,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3683773] [2025-04-14 01:47:03,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:47:03,855 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 202 states [2025-04-14 01:47:03,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:03,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2025-04-14 01:47:03,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15048, Invalid=25554, Unknown=0, NotChecked=0, Total=40602 [2025-04-14 01:47:03,865 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:47:03,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 106 transitions, 987 flow. Second operand has 202 states, 202 states have (on average 3.0495049504950495) internal successors, (616), 202 states have internal predecessors, (616), 0 states have call successors, (0), 0 states 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 01:47:03,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:03,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:47:03,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:10,708 INFO L116 PetriNetUnfolderBase]: 529/1062 cut-off events. [2025-04-14 01:47:10,709 INFO L117 PetriNetUnfolderBase]: For 170994/170994 co-relation queries the response was YES. [2025-04-14 01:47:10,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4259 conditions, 1062 events. 529/1062 cut-off events. For 170994/170994 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2462 event pairs, 9 based on Foata normal form. 35/1097 useless extension candidates. Maximal degree in co-relation 4110. Up to 291 conditions per place. [2025-04-14 01:47:10,715 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 315 selfloop transitions, 104 changer transitions 0/419 dead transitions. [2025-04-14 01:47:10,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 419 transitions, 2596 flow [2025-04-14 01:47:10,715 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2025-04-14 01:47:10,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2025-04-14 01:47:10,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 636 transitions. [2025-04-14 01:47:10,718 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.318796992481203 [2025-04-14 01:47:10,718 INFO L175 Difference]: Start difference. First operand has 253 places, 106 transitions, 987 flow. Second operand 105 states and 636 transitions. [2025-04-14 01:47:10,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 419 transitions, 2596 flow [2025-04-14 01:47:10,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 419 transitions, 2194 flow, removed 152 selfloop flow, removed 49 redundant places. [2025-04-14 01:47:10,836 INFO L231 Difference]: Finished difference. Result has 315 places, 113 transitions, 879 flow [2025-04-14 01:47:10,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=105, PETRI_FLOW=879, PETRI_PLACES=315, PETRI_TRANSITIONS=113} [2025-04-14 01:47:10,836 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 295 predicate places. [2025-04-14 01:47:10,836 INFO L485 AbstractCegarLoop]: Abstraction has has 315 places, 113 transitions, 879 flow [2025-04-14 01:47:10,837 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 202 states, 202 states have (on average 3.0495049504950495) internal successors, (616), 202 states have internal predecessors, (616), 0 states have call successors, (0), 0 states 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 01:47:10,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:10,837 INFO L206 CegarLoopForPetriNet]: trace histogram [101, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:10,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-14 01:47:11,037 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:47:11,038 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:47:11,039 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:11,039 INFO L85 PathProgramCache]: Analyzing trace with hash 160114796, now seen corresponding path program 5 times [2025-04-14 01:47:11,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:11,039 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794054114] [2025-04-14 01:47:11,039 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:47:11,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:11,045 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 109 statements into 52 equivalence classes. [2025-04-14 01:47:11,089 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 52 check-sat command(s) and asserted 109 of 109 statements. [2025-04-14 01:47:11,089 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 52 check-sat command(s) [2025-04-14 01:47:11,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 01:47:11,089 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 01:47:11,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-04-14 01:47:11,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-04-14 01:47:11,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:11,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 01:47:11,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 01:47:11,160 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 01:47:11,161 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-14 01:47:11,162 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-14 01:47:11,162 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-14 01:47:11,162 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-04-14 01:47:11,162 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 01:47:11,162 INFO L422 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1] [2025-04-14 01:47:11,281 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 01:47:11,281 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 01:47:11,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 01:47:11 BasicIcfg [2025-04-14 01:47:11,286 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 01:47:11,286 INFO L158 Benchmark]: Toolchain (without parser) took 36853.29ms. Allocated memory was 155.2MB in the beginning and 566.2MB in the end (delta: 411.0MB). Free memory was 108.3MB in the beginning and 207.7MB in the end (delta: -99.4MB). Peak memory consumption was 312.2MB. Max. memory is 8.0GB. [2025-04-14 01:47:11,286 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:47:11,286 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.82ms. Allocated memory is still 155.2MB. Free memory was 108.3MB in the beginning and 84.9MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-14 01:47:11,286 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.08ms. Allocated memory is still 155.2MB. Free memory was 84.9MB in the beginning and 83.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:47:11,287 INFO L158 Benchmark]: Boogie Preprocessor took 31.48ms. Allocated memory is still 155.2MB. Free memory was 83.2MB in the beginning and 81.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:47:11,287 INFO L158 Benchmark]: IcfgBuilder took 343.00ms. Allocated memory is still 155.2MB. Free memory was 81.6MB in the beginning and 60.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-14 01:47:11,287 INFO L158 Benchmark]: TraceAbstraction took 36160.12ms. Allocated memory was 155.2MB in the beginning and 566.2MB in the end (delta: 411.0MB). Free memory was 59.8MB in the beginning and 207.7MB in the end (delta: -147.9MB). Peak memory consumption was 261.9MB. Max. memory is 8.0GB. [2025-04-14 01:47:11,288 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 284.82ms. Allocated memory is still 155.2MB. Free memory was 108.3MB in the beginning and 84.9MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.08ms. Allocated memory is still 155.2MB. Free memory was 84.9MB in the beginning and 83.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 31.48ms. Allocated memory is still 155.2MB. Free memory was 83.2MB in the beginning and 81.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 343.00ms. Allocated memory is still 155.2MB. Free memory was 81.6MB in the beginning and 60.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 36160.12ms. Allocated memory was 155.2MB in the beginning and 566.2MB in the end (delta: 411.0MB). Free memory was 59.8MB in the beginning and 207.7MB in the end (delta: -147.9MB). Peak memory consumption was 261.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 753]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L772] 0 _N = 100 [L773] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L773] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L774] 0 pthread_t t1, t2; [L775] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [\at(arg, Pre)={0:0}, _N=100, limit=0, t1=-1] [L757] COND FALSE 1 !(__VERIFIER_nondet_int()) [L776] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, limit=0, t1=-1, t2=0] [L760] 1 limit = _N + 1 VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, limit=101] [L765] 2 int i, bound; [L766] 2 bound = limit [L767] 2 i = 0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=0, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=1, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=2, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=3, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=4, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=5, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=6, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=7, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=8, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=9, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=10, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=11, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=12, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=13, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=14, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=15, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=16, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=17, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=18, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=19, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=20, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=21, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=22, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=23, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=24, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=25, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=26, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=27, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=28, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=29, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=30, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=31, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=32, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=33, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=34, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=35, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=36, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=37, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=38, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=39, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=40, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=41, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=42, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=43, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=44, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=45, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=46, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=47, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=48, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=49, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=50, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=51, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=52, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=53, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=54, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=55, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=56, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=57, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=58, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=59, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=60, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=61, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=62, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=63, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=64, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=65, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=66, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=67, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=68, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=69, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=70, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=71, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=72, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=73, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=74, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=75, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=76, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=77, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=78, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=79, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=80, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=81, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=82, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=83, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=84, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=85, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=86, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=87, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=88, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=89, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=90, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=91, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=92, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=93, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=94, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=95, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=96, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=97, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=98, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=99, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=100, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=101, limit=101] [L767] COND FALSE 2 !(i < bound) [L768] CALL 2 __VERIFIER_assert(i <= _N) [L753] COND TRUE 2 !expression [L753] 2 reach_error() VAL [\at(arg, Pre)={0:0}, \at(expression, Pre)=0, _N=100, arg={0:0}, expression=0, limit=101] - UnprovableResult [Line: 775]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 776]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 29 locations, 32 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: 36.0s, OverallIterations: 10, TraceHistogramMax: 101, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 15.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5138 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5138 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2487 IncrementalHoareTripleChecker+Invalid, 2496 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 0 mSDtfsCounter, 2487 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 953 GetRequests, 91 SyntacticMatches, 92 SemanticMatches, 770 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57347 ImplicationChecksByTransitivity, 24.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=987occurred in iteration=8, InterpolantAutomatonStates: 314, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 18.3s InterpolantComputationTime, 608 NumberOfCodeBlocks, 592 NumberOfCodeBlocksAsserted, 122 NumberOfCheckSat, 719 ConstructedInterpolants, 0 QuantifiedInterpolants, 3599 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1057 ConjunctsInSsa, 214 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 136/17761 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-14 01:47:11,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...