/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/pthread-theta/unwind1-100.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:07:32,183 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:07:32,239 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 21:07:32,246 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:07:32,246 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:07:32,270 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:07:32,271 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:07:32,271 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:07:32,271 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:07:32,271 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:07:32,271 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:07:32,271 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:07:32,272 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:07:32,272 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:07:32,272 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:07:32,272 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:07:32,272 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:07:32,272 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:07:32,272 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:07:32,272 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:07:32,272 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:07:32,272 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:07:32,272 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:07:32,272 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:07:32,272 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:07:32,272 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:07:32,272 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:07:32,273 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:07:32,273 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:07:32,273 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:07:32,273 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:07:32,273 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:07:32,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:07:32,273 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:07:32,273 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:07:32,273 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:07:32,273 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:07:32,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:07:32,273 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:07:32,273 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:07:32,273 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:07:32,275 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:07:32,275 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:07:32,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:07:32,275 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:07:32,275 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:07:32,275 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:07:32,275 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 21:07:32,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:07:32,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:07:32,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:07:32,517 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:07:32,518 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:07:32,520 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-13 21:07:33,885 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc059fa2b/4f048e05fef24c83b2975d547f576999/FLAGf4d02a685 [2025-04-13 21:07:34,135 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:07:34,136 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/unwind1-100.i [2025-04-13 21:07:34,155 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc059fa2b/4f048e05fef24c83b2975d547f576999/FLAGf4d02a685 [2025-04-13 21:07:34,935 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc059fa2b/4f048e05fef24c83b2975d547f576999 [2025-04-13 21:07:34,937 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:07:34,938 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:07:34,939 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:07:34,939 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:07:34,942 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:07:34,943 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:07:34" (1/1) ... [2025-04-13 21:07:34,943 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16a93716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:34, skipping insertion in model container [2025-04-13 21:07:34,943 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:07:34" (1/1) ... [2025-04-13 21:07:34,969 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:07:35,262 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-13 21:07:35,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:07:35,286 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:07:35,339 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-13 21:07:35,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:07:35,377 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:07:35,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:35 WrapperNode [2025-04-13 21:07:35,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:07:35,380 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:07:35,380 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:07:35,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:07:35,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:35" (1/1) ... [2025-04-13 21:07:35,403 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:35" (1/1) ... [2025-04-13 21:07:35,421 INFO L138 Inliner]: procedures = 169, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 51 [2025-04-13 21:07:35,422 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:07:35,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:07:35,423 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:07:35,423 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:07:35,428 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:35" (1/1) ... [2025-04-13 21:07:35,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:35" (1/1) ... [2025-04-13 21:07:35,431 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:35" (1/1) ... [2025-04-13 21:07:35,448 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 21:07:35,449 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:35" (1/1) ... [2025-04-13 21:07:35,449 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:35" (1/1) ... [2025-04-13 21:07:35,455 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:35" (1/1) ... [2025-04-13 21:07:35,455 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:35" (1/1) ... [2025-04-13 21:07:35,457 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:35" (1/1) ... [2025-04-13 21:07:35,461 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:35" (1/1) ... [2025-04-13 21:07:35,462 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:35" (1/1) ... [2025-04-13 21:07:35,469 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:07:35,469 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 21:07:35,469 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 21:07:35,470 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 21:07:35,470 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:35" (1/1) ... [2025-04-13 21:07:35,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:07:35,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:07:35,499 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 21:07:35,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 21:07:35,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:07:35,522 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-04-13 21:07:35,522 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-04-13 21:07:35,522 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-04-13 21:07:35,522 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-04-13 21:07:35,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:07:35,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:07:35,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:07:35,523 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 21:07:35,622 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 21:07:35,623 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:07:35,732 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:07:35,733 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:07:35,733 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 21:07:35,816 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:07:35,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 09:07:35 BoogieIcfgContainer [2025-04-13 21:07:35,816 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 21:07:35,818 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:07:35,818 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:07:35,821 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:07:35,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:07:34" (1/3) ... [2025-04-13 21:07:35,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e00f433 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:07:35, skipping insertion in model container [2025-04-13 21:07:35,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:35" (2/3) ... [2025-04-13 21:07:35,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e00f433 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:07:35, skipping insertion in model container [2025-04-13 21:07:35,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 09:07:35" (3/3) ... [2025-04-13 21:07:35,824 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind1-100.i [2025-04-13 21:07:35,835 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:07:35,836 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-13 21:07:35,836 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:07:35,871 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 21:07:35,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 19 transitions, 52 flow [2025-04-13 21:07:35,924 INFO L116 PetriNetUnfolderBase]: 2/17 cut-off events. [2025-04-13 21:07:35,927 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 21:07:35,928 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 17 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-13 21:07:35,929 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 19 transitions, 52 flow [2025-04-13 21:07:35,932 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 15 transitions, 39 flow [2025-04-13 21:07:35,945 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:07:35,955 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;@5b6268de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:07:35,956 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 21:07:35,963 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 21:07:35,964 INFO L116 PetriNetUnfolderBase]: 2/12 cut-off events. [2025-04-13 21:07:35,964 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 21:07:35,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:35,964 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 21:07:35,965 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:07:35,970 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:35,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1429340420, now seen corresponding path program 1 times [2025-04-13 21:07:35,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:35,977 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105404016] [2025-04-13 21:07:35,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:35,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:36,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 21:07:36,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 21:07:36,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:36,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:36,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:07:36,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:36,313 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105404016] [2025-04-13 21:07:36,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105404016] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:07:36,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:07:36,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:07:36,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124681207] [2025-04-13 21:07:36,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:07:36,320 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:07:36,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:36,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:07:36,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:07:36,357 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2025-04-13 21:07:36,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 15 transitions, 39 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:07:36,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:36,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2025-04-13 21:07:36,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:36,446 INFO L116 PetriNetUnfolderBase]: 72/127 cut-off events. [2025-04-13 21:07:36,446 INFO L117 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-04-13 21:07:36,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 127 events. 72/127 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 375 event pairs, 31 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 234. Up to 76 conditions per place. [2025-04-13 21:07:36,449 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 16 selfloop transitions, 4 changer transitions 0/22 dead transitions. [2025-04-13 21:07:36,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 22 transitions, 96 flow [2025-04-13 21:07:36,453 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:07:36,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 21:07:36,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2025-04-13 21:07:36,462 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4868421052631579 [2025-04-13 21:07:36,463 INFO L175 Difference]: Start difference. First operand has 20 places, 15 transitions, 39 flow. Second operand 4 states and 37 transitions. [2025-04-13 21:07:36,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 22 transitions, 96 flow [2025-04-13 21:07:36,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 22 transitions, 89 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 21:07:36,471 INFO L231 Difference]: Finished difference. Result has 22 places, 17 transitions, 59 flow [2025-04-13 21:07:36,474 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=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=59, PETRI_PLACES=22, PETRI_TRANSITIONS=17} [2025-04-13 21:07:36,477 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 2 predicate places. [2025-04-13 21:07:36,477 INFO L485 AbstractCegarLoop]: Abstraction has has 22 places, 17 transitions, 59 flow [2025-04-13 21:07:36,477 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:07:36,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:36,477 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:07:36,477 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:07:36,478 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:07:36,478 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:36,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1359880203, now seen corresponding path program 1 times [2025-04-13 21:07:36,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:36,478 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019112784] [2025-04-13 21:07:36,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:36,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:36,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 21:07:36,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 21:07:36,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:36,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:36,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:07:36,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:36,580 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019112784] [2025-04-13 21:07:36,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019112784] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:07:36,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:07:36,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:07:36,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480935731] [2025-04-13 21:07:36,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:07:36,581 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:07:36,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:36,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:07:36,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:07:36,589 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:07:36,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 17 transitions, 59 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-13 21:07:36,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:36,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:07:36,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:36,689 INFO L116 PetriNetUnfolderBase]: 73/137 cut-off events. [2025-04-13 21:07:36,690 INFO L117 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-04-13 21:07:36,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 137 events. 73/137 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 387 event pairs, 18 based on Foata normal form. 11/135 useless extension candidates. Maximal degree in co-relation 222. Up to 70 conditions per place. [2025-04-13 21:07:36,691 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 15 selfloop transitions, 3 changer transitions 13/31 dead transitions. [2025-04-13 21:07:36,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 31 transitions, 160 flow [2025-04-13 21:07:36,692 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:07:36,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 21:07:36,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2025-04-13 21:07:36,693 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43157894736842106 [2025-04-13 21:07:36,693 INFO L175 Difference]: Start difference. First operand has 22 places, 17 transitions, 59 flow. Second operand 5 states and 41 transitions. [2025-04-13 21:07:36,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 31 transitions, 160 flow [2025-04-13 21:07:36,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 31 transitions, 159 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 21:07:36,694 INFO L231 Difference]: Finished difference. Result has 28 places, 15 transitions, 63 flow [2025-04-13 21:07:36,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=63, PETRI_PLACES=28, PETRI_TRANSITIONS=15} [2025-04-13 21:07:36,695 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 8 predicate places. [2025-04-13 21:07:36,695 INFO L485 AbstractCegarLoop]: Abstraction has has 28 places, 15 transitions, 63 flow [2025-04-13 21:07:36,695 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-13 21:07:36,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:36,695 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:07:36,695 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 21:07:36,695 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:07:36,696 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:36,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1684785237, now seen corresponding path program 1 times [2025-04-13 21:07:36,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:36,696 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361381674] [2025-04-13 21:07:36,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:36,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:36,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 21:07:36,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 21:07:36,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:36,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:36,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:07:36,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:36,789 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361381674] [2025-04-13 21:07:36,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361381674] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:07:36,789 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748042773] [2025-04-13 21:07:36,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:36,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:07:36,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:07:36,792 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:07:36,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 21:07:36,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 21:07:36,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 21:07:36,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:36,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:36,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 21:07:36,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:07:36,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:07:36,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:07:36,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:07:36,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748042773] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:07:36,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:07:36,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2025-04-13 21:07:36,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76622380] [2025-04-13 21:07:36,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:07:36,977 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:07:36,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:36,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:07:36,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:07:36,988 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:07:36,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 15 transitions, 63 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-13 21:07:36,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:36,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:07:36,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:37,174 INFO L116 PetriNetUnfolderBase]: 51/103 cut-off events. [2025-04-13 21:07:37,175 INFO L117 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-04-13 21:07:37,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 103 events. 51/103 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 227 event pairs, 12 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 210. Up to 44 conditions per place. [2025-04-13 21:07:37,176 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 25 selfloop transitions, 8 changer transitions 0/33 dead transitions. [2025-04-13 21:07:37,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 33 transitions, 177 flow [2025-04-13 21:07:37,181 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 21:07:37,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 21:07:37,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2025-04-13 21:07:37,182 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34210526315789475 [2025-04-13 21:07:37,182 INFO L175 Difference]: Start difference. First operand has 28 places, 15 transitions, 63 flow. Second operand 8 states and 52 transitions. [2025-04-13 21:07:37,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 33 transitions, 177 flow [2025-04-13 21:07:37,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 33 transitions, 159 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-04-13 21:07:37,183 INFO L231 Difference]: Finished difference. Result has 29 places, 18 transitions, 87 flow [2025-04-13 21:07:37,183 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-13 21:07:37,184 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2025-04-13 21:07:37,184 INFO L485 AbstractCegarLoop]: Abstraction has has 29 places, 18 transitions, 87 flow [2025-04-13 21:07:37,185 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-13 21:07:37,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:37,185 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:07:37,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 21:07:37,385 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:07:37,386 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:07:37,386 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:37,386 INFO L85 PathProgramCache]: Analyzing trace with hash -449032412, now seen corresponding path program 2 times [2025-04-13 21:07:37,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:37,386 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177962385] [2025-04-13 21:07:37,386 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:07:37,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:37,392 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-04-13 21:07:37,403 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 21:07:37,403 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:07:37,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:37,534 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-13 21:07:37,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:37,534 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177962385] [2025-04-13 21:07:37,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177962385] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:07:37,534 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152612001] [2025-04-13 21:07:37,534 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:07:37,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:07:37,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:07:37,536 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:07:37,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 21:07:37,575 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-04-13 21:07:37,588 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 21:07:37,588 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:07:37,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:37,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 21:07:37,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:07:37,673 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-13 21:07:37,674 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:07:37,763 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-13 21:07:37,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152612001] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:07:37,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:07:37,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-04-13 21:07:37,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882424539] [2025-04-13 21:07:37,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:07:37,765 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 21:07:37,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:37,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 21:07:37,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2025-04-13 21:07:37,820 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2025-04-13 21:07:37,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 18 transitions, 87 flow. Second operand has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 19 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:07:37,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:37,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2025-04-13 21:07:37,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:38,014 INFO L116 PetriNetUnfolderBase]: 75/154 cut-off events. [2025-04-13 21:07:38,014 INFO L117 PetriNetUnfolderBase]: For 146/146 co-relation queries the response was YES. [2025-04-13 21:07:38,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 154 events. 75/154 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 353 event pairs, 19 based on Foata normal form. 30/179 useless extension candidates. Maximal degree in co-relation 223. Up to 61 conditions per place. [2025-04-13 21:07:38,019 INFO L140 encePairwiseOnDemand]: 15/19 looper letters, 40 selfloop transitions, 12 changer transitions 0/54 dead transitions. [2025-04-13 21:07:38,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 54 transitions, 297 flow [2025-04-13 21:07:38,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 21:07:38,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 21:07:38,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 110 transitions. [2025-04-13 21:07:38,021 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44534412955465585 [2025-04-13 21:07:38,021 INFO L175 Difference]: Start difference. First operand has 29 places, 18 transitions, 87 flow. Second operand 13 states and 110 transitions. [2025-04-13 21:07:38,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 54 transitions, 297 flow [2025-04-13 21:07:38,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 54 transitions, 274 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-04-13 21:07:38,023 INFO L231 Difference]: Finished difference. Result has 43 places, 24 transitions, 150 flow [2025-04-13 21:07:38,023 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-13 21:07:38,025 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 23 predicate places. [2025-04-13 21:07:38,026 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 24 transitions, 150 flow [2025-04-13 21:07:38,026 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 19 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:07:38,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:38,026 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:07:38,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 21:07:38,226 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-13 21:07:38,227 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:07:38,227 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:38,227 INFO L85 PathProgramCache]: Analyzing trace with hash 505495174, now seen corresponding path program 3 times [2025-04-13 21:07:38,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:38,227 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154821749] [2025-04-13 21:07:38,227 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:07:38,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:38,238 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 6 equivalence classes. [2025-04-13 21:07:38,242 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 10 of 18 statements. [2025-04-13 21:07:38,243 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:07:38,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:38,296 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-13 21:07:38,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:38,296 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154821749] [2025-04-13 21:07:38,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154821749] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:07:38,297 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794904778] [2025-04-13 21:07:38,297 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:07:38,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:07:38,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:07:38,302 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:07:38,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 21:07:38,336 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 6 equivalence classes. [2025-04-13 21:07:38,346 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 10 of 18 statements. [2025-04-13 21:07:38,346 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:07:38,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:38,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 21:07:38,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:07:38,375 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-13 21:07:38,375 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:07:38,411 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-13 21:07:38,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794904778] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:07:38,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:07:38,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-04-13 21:07:38,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714707477] [2025-04-13 21:07:38,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:07:38,411 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:07:38,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:38,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:07:38,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:07:38,421 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:07:38,421 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-13 21:07:38,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:38,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:07:38,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:38,493 INFO L116 PetriNetUnfolderBase]: 143/289 cut-off events. [2025-04-13 21:07:38,493 INFO L117 PetriNetUnfolderBase]: For 390/390 co-relation queries the response was YES. [2025-04-13 21:07:38,494 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 923 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-13 21:07:38,495 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 23 selfloop transitions, 2 changer transitions 22/47 dead transitions. [2025-04-13 21:07:38,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 47 transitions, 369 flow [2025-04-13 21:07:38,495 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:07:38,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 21:07:38,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2025-04-13 21:07:38,496 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4105263157894737 [2025-04-13 21:07:38,496 INFO L175 Difference]: Start difference. First operand has 43 places, 24 transitions, 150 flow. Second operand 5 states and 39 transitions. [2025-04-13 21:07:38,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 47 transitions, 369 flow [2025-04-13 21:07:38,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 47 transitions, 280 flow, removed 36 selfloop flow, removed 5 redundant places. [2025-04-13 21:07:38,500 INFO L231 Difference]: Finished difference. Result has 45 places, 22 transitions, 112 flow [2025-04-13 21:07:38,500 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-13 21:07:38,500 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 25 predicate places. [2025-04-13 21:07:38,500 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 22 transitions, 112 flow [2025-04-13 21:07:38,501 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-13 21:07:38,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:38,501 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:07:38,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 21:07:38,705 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-13 21:07:38,705 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:07:38,706 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:38,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1361155620, now seen corresponding path program 1 times [2025-04-13 21:07:38,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:38,706 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339820466] [2025-04-13 21:07:38,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:38,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:38,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 21:07:38,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:07:38,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:38,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:38,872 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-13 21:07:38,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:38,872 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339820466] [2025-04-13 21:07:38,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339820466] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:07:38,872 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796874346] [2025-04-13 21:07:38,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:38,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:07:38,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:07:38,874 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:07:38,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 21:07:38,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 21:07:38,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:07:38,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:38,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:38,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 21:07:38,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:07:39,091 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-13 21:07:39,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:07:39,325 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-13 21:07:39,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796874346] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:07:39,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:07:39,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2025-04-13 21:07:39,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740634883] [2025-04-13 21:07:39,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:07:39,326 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 21:07:39,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:39,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 21:07:39,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=922, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 21:07:39,337 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:07:39,337 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-13 21:07:39,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:39,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:07:39,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:39,866 INFO L116 PetriNetUnfolderBase]: 134/272 cut-off events. [2025-04-13 21:07:39,867 INFO L117 PetriNetUnfolderBase]: For 3085/3085 co-relation queries the response was YES. [2025-04-13 21:07:39,867 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 616 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-13 21:07:39,868 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 78 selfloop transitions, 25 changer transitions 0/103 dead transitions. [2025-04-13 21:07:39,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 103 transitions, 576 flow [2025-04-13 21:07:39,869 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 21:07:39,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-04-13 21:07:39,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 167 transitions. [2025-04-13 21:07:39,871 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33805668016194335 [2025-04-13 21:07:39,871 INFO L175 Difference]: Start difference. First operand has 45 places, 22 transitions, 112 flow. Second operand 26 states and 167 transitions. [2025-04-13 21:07:39,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 103 transitions, 576 flow [2025-04-13 21:07:39,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 103 transitions, 564 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-04-13 21:07:39,874 INFO L231 Difference]: Finished difference. Result has 74 places, 34 transitions, 296 flow [2025-04-13 21:07:39,874 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-13 21:07:39,875 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 54 predicate places. [2025-04-13 21:07:39,875 INFO L485 AbstractCegarLoop]: Abstraction has has 74 places, 34 transitions, 296 flow [2025-04-13 21:07:39,875 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-13 21:07:39,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:39,875 INFO L206 CegarLoopForPetriNet]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:07:39,882 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-13 21:07:40,076 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-13 21:07:40,076 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:07:40,077 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:40,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1185112932, now seen corresponding path program 2 times [2025-04-13 21:07:40,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:40,077 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80299764] [2025-04-13 21:07:40,077 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:07:40,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:40,081 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 21:07:40,089 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 21:07:40,089 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:07:40,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:40,520 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-13 21:07:40,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:40,520 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80299764] [2025-04-13 21:07:40,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80299764] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:07:40,520 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286820463] [2025-04-13 21:07:40,520 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:07:40,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:07:40,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:07:40,522 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:07:40,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 21:07:40,558 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 21:07:40,573 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 21:07:40,573 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:07:40,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:40,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 21:07:40,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:07:41,203 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-13 21:07:41,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:07:42,076 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-13 21:07:42,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286820463] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:07:42,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:07:42,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 25] total 73 [2025-04-13 21:07:42,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129782282] [2025-04-13 21:07:42,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:07:42,077 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2025-04-13 21:07:42,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:42,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2025-04-13 21:07:42,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1439, Invalid=4111, Unknown=0, NotChecked=0, Total=5550 [2025-04-13 21:07:42,104 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:07:42,105 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-13 21:07:42,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:42,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:07:42,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:43,956 INFO L116 PetriNetUnfolderBase]: 254/512 cut-off events. [2025-04-13 21:07:43,957 INFO L117 PetriNetUnfolderBase]: For 26320/26320 co-relation queries the response was YES. [2025-04-13 21:07:43,958 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 1177 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-13 21:07:43,960 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 150 selfloop transitions, 49 changer transitions 0/199 dead transitions. [2025-04-13 21:07:43,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 199 transitions, 1264 flow [2025-04-13 21:07:43,961 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-13 21:07:43,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2025-04-13 21:07:43,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 323 transitions. [2025-04-13 21:07:43,963 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34 [2025-04-13 21:07:43,963 INFO L175 Difference]: Start difference. First operand has 74 places, 34 transitions, 296 flow. Second operand 50 states and 323 transitions. [2025-04-13 21:07:43,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 199 transitions, 1264 flow [2025-04-13 21:07:43,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 199 transitions, 1039 flow, removed 98 selfloop flow, removed 14 redundant places. [2025-04-13 21:07:43,974 INFO L231 Difference]: Finished difference. Result has 133 places, 58 transitions, 507 flow [2025-04-13 21:07:43,974 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-13 21:07:43,974 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 113 predicate places. [2025-04-13 21:07:43,974 INFO L485 AbstractCegarLoop]: Abstraction has has 133 places, 58 transitions, 507 flow [2025-04-13 21:07:43,975 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-13 21:07:43,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:43,975 INFO L206 CegarLoopForPetriNet]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:07:43,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 21:07:44,179 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-13 21:07:44,179 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:07:44,180 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:44,180 INFO L85 PathProgramCache]: Analyzing trace with hash 198794724, now seen corresponding path program 3 times [2025-04-13 21:07:44,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:44,180 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774703082] [2025-04-13 21:07:44,180 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:07:44,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:44,185 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 24 equivalence classes. [2025-04-13 21:07:44,202 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 21:07:44,202 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2025-04-13 21:07:44,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:45,225 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-13 21:07:45,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:45,225 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774703082] [2025-04-13 21:07:45,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774703082] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:07:45,225 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929424085] [2025-04-13 21:07:45,225 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:07:45,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:07:45,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:07:45,227 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:07:45,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 21:07:45,264 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 24 equivalence classes. [2025-04-13 21:07:45,291 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 21:07:45,291 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2025-04-13 21:07:45,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:45,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-13 21:07:45,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:07:46,817 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-13 21:07:46,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:07:49,461 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-13 21:07:49,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929424085] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:07:49,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:07:49,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 49, 49] total 145 [2025-04-13 21:07:49,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46308557] [2025-04-13 21:07:49,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:07:49,462 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 147 states [2025-04-13 21:07:49,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:49,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2025-04-13 21:07:49,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5747, Invalid=15715, Unknown=0, NotChecked=0, Total=21462 [2025-04-13 21:07:49,524 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:07:49,524 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-13 21:07:49,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:49,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:07:49,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:55,120 INFO L116 PetriNetUnfolderBase]: 494/992 cut-off events. [2025-04-13 21:07:55,120 INFO L117 PetriNetUnfolderBase]: For 242561/242561 co-relation queries the response was YES. [2025-04-13 21:07:55,123 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 2300 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-13 21:07:55,126 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 294 selfloop transitions, 97 changer transitions 0/391 dead transitions. [2025-04-13 21:07:55,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 391 transitions, 2339 flow [2025-04-13 21:07:55,127 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2025-04-13 21:07:55,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2025-04-13 21:07:55,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 635 transitions. [2025-04-13 21:07:55,129 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.341031149301826 [2025-04-13 21:07:55,129 INFO L175 Difference]: Start difference. First operand has 133 places, 58 transitions, 507 flow. Second operand 98 states and 635 transitions. [2025-04-13 21:07:55,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 391 transitions, 2339 flow [2025-04-13 21:07:55,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 391 transitions, 2047 flow, removed 121 selfloop flow, removed 25 redundant places. [2025-04-13 21:07:55,168 INFO L231 Difference]: Finished difference. Result has 253 places, 106 transitions, 987 flow [2025-04-13 21:07:55,168 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-13 21:07:55,169 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 233 predicate places. [2025-04-13 21:07:55,169 INFO L485 AbstractCegarLoop]: Abstraction has has 253 places, 106 transitions, 987 flow [2025-04-13 21:07:55,171 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-13 21:07:55,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:55,171 INFO L206 CegarLoopForPetriNet]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:07:55,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 21:07:55,371 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-13 21:07:55,371 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:07:55,372 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:55,372 INFO L85 PathProgramCache]: Analyzing trace with hash -774974748, now seen corresponding path program 4 times [2025-04-13 21:07:55,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:55,373 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881671943] [2025-04-13 21:07:55,373 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:07:55,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:55,385 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 102 statements into 2 equivalence classes. [2025-04-13 21:07:55,424 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 102 of 102 statements. [2025-04-13 21:07:55,424 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:07:55,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:59,275 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-13 21:07:59,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:59,275 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881671943] [2025-04-13 21:07:59,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881671943] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:07:59,275 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161526052] [2025-04-13 21:07:59,275 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:07:59,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:07:59,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:07:59,277 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:07:59,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 21:07:59,321 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 102 statements into 2 equivalence classes. [2025-04-13 21:07:59,359 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 102 of 102 statements. [2025-04-13 21:07:59,359 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:07:59,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:59,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 99 conjuncts are in the unsatisfiable core [2025-04-13 21:07:59,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:08:02,683 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-13 21:08:02,683 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:08:05,909 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-13 21:08:05,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161526052] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:08:05,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:08:05,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 200 [2025-04-13 21:08:05,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062230413] [2025-04-13 21:08:05,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:08:05,910 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 202 states [2025-04-13 21:08:05,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:05,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2025-04-13 21:08:05,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15048, Invalid=25554, Unknown=0, NotChecked=0, Total=40602 [2025-04-13 21:08:05,971 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:08:05,971 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-13 21:08:05,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:05,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:08:05,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:12,940 INFO L116 PetriNetUnfolderBase]: 529/1062 cut-off events. [2025-04-13 21:08:12,940 INFO L117 PetriNetUnfolderBase]: For 170994/170994 co-relation queries the response was YES. [2025-04-13 21:08:12,945 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 2458 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-13 21:08:12,949 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 315 selfloop transitions, 104 changer transitions 0/419 dead transitions. [2025-04-13 21:08:12,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 419 transitions, 2596 flow [2025-04-13 21:08:12,949 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2025-04-13 21:08:12,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2025-04-13 21:08:12,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 636 transitions. [2025-04-13 21:08:12,951 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.318796992481203 [2025-04-13 21:08:12,952 INFO L175 Difference]: Start difference. First operand has 253 places, 106 transitions, 987 flow. Second operand 105 states and 636 transitions. [2025-04-13 21:08:12,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 419 transitions, 2596 flow [2025-04-13 21:08:13,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 419 transitions, 2194 flow, removed 152 selfloop flow, removed 49 redundant places. [2025-04-13 21:08:13,083 INFO L231 Difference]: Finished difference. Result has 315 places, 113 transitions, 879 flow [2025-04-13 21:08:13,084 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-13 21:08:13,084 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 295 predicate places. [2025-04-13 21:08:13,084 INFO L485 AbstractCegarLoop]: Abstraction has has 315 places, 113 transitions, 879 flow [2025-04-13 21:08:13,085 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-13 21:08:13,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:13,085 INFO L206 CegarLoopForPetriNet]: trace histogram [101, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:13,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 21:08:13,289 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-13 21:08:13,289 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:08:13,290 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:13,290 INFO L85 PathProgramCache]: Analyzing trace with hash -292598901, now seen corresponding path program 5 times [2025-04-13 21:08:13,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:13,290 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047337177] [2025-04-13 21:08:13,290 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:08:13,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:13,296 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 109 statements into 52 equivalence classes. [2025-04-13 21:08:13,360 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 52 check-sat command(s) and asserted 109 of 109 statements. [2025-04-13 21:08:13,361 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 52 check-sat command(s) [2025-04-13 21:08:13,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:08:13,361 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 21:08:13,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-04-13 21:08:13,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-04-13 21:08:13,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:13,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:08:13,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 21:08:13,455 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 21:08:13,456 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 21:08:13,457 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 21:08:13,457 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 21:08:13,457 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-04-13 21:08:13,457 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 21:08:13,458 INFO L422 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1] [2025-04-13 21:08:13,595 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 21:08:13,595 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 21:08:13,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 09:08:13 BasicIcfg [2025-04-13 21:08:13,604 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 21:08:13,605 INFO L158 Benchmark]: Toolchain (without parser) took 38666.03ms. Allocated memory was 125.8MB in the beginning and 541.1MB in the end (delta: 415.2MB). Free memory was 86.8MB in the beginning and 177.2MB in the end (delta: -90.4MB). Peak memory consumption was 324.8MB. Max. memory is 8.0GB. [2025-04-13 21:08:13,605 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 167.8MB. Free memory is still 97.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:08:13,605 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.39ms. Allocated memory is still 125.8MB. Free memory was 86.8MB in the beginning and 63.7MB in the end (delta: 23.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 21:08:13,606 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.97ms. Allocated memory is still 125.8MB. Free memory was 63.7MB in the beginning and 61.6MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:08:13,606 INFO L158 Benchmark]: Boogie Preprocessor took 45.94ms. Allocated memory is still 125.8MB. Free memory was 61.6MB in the beginning and 60.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:08:13,606 INFO L158 Benchmark]: RCFGBuilder took 347.12ms. Allocated memory is still 125.8MB. Free memory was 60.1MB in the beginning and 39.6MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 21:08:13,606 INFO L158 Benchmark]: TraceAbstraction took 37785.71ms. Allocated memory was 125.8MB in the beginning and 541.1MB in the end (delta: 415.2MB). Free memory was 39.1MB in the beginning and 177.2MB in the end (delta: -138.1MB). Peak memory consumption was 278.6MB. Max. memory is 8.0GB. [2025-04-13 21:08:13,607 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.26ms. Allocated memory is still 167.8MB. Free memory is still 97.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 440.39ms. Allocated memory is still 125.8MB. Free memory was 86.8MB in the beginning and 63.7MB in the end (delta: 23.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.97ms. Allocated memory is still 125.8MB. Free memory was 63.7MB in the beginning and 61.6MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.94ms. Allocated memory is still 125.8MB. Free memory was 61.6MB in the beginning and 60.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 347.12ms. Allocated memory is still 125.8MB. Free memory was 60.1MB in the beginning and 39.6MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 37785.71ms. Allocated memory was 125.8MB in the beginning and 541.1MB in the end (delta: 415.2MB). Free memory was 39.1MB in the beginning and 177.2MB in the end (delta: -138.1MB). Peak memory consumption was 278.6MB. 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: 37.6s, OverallIterations: 10, TraceHistogramMax: 101, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 16.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5225 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5215 mSDsluCounter, 556 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 554 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2791 IncrementalHoareTripleChecker+Invalid, 2800 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 2 mSDtfsCounter, 2791 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 953 GetRequests, 91 SyntacticMatches, 92 SemanticMatches, 770 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57347 ImplicationChecksByTransitivity, 25.0s 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, 19.0s InterpolantComputationTime, 608 NumberOfCodeBlocks, 592 NumberOfCodeBlocksAsserted, 122 NumberOfCheckSat, 719 ConstructedInterpolants, 0 QuantifiedInterpolants, 3605 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-13 21:08:13,622 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...