/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/unwind2-nondet.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:08:17,428 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:08:17,471 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:08:17,477 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:08:17,477 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:08:17,491 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:08:17,491 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:08:17,491 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:08:17,491 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:08:17,491 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:08:17,491 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:08:17,492 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:08:17,492 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:08:17,492 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:08:17,492 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:08:17,492 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:08:17,492 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:08:17,492 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:08:17,492 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:08:17,492 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:08:17,492 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:08:17,492 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:08:17,492 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:08:17,492 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:08:17,492 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:08:17,493 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:08:17,493 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:08:17,493 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:08:17,493 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:08:17,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:08:17,493 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:08:17,493 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:08:17,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:08:17,493 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:08:17,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:08:17,493 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:08:17,493 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:08:17,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:08:17,493 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:08:17,493 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:08:17,493 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:08:17,493 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:08:17,493 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:08:17,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:08:17,494 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:08:17,494 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:08:17,494 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:08:17,494 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:08:17,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:08:17,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:08:17,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:08:17,697 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:08:17,698 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:08:17,700 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-theta/unwind2-nondet.i [2025-04-13 21:08:19,003 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41eac8a3b/3a5d72b5061648f99a4a738c0eae95e0/FLAGf25b021c4 [2025-04-13 21:08:19,224 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:08:19,224 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/unwind2-nondet.i [2025-04-13 21:08:19,237 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41eac8a3b/3a5d72b5061648f99a4a738c0eae95e0/FLAGf25b021c4 [2025-04-13 21:08:20,054 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41eac8a3b/3a5d72b5061648f99a4a738c0eae95e0 [2025-04-13 21:08:20,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:08:20,057 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:08:20,058 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:08:20,058 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:08:20,061 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:08:20,061 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:08:20" (1/1) ... [2025-04-13 21:08:20,062 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6364b40d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:20, skipping insertion in model container [2025-04-13 21:08:20,062 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:08:20" (1/1) ... [2025-04-13 21:08:20,083 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:08:20,317 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/unwind2-nondet.i[33026,33039] [2025-04-13 21:08:20,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:08:20,338 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:08:20,381 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/unwind2-nondet.i[33026,33039] [2025-04-13 21:08:20,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:08:20,407 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:08:20,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:20 WrapperNode [2025-04-13 21:08:20,408 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:08:20,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:08:20,409 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:08:20,409 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:08:20,413 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:08:20" (1/1) ... [2025-04-13 21:08:20,426 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:08:20" (1/1) ... [2025-04-13 21:08:20,442 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 78 [2025-04-13 21:08:20,443 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:08:20,443 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:08:20,443 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:08:20,443 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:08:20,448 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:20" (1/1) ... [2025-04-13 21:08:20,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:20" (1/1) ... [2025-04-13 21:08:20,450 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:20" (1/1) ... [2025-04-13 21:08:20,457 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:08:20,457 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:20" (1/1) ... [2025-04-13 21:08:20,457 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:20" (1/1) ... [2025-04-13 21:08:20,460 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:20" (1/1) ... [2025-04-13 21:08:20,461 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:20" (1/1) ... [2025-04-13 21:08:20,463 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:20" (1/1) ... [2025-04-13 21:08:20,464 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:20" (1/1) ... [2025-04-13 21:08:20,465 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:20" (1/1) ... [2025-04-13 21:08:20,467 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:08:20,468 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 21:08:20,468 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 21:08:20,468 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 21:08:20,468 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:20" (1/1) ... [2025-04-13 21:08:20,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:08:20,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:08:20,491 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:08:20,492 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:08:20,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:08:20,507 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-04-13 21:08:20,507 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-04-13 21:08:20,508 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-04-13 21:08:20,508 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-04-13 21:08:20,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:08:20,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:08:20,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:08:20,509 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:08:20,600 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 21:08:20,601 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:08:20,692 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:08:20,692 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:08:20,692 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 21:08:20,788 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:08:20,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 09:08:20 BoogieIcfgContainer [2025-04-13 21:08:20,789 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 21:08:20,791 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:08:20,791 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:08:20,794 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:08:20,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:08:20" (1/3) ... [2025-04-13 21:08:20,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae4ee1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:08:20, skipping insertion in model container [2025-04-13 21:08:20,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:20" (2/3) ... [2025-04-13 21:08:20,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae4ee1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:08:20, skipping insertion in model container [2025-04-13 21:08:20,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 09:08:20" (3/3) ... [2025-04-13 21:08:20,797 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind2-nondet.i [2025-04-13 21:08:20,807 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:08:20,808 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind2-nondet.i that has 3 procedures, 21 locations, 20 edges, 1 initial locations, 2 loop locations, and 2 error locations. [2025-04-13 21:08:20,808 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:08:20,834 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 21:08:20,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 22 transitions, 58 flow [2025-04-13 21:08:20,878 INFO L116 PetriNetUnfolderBase]: 2/20 cut-off events. [2025-04-13 21:08:20,879 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 21:08:20,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 20 events. 2/20 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 22 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-04-13 21:08:20,881 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 22 transitions, 58 flow [2025-04-13 21:08:20,886 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 18 transitions, 45 flow [2025-04-13 21:08:20,892 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:08:20,900 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;@4ca881b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:08:20,901 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 21:08:20,904 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 21:08:20,904 INFO L116 PetriNetUnfolderBase]: 1/10 cut-off events. [2025-04-13 21:08:20,904 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 21:08:20,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:20,904 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 21:08:20,904 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:08:20,908 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:20,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1792819012, now seen corresponding path program 1 times [2025-04-13 21:08:20,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:20,912 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199231533] [2025-04-13 21:08:20,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:20,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:20,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 21:08:20,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 21:08:20,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:20,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:21,222 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:08:21,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:21,224 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199231533] [2025-04-13 21:08:21,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199231533] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:08:21,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:08:21,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:08:21,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893656067] [2025-04-13 21:08:21,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:08:21,231 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:08:21,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:21,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:08:21,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:08:21,263 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-13 21:08:21,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 45 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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:21,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:21,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-13 21:08:21,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:21,483 INFO L116 PetriNetUnfolderBase]: 253/434 cut-off events. [2025-04-13 21:08:21,484 INFO L117 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-04-13 21:08:21,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 910 conditions, 434 events. 253/434 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1734 event pairs, 26 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 820. Up to 153 conditions per place. [2025-04-13 21:08:21,493 INFO L140 encePairwiseOnDemand]: 15/22 looper letters, 53 selfloop transitions, 8 changer transitions 0/61 dead transitions. [2025-04-13 21:08:21,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 61 transitions, 271 flow [2025-04-13 21:08:21,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:08:21,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 21:08:21,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2025-04-13 21:08:21,501 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 21:08:21,502 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 45 flow. Second operand 7 states and 77 transitions. [2025-04-13 21:08:21,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 61 transitions, 271 flow [2025-04-13 21:08:21,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 61 transitions, 257 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 21:08:21,507 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 89 flow [2025-04-13 21:08:21,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=89, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2025-04-13 21:08:21,510 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 6 predicate places. [2025-04-13 21:08:21,510 INFO L485 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 89 flow [2025-04-13 21:08:21,511 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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:21,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:21,511 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:21,511 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:08:21,511 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:08:21,511 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:21,511 INFO L85 PathProgramCache]: Analyzing trace with hash 257185659, now seen corresponding path program 1 times [2025-04-13 21:08:21,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:21,512 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129522151] [2025-04-13 21:08:21,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:21,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:21,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 21:08:21,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 21:08:21,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:21,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:21,599 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:08:21,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:21,599 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129522151] [2025-04-13 21:08:21,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129522151] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:08:21,599 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430752917] [2025-04-13 21:08:21,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:21,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:08:21,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:08:21,601 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:08:21,603 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:08:21,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 21:08:21,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 21:08:21,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:21,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:21,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 21:08:21,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:08:21,677 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:08:21,677 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 21:08:21,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430752917] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:08:21,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 21:08:21,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-04-13 21:08:21,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579388111] [2025-04-13 21:08:21,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:08:21,678 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:08:21,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:21,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:08:21,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:08:21,683 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-13 21:08:21,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 89 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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:21,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:21,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-13 21:08:21,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:21,846 INFO L116 PetriNetUnfolderBase]: 261/448 cut-off events. [2025-04-13 21:08:21,846 INFO L117 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2025-04-13 21:08:21,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1134 conditions, 448 events. 261/448 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1767 event pairs, 60 based on Foata normal form. 0/370 useless extension candidates. Maximal degree in co-relation 960. Up to 147 conditions per place. [2025-04-13 21:08:21,849 INFO L140 encePairwiseOnDemand]: 16/22 looper letters, 52 selfloop transitions, 10 changer transitions 5/67 dead transitions. [2025-04-13 21:08:21,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 67 transitions, 334 flow [2025-04-13 21:08:21,851 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:08:21,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 21:08:21,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2025-04-13 21:08:21,852 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5324675324675324 [2025-04-13 21:08:21,852 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 89 flow. Second operand 7 states and 82 transitions. [2025-04-13 21:08:21,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 67 transitions, 334 flow [2025-04-13 21:08:21,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 67 transitions, 326 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 21:08:21,854 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 139 flow [2025-04-13 21:08:21,854 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=139, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2025-04-13 21:08:21,856 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 13 predicate places. [2025-04-13 21:08:21,856 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 139 flow [2025-04-13 21:08:21,856 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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:21,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:21,857 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:21,863 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:08:22,057 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:08:22,057 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:08:22,058 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:22,058 INFO L85 PathProgramCache]: Analyzing trace with hash -661384819, now seen corresponding path program 1 times [2025-04-13 21:08:22,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:22,058 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123733649] [2025-04-13 21:08:22,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:22,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:22,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 21:08:22,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 21:08:22,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:22,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:22,144 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:08:22,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:22,145 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123733649] [2025-04-13 21:08:22,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123733649] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:08:22,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:08:22,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:08:22,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148318527] [2025-04-13 21:08:22,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:08:22,145 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:08:22,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:22,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:08:22,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:08:22,148 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-13 21:08:22,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 139 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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:08:22,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:22,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-13 21:08:22,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:22,296 INFO L116 PetriNetUnfolderBase]: 311/533 cut-off events. [2025-04-13 21:08:22,297 INFO L117 PetriNetUnfolderBase]: For 654/654 co-relation queries the response was YES. [2025-04-13 21:08:22,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1558 conditions, 533 events. 311/533 cut-off events. For 654/654 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2130 event pairs, 69 based on Foata normal form. 0/463 useless extension candidates. Maximal degree in co-relation 1115. Up to 232 conditions per place. [2025-04-13 21:08:22,300 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 52 selfloop transitions, 12 changer transitions 1/65 dead transitions. [2025-04-13 21:08:22,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 65 transitions, 451 flow [2025-04-13 21:08:22,301 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:08:22,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 21:08:22,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2025-04-13 21:08:22,302 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44805194805194803 [2025-04-13 21:08:22,302 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 139 flow. Second operand 7 states and 69 transitions. [2025-04-13 21:08:22,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 65 transitions, 451 flow [2025-04-13 21:08:22,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 65 transitions, 432 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-04-13 21:08:22,307 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 201 flow [2025-04-13 21:08:22,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=201, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2025-04-13 21:08:22,308 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 20 predicate places. [2025-04-13 21:08:22,309 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 201 flow [2025-04-13 21:08:22,309 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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:08:22,309 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:22,309 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:22,309 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 21:08:22,309 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:08:22,309 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:22,309 INFO L85 PathProgramCache]: Analyzing trace with hash 971907280, now seen corresponding path program 1 times [2025-04-13 21:08:22,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:22,309 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964640643] [2025-04-13 21:08:22,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:22,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:22,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 21:08:22,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 21:08:22,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:22,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:22,405 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:08:22,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:22,406 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964640643] [2025-04-13 21:08:22,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964640643] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:08:22,406 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102463782] [2025-04-13 21:08:22,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:22,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:08:22,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:08:22,408 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:08:22,409 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:08:22,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 21:08:22,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 21:08:22,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:22,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:22,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 21:08:22,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:08:22,506 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:08:22,506 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:08:22,611 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:08:22,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102463782] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:08:22,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:08:22,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 21:08:22,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678612688] [2025-04-13 21:08:22,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:08:22,612 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:08:22,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:22,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:08:22,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:08:22,617 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-13 21:08:22,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 201 flow. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:08:22,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:22,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-13 21:08:22,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:22,909 INFO L116 PetriNetUnfolderBase]: 411/703 cut-off events. [2025-04-13 21:08:22,909 INFO L117 PetriNetUnfolderBase]: For 921/921 co-relation queries the response was YES. [2025-04-13 21:08:22,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2543 conditions, 703 events. 411/703 cut-off events. For 921/921 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3000 event pairs, 52 based on Foata normal form. 0/598 useless extension candidates. Maximal degree in co-relation 1860. Up to 207 conditions per place. [2025-04-13 21:08:22,914 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 72 selfloop transitions, 16 changer transitions 15/103 dead transitions. [2025-04-13 21:08:22,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 103 transitions, 787 flow [2025-04-13 21:08:22,914 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:08:22,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 21:08:22,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 105 transitions. [2025-04-13 21:08:22,917 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43388429752066116 [2025-04-13 21:08:22,917 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 201 flow. Second operand 11 states and 105 transitions. [2025-04-13 21:08:22,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 103 transitions, 787 flow [2025-04-13 21:08:22,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 103 transitions, 770 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-04-13 21:08:22,926 INFO L231 Difference]: Finished difference. Result has 54 places, 36 transitions, 278 flow [2025-04-13 21:08:22,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=278, PETRI_PLACES=54, PETRI_TRANSITIONS=36} [2025-04-13 21:08:22,927 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 31 predicate places. [2025-04-13 21:08:22,927 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 36 transitions, 278 flow [2025-04-13 21:08:22,927 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:08:22,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:22,927 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:22,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 21:08:23,127 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:08:23,128 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:08:23,128 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:23,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1211495464, now seen corresponding path program 1 times [2025-04-13 21:08:23,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:23,128 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780648058] [2025-04-13 21:08:23,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:23,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:23,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 21:08:23,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 21:08:23,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:23,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:23,185 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:08:23,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:23,186 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780648058] [2025-04-13 21:08:23,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780648058] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:08:23,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:08:23,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:08:23,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411475553] [2025-04-13 21:08:23,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:08:23,186 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:08:23,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:23,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:08:23,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:08:23,192 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-13 21:08:23,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 36 transitions, 278 flow. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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:08:23,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:23,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-13 21:08:23,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:23,299 INFO L116 PetriNetUnfolderBase]: 413/707 cut-off events. [2025-04-13 21:08:23,299 INFO L117 PetriNetUnfolderBase]: For 1834/1834 co-relation queries the response was YES. [2025-04-13 21:08:23,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2983 conditions, 707 events. 413/707 cut-off events. For 1834/1834 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2974 event pairs, 80 based on Foata normal form. 28/698 useless extension candidates. Maximal degree in co-relation 2110. Up to 394 conditions per place. [2025-04-13 21:08:23,302 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 49 selfloop transitions, 12 changer transitions 1/62 dead transitions. [2025-04-13 21:08:23,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 62 transitions, 575 flow [2025-04-13 21:08:23,302 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:08:23,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 21:08:23,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2025-04-13 21:08:23,303 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2025-04-13 21:08:23,303 INFO L175 Difference]: Start difference. First operand has 54 places, 36 transitions, 278 flow. Second operand 6 states and 56 transitions. [2025-04-13 21:08:23,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 62 transitions, 575 flow [2025-04-13 21:08:23,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 62 transitions, 546 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-13 21:08:23,307 INFO L231 Difference]: Finished difference. Result has 53 places, 37 transitions, 291 flow [2025-04-13 21:08:23,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=291, PETRI_PLACES=53, PETRI_TRANSITIONS=37} [2025-04-13 21:08:23,308 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 30 predicate places. [2025-04-13 21:08:23,308 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 37 transitions, 291 flow [2025-04-13 21:08:23,308 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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:08:23,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:23,308 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:23,308 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 21:08:23,308 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:08:23,309 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:23,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1604016106, now seen corresponding path program 1 times [2025-04-13 21:08:23,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:23,309 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101417085] [2025-04-13 21:08:23,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:23,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:23,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 21:08:23,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 21:08:23,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:23,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:08:23,315 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 21:08:23,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 21:08:23,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 21:08:23,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:23,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:08:23,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 21:08:23,333 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 21:08:23,333 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-13 21:08:23,334 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2025-04-13 21:08:23,334 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-04-13 21:08:23,334 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 21:08:23,334 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 21:08:23,334 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 21:08:23,336 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 21:08:23,336 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-04-13 21:08:23,370 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 21:08:23,370 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 21:08:23,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 09:08:23 BasicIcfg [2025-04-13 21:08:23,373 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 21:08:23,374 INFO L158 Benchmark]: Toolchain (without parser) took 3316.75ms. Allocated memory is still 155.2MB. Free memory was 108.9MB in the beginning and 114.1MB in the end (delta: -5.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:08:23,374 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:08:23,374 INFO L158 Benchmark]: CACSL2BoogieTranslator took 350.10ms. Allocated memory is still 155.2MB. Free memory was 108.9MB in the beginning and 86.0MB in the end (delta: 22.9MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 21:08:23,374 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.24ms. Allocated memory is still 155.2MB. Free memory was 86.0MB in the beginning and 84.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:08:23,377 INFO L158 Benchmark]: Boogie Preprocessor took 24.00ms. Allocated memory is still 155.2MB. Free memory was 84.0MB in the beginning and 81.8MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:08:23,377 INFO L158 Benchmark]: RCFGBuilder took 321.17ms. Allocated memory is still 155.2MB. Free memory was 81.8MB in the beginning and 58.3MB in the end (delta: 23.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 21:08:23,377 INFO L158 Benchmark]: TraceAbstraction took 2582.34ms. Allocated memory is still 155.2MB. Free memory was 57.7MB in the beginning and 114.1MB in the end (delta: -56.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:08:23,378 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 350.10ms. Allocated memory is still 155.2MB. Free memory was 108.9MB in the beginning and 86.0MB in the end (delta: 22.9MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.24ms. Allocated memory is still 155.2MB. Free memory was 86.0MB in the beginning and 84.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 24.00ms. Allocated memory is still 155.2MB. Free memory was 84.0MB in the beginning and 81.8MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 321.17ms. Allocated memory is still 155.2MB. Free memory was 81.8MB in the beginning and 58.3MB in the end (delta: 23.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 2582.34ms. Allocated memory is still 155.2MB. Free memory was 57.7MB in the beginning and 114.1MB in the end (delta: -56.4MB). There was no memory consumed. 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; [L775] 0 _N = __VERIFIER_nondet_int() [L776] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L776] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L777] 0 pthread_t t1, t2; [L778] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [_N=0, limit=0, t1=-1] [L757] 1 int i, bound; [L758] 1 int lim = _N; VAL [\at(arg, Pre)={0:0}, _N=0, arg={0:0}, lim=0, limit=0] [L779] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [_N=0, limit=0, t1=-1, t2=0] [L766] 2 int i, bound; [L767] 2 int lim = _N + 1; VAL [\at(arg, Pre)={0:0}, _N=0, arg={0:0}, lim=1, limit=0] [L768] 2 limit = lim VAL [\at(arg, Pre)={0:0}, _N=0, arg={0:0}, lim=1, limit=1] [L759] 1 limit = lim VAL [\at(arg, Pre)={0:0}, _N=0, arg={0:0}, lim=0, limit=0] [L769] 2 bound = limit [L770] 2 i = 0 VAL [\at(arg, Pre)={0:0}, _N=0, arg={0:0}, bound=0, i=0, lim=1, limit=0] [L770] COND FALSE 2 !(i < bound) [L771] CALL 2 __VERIFIER_assert(i == lim) [L753] COND TRUE 2 !expression [L753] 2 reach_error() VAL [\at(expression, Pre)=0, _N=0, expression=0, limit=0] - UnprovableResult [Line: 778]: 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: 779]: 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: 753]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 35 locations, 38 edges, 6 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: 2.5s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 349 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 345 mSDsluCounter, 73 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 692 IncrementalHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 16 mSDtfsCounter, 692 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=291occurred in iteration=5, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 289 SizeOfPredicates, 3 NumberOfNonLiveVariables, 132 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 1/5 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:23,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...