/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-theta/unwind2-100.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:47:06,595 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:47:06,637 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 01:47:06,643 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:47:06,643 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:47:06,661 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:47:06,662 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:47:06,662 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:47:06,662 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:47:06,662 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:47:06,662 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:47:06,662 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:47:06,662 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:47:06,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:47:06,662 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:47:06,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:47:06,663 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:47:06,663 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:47:06,663 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:47:06,663 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:47:06,663 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:47:06,663 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:47:06,663 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:47:06,663 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:47:06,663 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:47:06,663 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:47:06,663 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:47:06,663 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:47:06,663 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:47:06,663 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:47:06,663 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:47:06,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:47:06,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:47:06,664 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:47:06,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:47:06,664 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:47:06,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:47:06,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:47:06,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:47:06,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:47:06,664 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:47:06,664 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:47:06,664 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:47:06,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:47:06,664 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:47:06,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:47:06,666 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:47:06,666 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 01:47:06,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:47:06,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:47:06,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:47:06,901 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:47:06,901 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:47:06,902 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-theta/unwind2-100.i [2025-04-14 01:47:08,140 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91a647289/a32775f11a614a8eb413703a720f7ff8/FLAGfc10321f0 [2025-04-14 01:47:08,382 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:47:08,382 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/unwind2-100.i [2025-04-14 01:47:08,391 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91a647289/a32775f11a614a8eb413703a720f7ff8/FLAGfc10321f0 [2025-04-14 01:47:09,191 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91a647289/a32775f11a614a8eb413703a720f7ff8 [2025-04-14 01:47:09,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:47:09,195 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:47:09,196 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:47:09,196 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:47:09,199 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:47:09,199 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:47:09" (1/1) ... [2025-04-14 01:47:09,200 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c30a841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:09, skipping insertion in model container [2025-04-14 01:47:09,200 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:47:09" (1/1) ... [2025-04-14 01:47:09,229 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:47:09,532 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/unwind2-100.i[33026,33039] [2025-04-14 01:47:09,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:47:09,553 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:47:09,586 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-100.i[33026,33039] [2025-04-14 01:47:09,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:47:09,614 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:47:09,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:09 WrapperNode [2025-04-14 01:47:09,615 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:47:09,615 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:47:09,615 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:47:09,615 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:47:09,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:09" (1/1) ... [2025-04-14 01:47:09,632 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:09" (1/1) ... [2025-04-14 01:47:09,648 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 75 [2025-04-14 01:47:09,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:47:09,650 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:47:09,650 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:47:09,650 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:47:09,655 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:09" (1/1) ... [2025-04-14 01:47:09,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:09" (1/1) ... [2025-04-14 01:47:09,659 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:09" (1/1) ... [2025-04-14 01:47:09,674 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-14 01:47:09,674 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:09" (1/1) ... [2025-04-14 01:47:09,675 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:09" (1/1) ... [2025-04-14 01:47:09,677 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:09" (1/1) ... [2025-04-14 01:47:09,678 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:09" (1/1) ... [2025-04-14 01:47:09,678 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:09" (1/1) ... [2025-04-14 01:47:09,679 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:09" (1/1) ... [2025-04-14 01:47:09,682 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:47:09,682 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:47:09,682 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:47:09,682 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:47:09,686 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:09" (1/1) ... [2025-04-14 01:47:09,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:47:09,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:47:09,708 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 01:47:09,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 01:47:09,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:47:09,727 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-04-14 01:47:09,727 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-04-14 01:47:09,727 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-04-14 01:47:09,728 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-04-14 01:47:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:47:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:47:09,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:47:09,728 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 01:47:09,815 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:47:09,817 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:47:09,918 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:47:09,919 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:47:09,919 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:47:10,018 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:47:10,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:47:10 BoogieIcfgContainer [2025-04-14 01:47:10,018 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:47:10,020 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:47:10,020 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:47:10,023 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:47:10,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:47:09" (1/3) ... [2025-04-14 01:47:10,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a30784b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:47:10, skipping insertion in model container [2025-04-14 01:47:10,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:09" (2/3) ... [2025-04-14 01:47:10,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a30784b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:47:10, skipping insertion in model container [2025-04-14 01:47:10,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:47:10" (3/3) ... [2025-04-14 01:47:10,025 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind2-100.i [2025-04-14 01:47:10,036 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:47:10,037 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind2-100.i that has 3 procedures, 21 locations, 20 edges, 1 initial locations, 2 loop locations, and 2 error locations. [2025-04-14 01:47:10,037 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:47:10,080 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 01:47:10,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 22 transitions, 58 flow [2025-04-14 01:47:10,127 INFO L116 PetriNetUnfolderBase]: 2/20 cut-off events. [2025-04-14 01:47:10,129 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 01:47:10,130 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 21 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-14 01:47:10,130 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 22 transitions, 58 flow [2025-04-14 01:47:10,134 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 18 transitions, 45 flow [2025-04-14 01:47:10,141 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:47:10,150 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;@39bd8121, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:47:10,150 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-14 01:47:10,156 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:47:10,156 INFO L116 PetriNetUnfolderBase]: 1/10 cut-off events. [2025-04-14 01:47:10,156 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 01:47:10,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:10,156 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-14 01:47:10,157 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:47:10,162 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:10,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1446625350, now seen corresponding path program 1 times [2025-04-14 01:47:10,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:10,168 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192668313] [2025-04-14 01:47:10,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:10,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:10,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-14 01:47:10,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-14 01:47:10,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:10,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:10,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:10,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:10,384 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192668313] [2025-04-14 01:47:10,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192668313] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:47:10,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:47:10,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:47:10,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840037709] [2025-04-14 01:47:10,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:47:10,390 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:47:10,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:10,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:47:10,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:47:10,409 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-14 01:47:10,410 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-14 01:47:10,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:10,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-14 01:47:10,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:10,604 INFO L116 PetriNetUnfolderBase]: 211/360 cut-off events. [2025-04-14 01:47:10,604 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-14 01:47:10,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 360 events. 211/360 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1351 event pairs, 26 based on Foata normal form. 0/264 useless extension candidates. Maximal degree in co-relation 690. Up to 153 conditions per place. [2025-04-14 01:47:10,611 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 49 selfloop transitions, 8 changer transitions 0/57 dead transitions. [2025-04-14 01:47:10,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 57 transitions, 249 flow [2025-04-14 01:47:10,612 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:47:10,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:47:10,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2025-04-14 01:47:10,620 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.487012987012987 [2025-04-14 01:47:10,621 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 45 flow. Second operand 7 states and 75 transitions. [2025-04-14 01:47:10,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 57 transitions, 249 flow [2025-04-14 01:47:10,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 57 transitions, 239 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 01:47:10,626 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 93 flow [2025-04-14 01:47:10,627 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=93, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2025-04-14 01:47:10,629 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 6 predicate places. [2025-04-14 01:47:10,629 INFO L485 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 93 flow [2025-04-14 01:47:10,629 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-14 01:47:10,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:10,630 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:10,630 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:47:10,630 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:47:10,630 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:10,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1895713045, now seen corresponding path program 1 times [2025-04-14 01:47:10,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:10,630 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817729145] [2025-04-14 01:47:10,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:10,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:10,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-14 01:47:10,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-14 01:47:10,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:10,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:10,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:10,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:10,753 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817729145] [2025-04-14 01:47:10,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817729145] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:47:10,753 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352141572] [2025-04-14 01:47:10,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:10,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:47:10,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:47:10,755 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:47:10,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-14 01:47:10,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-14 01:47:10,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-14 01:47:10,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:10,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:10,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 01:47:10,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:47:10,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:10,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:47:10,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:10,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352141572] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:47:10,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:47:10,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-04-14 01:47:10,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757621917] [2025-04-14 01:47:10,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:47:10,903 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-14 01:47:10,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:10,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-14 01:47:10,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-14 01:47:10,904 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-14 01:47:10,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 93 flow. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:10,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:10,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-14 01:47:10,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:11,286 INFO L116 PetriNetUnfolderBase]: 307/522 cut-off events. [2025-04-14 01:47:11,286 INFO L117 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2025-04-14 01:47:11,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1486 conditions, 522 events. 307/522 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1992 event pairs, 26 based on Foata normal form. 0/402 useless extension candidates. Maximal degree in co-relation 1338. Up to 153 conditions per place. [2025-04-14 01:47:11,291 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 88 selfloop transitions, 17 changer transitions 0/105 dead transitions. [2025-04-14 01:47:11,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 105 transitions, 529 flow [2025-04-14 01:47:11,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 01:47:11,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 01:47:11,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 143 transitions. [2025-04-14 01:47:11,295 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-14 01:47:11,295 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 93 flow. Second operand 13 states and 143 transitions. [2025-04-14 01:47:11,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 105 transitions, 529 flow [2025-04-14 01:47:11,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 105 transitions, 515 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-04-14 01:47:11,303 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 216 flow [2025-04-14 01:47:11,303 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=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=216, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2025-04-14 01:47:11,304 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 21 predicate places. [2025-04-14 01:47:11,304 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 216 flow [2025-04-14 01:47:11,304 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:11,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:11,304 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:11,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-14 01:47:11,509 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-14 01:47:11,509 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:47:11,509 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:11,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1379861324, now seen corresponding path program 1 times [2025-04-14 01:47:11,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:11,510 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845169331] [2025-04-14 01:47:11,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:11,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:11,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-14 01:47:11,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-14 01:47:11,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:11,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:11,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:11,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:11,573 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845169331] [2025-04-14 01:47:11,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845169331] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:47:11,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:47:11,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:47:11,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775972844] [2025-04-14 01:47:11,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:47:11,573 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:47:11,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:11,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:47:11,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:47:11,574 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-14 01:47:11,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 216 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-14 01:47:11,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:11,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-14 01:47:11,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:11,715 INFO L116 PetriNetUnfolderBase]: 363/616 cut-off events. [2025-04-14 01:47:11,716 INFO L117 PetriNetUnfolderBase]: For 1240/1240 co-relation queries the response was YES. [2025-04-14 01:47:11,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2270 conditions, 616 events. 363/616 cut-off events. For 1240/1240 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2394 event pairs, 93 based on Foata normal form. 0/514 useless extension candidates. Maximal degree in co-relation 1986. Up to 245 conditions per place. [2025-04-14 01:47:11,720 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 66 selfloop transitions, 13 changer transitions 0/79 dead transitions. [2025-04-14 01:47:11,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 79 transitions, 730 flow [2025-04-14 01:47:11,720 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:47:11,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:47:11,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2025-04-14 01:47:11,721 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4675324675324675 [2025-04-14 01:47:11,721 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 216 flow. Second operand 7 states and 72 transitions. [2025-04-14 01:47:11,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 79 transitions, 730 flow [2025-04-14 01:47:11,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 79 transitions, 610 flow, removed 45 selfloop flow, removed 5 redundant places. [2025-04-14 01:47:11,730 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 239 flow [2025-04-14 01:47:11,730 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=239, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2025-04-14 01:47:11,730 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 25 predicate places. [2025-04-14 01:47:11,731 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 239 flow [2025-04-14 01:47:11,731 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-14 01:47:11,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:11,731 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:11,731 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 01:47:11,731 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:47:11,731 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:11,731 INFO L85 PathProgramCache]: Analyzing trace with hash 173972077, now seen corresponding path program 1 times [2025-04-14 01:47:11,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:11,731 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777299715] [2025-04-14 01:47:11,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:11,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:11,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-14 01:47:11,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-14 01:47:11,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:11,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:11,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:11,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:11,814 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777299715] [2025-04-14 01:47:11,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777299715] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:47:11,814 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336734377] [2025-04-14 01:47:11,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:11,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:47:11,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:47:11,816 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:47:11,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 01:47:11,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-14 01:47:11,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-14 01:47:11,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:11,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:11,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 01:47:11,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:47:11,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:11,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:47:11,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:11,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336734377] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:47:11,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:47:11,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-04-14 01:47:11,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091949710] [2025-04-14 01:47:11,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:47:11,973 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-14 01:47:11,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:11,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-14 01:47:11,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-14 01:47:11,974 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-14 01:47:11,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 239 flow. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:11,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:11,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-14 01:47:11,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:12,265 INFO L116 PetriNetUnfolderBase]: 531/898 cut-off events. [2025-04-14 01:47:12,266 INFO L117 PetriNetUnfolderBase]: For 1914/1914 co-relation queries the response was YES. [2025-04-14 01:47:12,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3536 conditions, 898 events. 531/898 cut-off events. For 1914/1914 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3825 event pairs, 93 based on Foata normal form. 0/784 useless extension candidates. Maximal degree in co-relation 3197. Up to 258 conditions per place. [2025-04-14 01:47:12,272 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 129 selfloop transitions, 22 changer transitions 0/151 dead transitions. [2025-04-14 01:47:12,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 151 transitions, 1314 flow [2025-04-14 01:47:12,272 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 01:47:12,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 01:47:12,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 140 transitions. [2025-04-14 01:47:12,273 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48951048951048953 [2025-04-14 01:47:12,273 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 239 flow. Second operand 13 states and 140 transitions. [2025-04-14 01:47:12,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 151 transitions, 1314 flow [2025-04-14 01:47:12,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 151 transitions, 1295 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-04-14 01:47:12,280 INFO L231 Difference]: Finished difference. Result has 63 places, 48 transitions, 376 flow [2025-04-14 01:47:12,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=376, PETRI_PLACES=63, PETRI_TRANSITIONS=48} [2025-04-14 01:47:12,281 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 40 predicate places. [2025-04-14 01:47:12,281 INFO L485 AbstractCegarLoop]: Abstraction has has 63 places, 48 transitions, 376 flow [2025-04-14 01:47:12,281 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:12,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:12,281 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:12,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-14 01:47:12,482 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-14 01:47:12,482 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:47:12,482 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:12,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1654644805, now seen corresponding path program 1 times [2025-04-14 01:47:12,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:12,483 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491993948] [2025-04-14 01:47:12,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:12,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:12,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-14 01:47:12,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-14 01:47:12,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:12,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:12,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:12,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:12,532 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491993948] [2025-04-14 01:47:12,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491993948] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:47:12,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:47:12,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:47:12,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318844114] [2025-04-14 01:47:12,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:47:12,532 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:47:12,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:12,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:47:12,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:47:12,533 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-14 01:47:12,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 48 transitions, 376 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-14 01:47:12,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:12,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-14 01:47:12,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:12,683 INFO L116 PetriNetUnfolderBase]: 555/938 cut-off events. [2025-04-14 01:47:12,683 INFO L117 PetriNetUnfolderBase]: For 3869/3869 co-relation queries the response was YES. [2025-04-14 01:47:12,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4497 conditions, 938 events. 555/938 cut-off events. For 3869/3869 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4037 event pairs, 121 based on Foata normal form. 16/876 useless extension candidates. Maximal degree in co-relation 4110. Up to 421 conditions per place. [2025-04-14 01:47:12,688 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 62 selfloop transitions, 15 changer transitions 0/77 dead transitions. [2025-04-14 01:47:12,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 77 transitions, 791 flow [2025-04-14 01:47:12,689 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:47:12,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:47:12,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2025-04-14 01:47:12,689 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2025-04-14 01:47:12,689 INFO L175 Difference]: Start difference. First operand has 63 places, 48 transitions, 376 flow. Second operand 6 states and 58 transitions. [2025-04-14 01:47:12,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 77 transitions, 791 flow [2025-04-14 01:47:12,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 77 transitions, 713 flow, removed 27 selfloop flow, removed 5 redundant places. [2025-04-14 01:47:12,700 INFO L231 Difference]: Finished difference. Result has 64 places, 49 transitions, 366 flow [2025-04-14 01:47:12,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=366, PETRI_PLACES=64, PETRI_TRANSITIONS=49} [2025-04-14 01:47:12,700 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 41 predicate places. [2025-04-14 01:47:12,701 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 49 transitions, 366 flow [2025-04-14 01:47:12,701 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-14 01:47:12,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:12,701 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:12,701 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 01:47:12,701 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:47:12,701 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:12,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1650002983, now seen corresponding path program 1 times [2025-04-14 01:47:12,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:12,701 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446385264] [2025-04-14 01:47:12,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:12,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:12,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-14 01:47:12,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-14 01:47:12,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:12,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:12,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:12,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:12,769 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446385264] [2025-04-14 01:47:12,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446385264] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:47:12,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:47:12,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:47:12,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512774265] [2025-04-14 01:47:12,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:47:12,770 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:47:12,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:12,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:47:12,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:47:12,770 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-14 01:47:12,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 49 transitions, 366 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-14 01:47:12,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:12,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-14 01:47:12,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:12,918 INFO L116 PetriNetUnfolderBase]: 580/980 cut-off events. [2025-04-14 01:47:12,918 INFO L117 PetriNetUnfolderBase]: For 4144/4144 co-relation queries the response was YES. [2025-04-14 01:47:12,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4456 conditions, 980 events. 580/980 cut-off events. For 4144/4144 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4278 event pairs, 117 based on Foata normal form. 17/917 useless extension candidates. Maximal degree in co-relation 4266. Up to 457 conditions per place. [2025-04-14 01:47:12,938 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 67 selfloop transitions, 15 changer transitions 0/82 dead transitions. [2025-04-14 01:47:12,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 82 transitions, 795 flow [2025-04-14 01:47:12,938 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:47:12,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:47:12,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2025-04-14 01:47:12,939 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2025-04-14 01:47:12,940 INFO L175 Difference]: Start difference. First operand has 64 places, 49 transitions, 366 flow. Second operand 6 states and 62 transitions. [2025-04-14 01:47:12,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 82 transitions, 795 flow [2025-04-14 01:47:12,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 82 transitions, 765 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-04-14 01:47:12,949 INFO L231 Difference]: Finished difference. Result has 67 places, 50 transitions, 387 flow [2025-04-14 01:47:12,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=387, PETRI_PLACES=67, PETRI_TRANSITIONS=50} [2025-04-14 01:47:12,950 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 44 predicate places. [2025-04-14 01:47:12,950 INFO L485 AbstractCegarLoop]: Abstraction has has 67 places, 50 transitions, 387 flow [2025-04-14 01:47:12,951 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-14 01:47:12,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:12,951 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:12,951 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 01:47:12,951 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:47:12,951 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:12,951 INFO L85 PathProgramCache]: Analyzing trace with hash 662502406, now seen corresponding path program 2 times [2025-04-14 01:47:12,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:12,952 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948699298] [2025-04-14 01:47:12,952 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:47:12,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:12,956 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-04-14 01:47:12,961 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-04-14 01:47:12,961 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:47:12,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:13,062 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:13,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:13,064 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948699298] [2025-04-14 01:47:13,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948699298] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:47:13,064 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081559471] [2025-04-14 01:47:13,064 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:47:13,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:47:13,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:47:13,066 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:47:13,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 01:47:13,100 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-04-14 01:47:13,106 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-04-14 01:47:13,106 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:47:13,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:13,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 01:47:13,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:47:13,177 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:13,177 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:47:13,260 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:13,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081559471] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:47:13,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:47:13,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-04-14 01:47:13,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557781677] [2025-04-14 01:47:13,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:47:13,261 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-14 01:47:13,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:13,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-14 01:47:13,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2025-04-14 01:47:13,262 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-14 01:47:13,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 50 transitions, 387 flow. Second operand has 23 states, 23 states have (on average 3.130434782608696) internal successors, (72), 23 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:13,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:13,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-14 01:47:13,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:13,887 INFO L116 PetriNetUnfolderBase]: 934/1574 cut-off events. [2025-04-14 01:47:13,887 INFO L117 PetriNetUnfolderBase]: For 14133/14133 co-relation queries the response was YES. [2025-04-14 01:47:13,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7357 conditions, 1574 events. 934/1574 cut-off events. For 14133/14133 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 7140 event pairs, 100 based on Foata normal form. 240/1710 useless extension candidates. Maximal degree in co-relation 7066. Up to 391 conditions per place. [2025-04-14 01:47:13,898 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 270 selfloop transitions, 40 changer transitions 0/310 dead transitions. [2025-04-14 01:47:13,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 310 transitions, 3026 flow [2025-04-14 01:47:13,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-14 01:47:13,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-14 01:47:13,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 275 transitions. [2025-04-14 01:47:13,899 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-14 01:47:13,899 INFO L175 Difference]: Start difference. First operand has 67 places, 50 transitions, 387 flow. Second operand 25 states and 275 transitions. [2025-04-14 01:47:13,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 310 transitions, 3026 flow [2025-04-14 01:47:13,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 310 transitions, 2895 flow, removed 55 selfloop flow, removed 3 redundant places. [2025-04-14 01:47:13,923 INFO L231 Difference]: Finished difference. Result has 100 places, 68 transitions, 698 flow [2025-04-14 01:47:13,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=698, PETRI_PLACES=100, PETRI_TRANSITIONS=68} [2025-04-14 01:47:13,924 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 77 predicate places. [2025-04-14 01:47:13,924 INFO L485 AbstractCegarLoop]: Abstraction has has 100 places, 68 transitions, 698 flow [2025-04-14 01:47:13,924 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.130434782608696) internal successors, (72), 23 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:13,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:13,924 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:13,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-14 01:47:14,125 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:47:14,125 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:47:14,125 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:14,125 INFO L85 PathProgramCache]: Analyzing trace with hash -523488600, now seen corresponding path program 1 times [2025-04-14 01:47:14,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:14,126 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737222587] [2025-04-14 01:47:14,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:14,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:14,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-14 01:47:14,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-14 01:47:14,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:14,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:14,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:14,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:14,201 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737222587] [2025-04-14 01:47:14,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737222587] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:47:14,202 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157035941] [2025-04-14 01:47:14,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:14,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:47:14,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:47:14,203 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:47:14,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 01:47:14,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-14 01:47:14,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-14 01:47:14,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:14,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:14,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 01:47:14,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:47:14,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:14,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:47:14,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:14,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157035941] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:47:14,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:47:14,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-04-14 01:47:14,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943530722] [2025-04-14 01:47:14,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:47:14,317 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-14 01:47:14,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:14,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-14 01:47:14,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-14 01:47:14,317 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-14 01:47:14,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 68 transitions, 698 flow. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:14,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:14,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-14 01:47:14,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:14,588 INFO L116 PetriNetUnfolderBase]: 1006/1694 cut-off events. [2025-04-14 01:47:14,588 INFO L117 PetriNetUnfolderBase]: For 22234/22234 co-relation queries the response was YES. [2025-04-14 01:47:14,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9564 conditions, 1694 events. 1006/1694 cut-off events. For 22234/22234 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 7902 event pairs, 202 based on Foata normal form. 48/1632 useless extension candidates. Maximal degree in co-relation 8971. Up to 746 conditions per place. [2025-04-14 01:47:14,597 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 108 selfloop transitions, 24 changer transitions 0/132 dead transitions. [2025-04-14 01:47:14,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 132 transitions, 1648 flow [2025-04-14 01:47:14,599 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:47:14,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:47:14,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 86 transitions. [2025-04-14 01:47:14,600 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43434343434343436 [2025-04-14 01:47:14,600 INFO L175 Difference]: Start difference. First operand has 100 places, 68 transitions, 698 flow. Second operand 9 states and 86 transitions. [2025-04-14 01:47:14,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 132 transitions, 1648 flow [2025-04-14 01:47:14,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 132 transitions, 1408 flow, removed 84 selfloop flow, removed 12 redundant places. [2025-04-14 01:47:14,659 INFO L231 Difference]: Finished difference. Result has 99 places, 71 transitions, 628 flow [2025-04-14 01:47:14,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=628, PETRI_PLACES=99, PETRI_TRANSITIONS=71} [2025-04-14 01:47:14,659 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 76 predicate places. [2025-04-14 01:47:14,660 INFO L485 AbstractCegarLoop]: Abstraction has has 99 places, 71 transitions, 628 flow [2025-04-14 01:47:14,660 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:14,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:14,660 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:14,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-14 01:47:14,863 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:47:14,864 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:47:14,864 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:14,864 INFO L85 PathProgramCache]: Analyzing trace with hash 389515240, now seen corresponding path program 1 times [2025-04-14 01:47:14,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:14,864 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496760681] [2025-04-14 01:47:14,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:14,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:14,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-14 01:47:14,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-14 01:47:14,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:14,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:14,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:14,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:14,919 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496760681] [2025-04-14 01:47:14,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496760681] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:47:14,919 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288775354] [2025-04-14 01:47:14,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:14,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:47:14,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:47:14,921 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:47:14,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-14 01:47:14,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-14 01:47:14,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-14 01:47:14,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:14,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:14,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 01:47:14,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:47:14,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:14,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:47:15,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:15,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288775354] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:47:15,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:47:15,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-04-14 01:47:15,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698773658] [2025-04-14 01:47:15,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:47:15,025 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-14 01:47:15,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:15,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-14 01:47:15,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-14 01:47:15,026 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-14 01:47:15,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 71 transitions, 628 flow. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:15,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:15,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-14 01:47:15,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:15,383 INFO L116 PetriNetUnfolderBase]: 1135/1910 cut-off events. [2025-04-14 01:47:15,383 INFO L117 PetriNetUnfolderBase]: For 19321/19321 co-relation queries the response was YES. [2025-04-14 01:47:15,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9790 conditions, 1910 events. 1135/1910 cut-off events. For 19321/19321 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 9070 event pairs, 114 based on Foata normal form. 87/1881 useless extension candidates. Maximal degree in co-relation 9450. Up to 819 conditions per place. [2025-04-14 01:47:15,399 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 136 selfloop transitions, 24 changer transitions 0/160 dead transitions. [2025-04-14 01:47:15,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 160 transitions, 1865 flow [2025-04-14 01:47:15,400 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:47:15,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:47:15,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2025-04-14 01:47:15,400 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2025-04-14 01:47:15,400 INFO L175 Difference]: Start difference. First operand has 99 places, 71 transitions, 628 flow. Second operand 9 states and 93 transitions. [2025-04-14 01:47:15,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 160 transitions, 1865 flow [2025-04-14 01:47:15,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 160 transitions, 1787 flow, removed 15 selfloop flow, removed 5 redundant places. [2025-04-14 01:47:15,460 INFO L231 Difference]: Finished difference. Result has 105 places, 74 transitions, 654 flow [2025-04-14 01:47:15,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=654, PETRI_PLACES=105, PETRI_TRANSITIONS=74} [2025-04-14 01:47:15,461 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 82 predicate places. [2025-04-14 01:47:15,461 INFO L485 AbstractCegarLoop]: Abstraction has has 105 places, 74 transitions, 654 flow [2025-04-14 01:47:15,461 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:15,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:15,461 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:15,467 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-14 01:47:15,661 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:47:15,661 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:47:15,662 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:15,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1223220492, now seen corresponding path program 2 times [2025-04-14 01:47:15,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:15,662 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359331494] [2025-04-14 01:47:15,662 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:47:15,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:15,666 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-04-14 01:47:15,670 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-04-14 01:47:15,670 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:47:15,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:15,752 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:15,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:15,753 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359331494] [2025-04-14 01:47:15,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359331494] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:47:15,754 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139398502] [2025-04-14 01:47:15,754 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:47:15,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:47:15,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:47:15,755 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:47:15,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-14 01:47:15,795 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-04-14 01:47:15,803 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-04-14 01:47:15,803 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:47:15,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:15,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 01:47:15,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:47:15,871 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:15,871 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:47:15,961 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:15,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139398502] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:47:15,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:47:15,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-04-14 01:47:15,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065161623] [2025-04-14 01:47:15,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:47:15,962 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-14 01:47:15,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:15,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-14 01:47:15,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2025-04-14 01:47:15,963 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-14 01:47:15,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 74 transitions, 654 flow. Second operand has 23 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:15,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:15,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-14 01:47:15,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:16,723 INFO L116 PetriNetUnfolderBase]: 1759/2954 cut-off events. [2025-04-14 01:47:16,723 INFO L117 PetriNetUnfolderBase]: For 55614/55614 co-relation queries the response was YES. [2025-04-14 01:47:16,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15545 conditions, 2954 events. 1759/2954 cut-off events. For 55614/55614 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 14830 event pairs, 279 based on Foata normal form. 420/3234 useless extension candidates. Maximal degree in co-relation 14862. Up to 767 conditions per place. [2025-04-14 01:47:16,749 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 441 selfloop transitions, 46 changer transitions 0/487 dead transitions. [2025-04-14 01:47:16,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 487 transitions, 5558 flow [2025-04-14 01:47:16,750 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-14 01:47:16,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-14 01:47:16,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 272 transitions. [2025-04-14 01:47:16,751 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49454545454545457 [2025-04-14 01:47:16,751 INFO L175 Difference]: Start difference. First operand has 105 places, 74 transitions, 654 flow. Second operand 25 states and 272 transitions. [2025-04-14 01:47:16,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 487 transitions, 5558 flow [2025-04-14 01:47:16,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 487 transitions, 5448 flow, removed 15 selfloop flow, removed 5 redundant places. [2025-04-14 01:47:16,848 INFO L231 Difference]: Finished difference. Result has 136 places, 92 transitions, 942 flow [2025-04-14 01:47:16,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=942, PETRI_PLACES=136, PETRI_TRANSITIONS=92} [2025-04-14 01:47:16,850 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 113 predicate places. [2025-04-14 01:47:16,850 INFO L485 AbstractCegarLoop]: Abstraction has has 136 places, 92 transitions, 942 flow [2025-04-14 01:47:16,850 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:16,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:16,850 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:16,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-14 01:47:17,050 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:47:17,050 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:47:17,051 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:17,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1395877637, now seen corresponding path program 2 times [2025-04-14 01:47:17,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:17,051 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589938932] [2025-04-14 01:47:17,051 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:47:17,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:17,056 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-14 01:47:17,061 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 01:47:17,061 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:47:17,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:17,147 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:17,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:17,147 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589938932] [2025-04-14 01:47:17,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589938932] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:47:17,147 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502422534] [2025-04-14 01:47:17,147 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:47:17,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:47:17,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:47:17,149 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:47:17,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-14 01:47:17,179 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-14 01:47:17,187 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 01:47:17,187 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:47:17,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:17,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 01:47:17,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:47:17,249 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:17,249 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:47:17,328 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:17,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502422534] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:47:17,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:47:17,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-04-14 01:47:17,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678109265] [2025-04-14 01:47:17,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:47:17,329 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-14 01:47:17,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:17,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-14 01:47:17,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2025-04-14 01:47:17,332 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-14 01:47:17,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 92 transitions, 942 flow. Second operand has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:17,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:17,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-14 01:47:17,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:17,879 INFO L116 PetriNetUnfolderBase]: 2011/3374 cut-off events. [2025-04-14 01:47:17,879 INFO L117 PetriNetUnfolderBase]: For 88256/88256 co-relation queries the response was YES. [2025-04-14 01:47:17,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20780 conditions, 3374 events. 2011/3374 cut-off events. For 88256/88256 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 17548 event pairs, 234 based on Foata normal form. 168/3390 useless extension candidates. Maximal degree in co-relation 20033. Up to 1406 conditions per place. [2025-04-14 01:47:17,899 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 237 selfloop transitions, 36 changer transitions 0/273 dead transitions. [2025-04-14 01:47:17,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 273 transitions, 4100 flow [2025-04-14 01:47:17,900 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 01:47:17,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 01:47:17,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 140 transitions. [2025-04-14 01:47:17,900 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2025-04-14 01:47:17,900 INFO L175 Difference]: Start difference. First operand has 136 places, 92 transitions, 942 flow. Second operand 15 states and 140 transitions. [2025-04-14 01:47:17,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 273 transitions, 4100 flow [2025-04-14 01:47:18,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 273 transitions, 3308 flow, removed 312 selfloop flow, removed 12 redundant places. [2025-04-14 01:47:18,057 INFO L231 Difference]: Finished difference. Result has 144 places, 98 transitions, 932 flow [2025-04-14 01:47:18,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=932, PETRI_PLACES=144, PETRI_TRANSITIONS=98} [2025-04-14 01:47:18,058 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 121 predicate places. [2025-04-14 01:47:18,058 INFO L485 AbstractCegarLoop]: Abstraction has has 144 places, 98 transitions, 932 flow [2025-04-14 01:47:18,058 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:18,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:18,058 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:18,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-14 01:47:18,262 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:47:18,262 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:47:18,262 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:18,262 INFO L85 PathProgramCache]: Analyzing trace with hash -952959079, now seen corresponding path program 2 times [2025-04-14 01:47:18,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:18,262 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733645199] [2025-04-14 01:47:18,262 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:47:18,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:18,266 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-14 01:47:18,269 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 01:47:18,269 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:47:18,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:18,347 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:18,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:18,347 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733645199] [2025-04-14 01:47:18,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733645199] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:47:18,347 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770827582] [2025-04-14 01:47:18,347 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:47:18,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:47:18,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:47:18,349 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:47:18,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-14 01:47:18,380 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-14 01:47:18,389 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 01:47:18,389 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:47:18,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:18,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 01:47:18,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:47:18,448 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:18,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:47:18,529 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:18,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770827582] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:47:18,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:47:18,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-04-14 01:47:18,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303509646] [2025-04-14 01:47:18,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:47:18,530 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-14 01:47:18,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:18,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-14 01:47:18,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2025-04-14 01:47:18,531 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-14 01:47:18,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 98 transitions, 932 flow. Second operand has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:18,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:18,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-14 01:47:18,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:19,106 INFO L116 PetriNetUnfolderBase]: 2269/3806 cut-off events. [2025-04-14 01:47:19,106 INFO L117 PetriNetUnfolderBase]: For 104823/104823 co-relation queries the response was YES. [2025-04-14 01:47:19,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21985 conditions, 3806 events. 2269/3806 cut-off events. For 104823/104823 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 20170 event pairs, 275 based on Foata normal form. 174/3816 useless extension candidates. Maximal degree in co-relation 21600. Up to 1821 conditions per place. [2025-04-14 01:47:19,133 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 256 selfloop transitions, 36 changer transitions 0/292 dead transitions. [2025-04-14 01:47:19,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 292 transitions, 3837 flow [2025-04-14 01:47:19,137 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 01:47:19,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 01:47:19,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 153 transitions. [2025-04-14 01:47:19,137 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4636363636363636 [2025-04-14 01:47:19,138 INFO L175 Difference]: Start difference. First operand has 144 places, 98 transitions, 932 flow. Second operand 15 states and 153 transitions. [2025-04-14 01:47:19,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 292 transitions, 3837 flow [2025-04-14 01:47:19,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 292 transitions, 3697 flow, removed 37 selfloop flow, removed 8 redundant places. [2025-04-14 01:47:19,328 INFO L231 Difference]: Finished difference. Result has 156 places, 104 transitions, 980 flow [2025-04-14 01:47:19,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=980, PETRI_PLACES=156, PETRI_TRANSITIONS=104} [2025-04-14 01:47:19,329 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 133 predicate places. [2025-04-14 01:47:19,329 INFO L485 AbstractCegarLoop]: Abstraction has has 156 places, 104 transitions, 980 flow [2025-04-14 01:47:19,329 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:19,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:19,330 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:19,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-14 01:47:19,534 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-14 01:47:19,534 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:47:19,534 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:19,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1954180698, now seen corresponding path program 3 times [2025-04-14 01:47:19,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:19,535 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534274103] [2025-04-14 01:47:19,535 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:47:19,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:19,539 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 6 equivalence classes. [2025-04-14 01:47:19,543 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 8 of 16 statements. [2025-04-14 01:47:19,543 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:47:19,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:19,603 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 01:47:19,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:19,604 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534274103] [2025-04-14 01:47:19,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534274103] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:47:19,604 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002516023] [2025-04-14 01:47:19,604 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:47:19,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:47:19,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:47:19,606 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:47:19,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-14 01:47:19,641 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 6 equivalence classes. [2025-04-14 01:47:19,647 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 8 of 16 statements. [2025-04-14 01:47:19,647 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:47:19,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:19,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 01:47:19,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:47:19,665 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 01:47:19,665 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 01:47:19,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002516023] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:47:19,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 01:47:19,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-04-14 01:47:19,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803991256] [2025-04-14 01:47:19,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:47:19,666 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:47:19,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:19,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:47:19,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:47:19,666 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-14 01:47:19,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 104 transitions, 980 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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-14 01:47:19,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:19,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-14 01:47:19,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:20,113 INFO L116 PetriNetUnfolderBase]: 2287/3840 cut-off events. [2025-04-14 01:47:20,113 INFO L117 PetriNetUnfolderBase]: For 94778/94778 co-relation queries the response was YES. [2025-04-14 01:47:20,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21857 conditions, 3840 events. 2287/3840 cut-off events. For 94778/94778 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 20340 event pairs, 610 based on Foata normal form. 0/3727 useless extension candidates. Maximal degree in co-relation 21148. Up to 1557 conditions per place. [2025-04-14 01:47:20,140 INFO L140 encePairwiseOnDemand]: 17/22 looper letters, 170 selfloop transitions, 27 changer transitions 5/202 dead transitions. [2025-04-14 01:47:20,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 202 transitions, 2661 flow [2025-04-14 01:47:20,143 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:47:20,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:47:20,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2025-04-14 01:47:20,144 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5194805194805194 [2025-04-14 01:47:20,144 INFO L175 Difference]: Start difference. First operand has 156 places, 104 transitions, 980 flow. Second operand 7 states and 80 transitions. [2025-04-14 01:47:20,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 202 transitions, 2661 flow [2025-04-14 01:47:20,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 202 transitions, 2357 flow, removed 111 selfloop flow, removed 8 redundant places. [2025-04-14 01:47:20,309 INFO L231 Difference]: Finished difference. Result has 156 places, 105 transitions, 936 flow [2025-04-14 01:47:20,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=936, PETRI_PLACES=156, PETRI_TRANSITIONS=105} [2025-04-14 01:47:20,309 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 133 predicate places. [2025-04-14 01:47:20,310 INFO L485 AbstractCegarLoop]: Abstraction has has 156 places, 105 transitions, 936 flow [2025-04-14 01:47:20,310 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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-14 01:47:20,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:20,310 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:20,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-14 01:47:20,510 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-14 01:47:20,510 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:47:20,511 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:20,511 INFO L85 PathProgramCache]: Analyzing trace with hash -452280236, now seen corresponding path program 3 times [2025-04-14 01:47:20,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:20,511 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621970990] [2025-04-14 01:47:20,511 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:47:20,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:20,516 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 6 equivalence classes. [2025-04-14 01:47:20,522 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 10 of 18 statements. [2025-04-14 01:47:20,522 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:47:20,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:20,575 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 01:47:20,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:20,575 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621970990] [2025-04-14 01:47:20,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621970990] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:47:20,575 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676532143] [2025-04-14 01:47:20,575 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:47:20,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:47:20,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:47:20,578 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:47:20,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-14 01:47:20,609 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 6 equivalence classes. [2025-04-14 01:47:20,616 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 10 of 18 statements. [2025-04-14 01:47:20,616 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:47:20,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:20,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 01:47:20,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:47:20,635 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 01:47:20,635 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 01:47:20,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676532143] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:47:20,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 01:47:20,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-04-14 01:47:20,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126635688] [2025-04-14 01:47:20,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:47:20,636 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:47:20,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:20,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:47:20,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:47:20,636 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-14 01:47:20,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 105 transitions, 936 flow. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:20,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:20,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-14 01:47:20,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:20,992 INFO L116 PetriNetUnfolderBase]: 2281/3830 cut-off events. [2025-04-14 01:47:20,992 INFO L117 PetriNetUnfolderBase]: For 117452/117452 co-relation queries the response was YES. [2025-04-14 01:47:21,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20018 conditions, 3830 events. 2281/3830 cut-off events. For 117452/117452 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 20272 event pairs, 593 based on Foata normal form. 0/3803 useless extension candidates. Maximal degree in co-relation 19410. Up to 1620 conditions per place. [2025-04-14 01:47:21,018 INFO L140 encePairwiseOnDemand]: 17/22 looper letters, 89 selfloop transitions, 5 changer transitions 103/197 dead transitions. [2025-04-14 01:47:21,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 197 transitions, 2268 flow [2025-04-14 01:47:21,018 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:47:21,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:47:21,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2025-04-14 01:47:21,019 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4805194805194805 [2025-04-14 01:47:21,019 INFO L175 Difference]: Start difference. First operand has 156 places, 105 transitions, 936 flow. Second operand 7 states and 74 transitions. [2025-04-14 01:47:21,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 197 transitions, 2268 flow [2025-04-14 01:47:21,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 197 transitions, 2243 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 01:47:21,200 INFO L231 Difference]: Finished difference. Result has 161 places, 64 transitions, 555 flow [2025-04-14 01:47:21,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=918, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=555, PETRI_PLACES=161, PETRI_TRANSITIONS=64} [2025-04-14 01:47:21,201 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 138 predicate places. [2025-04-14 01:47:21,201 INFO L485 AbstractCegarLoop]: Abstraction has has 161 places, 64 transitions, 555 flow [2025-04-14 01:47:21,201 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:21,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:21,201 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:21,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-14 01:47:21,405 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-14 01:47:21,405 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:47:21,405 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:21,405 INFO L85 PathProgramCache]: Analyzing trace with hash -2046369061, now seen corresponding path program 3 times [2025-04-14 01:47:21,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:21,406 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062431791] [2025-04-14 01:47:21,406 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:47:21,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:21,409 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 6 equivalence classes. [2025-04-14 01:47:21,412 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:47:21,413 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-14 01:47:21,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:21,576 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:21,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:21,577 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062431791] [2025-04-14 01:47:21,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062431791] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:47:21,577 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919191124] [2025-04-14 01:47:21,577 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:47:21,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:47:21,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:47:21,579 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:47:21,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-14 01:47:21,612 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 6 equivalence classes. [2025-04-14 01:47:21,623 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:47:21,623 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-14 01:47:21,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:21,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-14 01:47:21,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:47:21,785 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:21,786 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:47:21,984 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:21,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919191124] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:47:21,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:47:21,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2025-04-14 01:47:21,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661591889] [2025-04-14 01:47:21,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:47:21,984 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-14 01:47:21,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:21,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-14 01:47:21,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=565, Invalid=1075, Unknown=0, NotChecked=0, Total=1640 [2025-04-14 01:47:21,986 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-14 01:47:21,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 64 transitions, 555 flow. Second operand has 41 states, 41 states have (on average 3.268292682926829) internal successors, (134), 41 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:21,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:21,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-14 01:47:21,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:22,758 INFO L116 PetriNetUnfolderBase]: 1739/2951 cut-off events. [2025-04-14 01:47:22,758 INFO L117 PetriNetUnfolderBase]: For 335045/335045 co-relation queries the response was YES. [2025-04-14 01:47:22,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16074 conditions, 2951 events. 1739/2951 cut-off events. For 335045/335045 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 13413 event pairs, 451 based on Foata normal form. 624/3575 useless extension candidates. Maximal degree in co-relation 15460. Up to 1017 conditions per place. [2025-04-14 01:47:22,779 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 361 selfloop transitions, 28 changer transitions 17/406 dead transitions. [2025-04-14 01:47:22,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 406 transitions, 4487 flow [2025-04-14 01:47:22,779 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-14 01:47:22,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-04-14 01:47:22,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 223 transitions. [2025-04-14 01:47:22,780 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37542087542087543 [2025-04-14 01:47:22,780 INFO L175 Difference]: Start difference. First operand has 161 places, 64 transitions, 555 flow. Second operand 27 states and 223 transitions. [2025-04-14 01:47:22,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 406 transitions, 4487 flow [2025-04-14 01:47:22,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 406 transitions, 3776 flow, removed 331 selfloop flow, removed 24 redundant places. [2025-04-14 01:47:22,907 INFO L231 Difference]: Finished difference. Result has 152 places, 76 transitions, 708 flow [2025-04-14 01:47:22,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=708, PETRI_PLACES=152, PETRI_TRANSITIONS=76} [2025-04-14 01:47:22,908 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 129 predicate places. [2025-04-14 01:47:22,908 INFO L485 AbstractCegarLoop]: Abstraction has has 152 places, 76 transitions, 708 flow [2025-04-14 01:47:22,908 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.268292682926829) internal successors, (134), 41 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:22,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:22,908 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:22,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-14 01:47:23,109 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-14 01:47:23,109 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:47:23,109 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:23,109 INFO L85 PathProgramCache]: Analyzing trace with hash 674614585, now seen corresponding path program 3 times [2025-04-14 01:47:23,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:23,109 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888318598] [2025-04-14 01:47:23,109 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:47:23,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:23,113 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 6 equivalence classes. [2025-04-14 01:47:23,117 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:47:23,117 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-14 01:47:23,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:23,262 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:23,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:23,262 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888318598] [2025-04-14 01:47:23,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888318598] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:47:23,262 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973258938] [2025-04-14 01:47:23,262 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:47:23,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:47:23,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:47:23,264 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:47:23,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-14 01:47:23,292 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 6 equivalence classes. [2025-04-14 01:47:23,300 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:47:23,301 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-14 01:47:23,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:23,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-14 01:47:23,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:47:23,428 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:23,428 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:47:23,627 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:23,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973258938] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:47:23,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:47:23,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2025-04-14 01:47:23,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832075873] [2025-04-14 01:47:23,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:47:23,627 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-14 01:47:23,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:23,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-14 01:47:23,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=565, Invalid=1075, Unknown=0, NotChecked=0, Total=1640 [2025-04-14 01:47:23,629 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-14 01:47:23,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 76 transitions, 708 flow. Second operand has 41 states, 41 states have (on average 3.268292682926829) internal successors, (134), 41 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:23,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:23,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-14 01:47:23,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:24,470 INFO L116 PetriNetUnfolderBase]: 2219/3755 cut-off events. [2025-04-14 01:47:24,471 INFO L117 PetriNetUnfolderBase]: For 185053/185053 co-relation queries the response was YES. [2025-04-14 01:47:24,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19566 conditions, 3755 events. 2219/3755 cut-off events. For 185053/185053 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 17687 event pairs, 701 based on Foata normal form. 648/4403 useless extension candidates. Maximal degree in co-relation 19245. Up to 1797 conditions per place. [2025-04-14 01:47:24,492 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 399 selfloop transitions, 28 changer transitions 16/443 dead transitions. [2025-04-14 01:47:24,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 443 transitions, 4733 flow [2025-04-14 01:47:24,492 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-14 01:47:24,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-04-14 01:47:24,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 248 transitions. [2025-04-14 01:47:24,495 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4175084175084175 [2025-04-14 01:47:24,495 INFO L175 Difference]: Start difference. First operand has 152 places, 76 transitions, 708 flow. Second operand 27 states and 248 transitions. [2025-04-14 01:47:24,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 443 transitions, 4733 flow [2025-04-14 01:47:24,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 443 transitions, 4573 flow, removed 61 selfloop flow, removed 14 redundant places. [2025-04-14 01:47:24,595 INFO L231 Difference]: Finished difference. Result has 176 places, 88 transitions, 804 flow [2025-04-14 01:47:24,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=804, PETRI_PLACES=176, PETRI_TRANSITIONS=88} [2025-04-14 01:47:24,595 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 153 predicate places. [2025-04-14 01:47:24,595 INFO L485 AbstractCegarLoop]: Abstraction has has 176 places, 88 transitions, 804 flow [2025-04-14 01:47:24,595 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.268292682926829) internal successors, (134), 41 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:24,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:24,596 INFO L206 CegarLoopForPetriNet]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:24,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-14 01:47:24,796 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-14 01:47:24,796 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:47:24,796 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:24,796 INFO L85 PathProgramCache]: Analyzing trace with hash 513570099, now seen corresponding path program 4 times [2025-04-14 01:47:24,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:24,797 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232625747] [2025-04-14 01:47:24,797 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:47:24,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:24,800 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-04-14 01:47:24,806 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-14 01:47:24,806 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:47:24,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:25,155 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:25,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:25,156 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232625747] [2025-04-14 01:47:25,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232625747] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:47:25,156 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923843562] [2025-04-14 01:47:25,156 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:47:25,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:47:25,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:47:25,158 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:47:25,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-14 01:47:25,188 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-04-14 01:47:25,200 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-14 01:47:25,200 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:47:25,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:25,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-14 01:47:25,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:47:25,525 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:25,525 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:47:26,098 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:26,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923843562] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:47:26,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:47:26,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 75 [2025-04-14 01:47:26,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759104827] [2025-04-14 01:47:26,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:47:26,098 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2025-04-14 01:47:26,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:26,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2025-04-14 01:47:26,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2247, Invalid=3605, Unknown=0, NotChecked=0, Total=5852 [2025-04-14 01:47:26,101 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-14 01:47:26,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 88 transitions, 804 flow. Second operand has 77 states, 77 states have (on average 3.142857142857143) internal successors, (242), 77 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:26,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:26,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-14 01:47:26,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:27,990 INFO L116 PetriNetUnfolderBase]: 3155/5315 cut-off events. [2025-04-14 01:47:27,990 INFO L117 PetriNetUnfolderBase]: For 704539/704539 co-relation queries the response was YES. [2025-04-14 01:47:28,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27885 conditions, 5315 events. 3155/5315 cut-off events. For 704539/704539 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 24250 event pairs, 751 based on Foata normal form. 1248/6563 useless extension candidates. Maximal degree in co-relation 27232. Up to 1821 conditions per place. [2025-04-14 01:47:28,021 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 709 selfloop transitions, 52 changer transitions 17/778 dead transitions. [2025-04-14 01:47:28,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 778 transitions, 8544 flow [2025-04-14 01:47:28,021 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-04-14 01:47:28,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2025-04-14 01:47:28,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 415 transitions. [2025-04-14 01:47:28,022 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3698752228163993 [2025-04-14 01:47:28,022 INFO L175 Difference]: Start difference. First operand has 176 places, 88 transitions, 804 flow. Second operand 51 states and 415 transitions. [2025-04-14 01:47:28,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 778 transitions, 8544 flow [2025-04-14 01:47:28,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 778 transitions, 8384 flow, removed 61 selfloop flow, removed 14 redundant places. [2025-04-14 01:47:28,254 INFO L231 Difference]: Finished difference. Result has 236 places, 112 transitions, 1140 flow [2025-04-14 01:47:28,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=1140, PETRI_PLACES=236, PETRI_TRANSITIONS=112} [2025-04-14 01:47:28,255 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 213 predicate places. [2025-04-14 01:47:28,255 INFO L485 AbstractCegarLoop]: Abstraction has has 236 places, 112 transitions, 1140 flow [2025-04-14 01:47:28,255 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 3.142857142857143) internal successors, (242), 77 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:28,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:28,255 INFO L206 CegarLoopForPetriNet]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:28,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-14 01:47:28,456 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-14 01:47:28,456 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:47:28,457 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:28,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1725218695, now seen corresponding path program 4 times [2025-04-14 01:47:28,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:28,457 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556723818] [2025-04-14 01:47:28,457 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:47:28,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:28,462 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-04-14 01:47:28,471 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-14 01:47:28,471 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:47:28,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:28,941 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:28,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:28,942 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556723818] [2025-04-14 01:47:28,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556723818] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:47:28,942 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084741465] [2025-04-14 01:47:28,942 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:47:28,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:47:28,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:47:28,944 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:47:28,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-14 01:47:28,979 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-04-14 01:47:28,995 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-14 01:47:28,995 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:47:28,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:28,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-14 01:47:28,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:47:29,367 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:29,367 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:47:29,951 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:29,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084741465] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:47:29,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:47:29,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 76 [2025-04-14 01:47:29,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778444438] [2025-04-14 01:47:29,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:47:29,951 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2025-04-14 01:47:29,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:29,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2025-04-14 01:47:29,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2253, Invalid=3753, Unknown=0, NotChecked=0, Total=6006 [2025-04-14 01:47:29,953 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-14 01:47:29,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 112 transitions, 1140 flow. Second operand has 78 states, 78 states have (on average 3.1666666666666665) internal successors, (247), 78 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:29,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:29,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-14 01:47:29,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:32,213 INFO L116 PetriNetUnfolderBase]: 4115/6923 cut-off events. [2025-04-14 01:47:32,213 INFO L117 PetriNetUnfolderBase]: For 916239/916239 co-relation queries the response was YES. [2025-04-14 01:47:32,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39690 conditions, 6923 events. 4115/6923 cut-off events. For 916239/916239 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 33068 event pairs, 1277 based on Foata normal form. 1296/8219 useless extension candidates. Maximal degree in co-relation 39285. Up to 3357 conditions per place. [2025-04-14 01:47:32,259 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 783 selfloop transitions, 52 changer transitions 16/851 dead transitions. [2025-04-14 01:47:32,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 851 transitions, 11429 flow [2025-04-14 01:47:32,260 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-04-14 01:47:32,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2025-04-14 01:47:32,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 464 transitions. [2025-04-14 01:47:32,261 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41354723707664887 [2025-04-14 01:47:32,261 INFO L175 Difference]: Start difference. First operand has 236 places, 112 transitions, 1140 flow. Second operand 51 states and 464 transitions. [2025-04-14 01:47:32,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 851 transitions, 11429 flow [2025-04-14 01:47:32,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 851 transitions, 11125 flow, removed 121 selfloop flow, removed 26 redundant places. [2025-04-14 01:47:32,591 INFO L231 Difference]: Finished difference. Result has 284 places, 136 transitions, 1332 flow [2025-04-14 01:47:32,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=1332, PETRI_PLACES=284, PETRI_TRANSITIONS=136} [2025-04-14 01:47:32,591 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 261 predicate places. [2025-04-14 01:47:32,591 INFO L485 AbstractCegarLoop]: Abstraction has has 284 places, 136 transitions, 1332 flow [2025-04-14 01:47:32,592 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 3.1666666666666665) internal successors, (247), 78 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:32,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:32,592 INFO L206 CegarLoopForPetriNet]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:32,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-14 01:47:32,792 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:47:32,792 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:47:32,793 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:32,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1225852083, now seen corresponding path program 5 times [2025-04-14 01:47:32,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:32,793 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814310840] [2025-04-14 01:47:32,793 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:47:32,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:32,852 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 24 equivalence classes. [2025-04-14 01:47:32,874 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 56 of 56 statements. [2025-04-14 01:47:32,875 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-04-14 01:47:32,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:34,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:34,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:34,083 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814310840] [2025-04-14 01:47:34,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814310840] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:47:34,083 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830903777] [2025-04-14 01:47:34,083 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:47:34,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:47:34,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:47:34,085 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:47:34,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-14 01:47:34,116 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 24 equivalence classes. [2025-04-14 01:47:34,136 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 56 of 56 statements. [2025-04-14 01:47:34,136 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-04-14 01:47:34,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:34,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-04-14 01:47:34,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:47:35,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:35,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:47:37,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:37,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830903777] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:47:37,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:47:37,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 147 [2025-04-14 01:47:37,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833888541] [2025-04-14 01:47:37,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:47:37,225 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 149 states [2025-04-14 01:47:37,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:37,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2025-04-14 01:47:37,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9087, Invalid=12965, Unknown=0, NotChecked=0, Total=22052 [2025-04-14 01:47:37,231 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-14 01:47:37,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 136 transitions, 1332 flow. Second operand has 149 states, 149 states have (on average 3.0738255033557045) internal successors, (458), 149 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:37,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:37,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-14 01:47:37,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:44,280 INFO L116 PetriNetUnfolderBase]: 5987/10043 cut-off events. [2025-04-14 01:47:44,280 INFO L117 PetriNetUnfolderBase]: For 4299485/4299485 co-relation queries the response was YES. [2025-04-14 01:47:44,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59781 conditions, 10043 events. 5987/10043 cut-off events. For 4299485/4299485 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 45936 event pairs, 1351 based on Foata normal form. 2496/12539 useless extension candidates. Maximal degree in co-relation 58984. Up to 3429 conditions per place. [2025-04-14 01:47:44,364 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 1405 selfloop transitions, 100 changer transitions 17/1522 dead transitions. [2025-04-14 01:47:44,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 1522 transitions, 21360 flow [2025-04-14 01:47:44,364 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-04-14 01:47:44,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2025-04-14 01:47:44,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 799 transitions. [2025-04-14 01:47:44,367 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36685032139577595 [2025-04-14 01:47:44,367 INFO L175 Difference]: Start difference. First operand has 284 places, 136 transitions, 1332 flow. Second operand 99 states and 799 transitions. [2025-04-14 01:47:44,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 1522 transitions, 21360 flow [2025-04-14 01:47:44,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 1522 transitions, 21056 flow, removed 121 selfloop flow, removed 26 redundant places. [2025-04-14 01:47:44,947 INFO L231 Difference]: Finished difference. Result has 404 places, 184 transitions, 2004 flow [2025-04-14 01:47:44,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1034, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=99, PETRI_FLOW=2004, PETRI_PLACES=404, PETRI_TRANSITIONS=184} [2025-04-14 01:47:44,947 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 381 predicate places. [2025-04-14 01:47:44,947 INFO L485 AbstractCegarLoop]: Abstraction has has 404 places, 184 transitions, 2004 flow [2025-04-14 01:47:44,948 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 149 states, 149 states have (on average 3.0738255033557045) internal successors, (458), 149 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:44,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:44,948 INFO L206 CegarLoopForPetriNet]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:44,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-14 01:47:45,148 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:47:45,148 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:47:45,149 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:45,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1611823367, now seen corresponding path program 5 times [2025-04-14 01:47:45,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:45,149 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104217478] [2025-04-14 01:47:45,149 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:47:45,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:45,153 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 24 equivalence classes. [2025-04-14 01:47:45,169 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 56 of 56 statements. [2025-04-14 01:47:45,169 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-04-14 01:47:45,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:46,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:46,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:46,374 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104217478] [2025-04-14 01:47:46,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104217478] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:47:46,374 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186875645] [2025-04-14 01:47:46,374 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:47:46,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:47:46,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:47:46,376 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:47:46,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-14 01:47:46,409 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 24 equivalence classes. [2025-04-14 01:47:46,428 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 56 of 56 statements. [2025-04-14 01:47:46,428 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-04-14 01:47:46,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:46,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-04-14 01:47:46,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:47:47,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:47,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:47:49,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:49,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186875645] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:47:49,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:47:49,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 147 [2025-04-14 01:47:49,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331225708] [2025-04-14 01:47:49,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:47:49,244 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 149 states [2025-04-14 01:47:49,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:49,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2025-04-14 01:47:49,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9087, Invalid=12965, Unknown=0, NotChecked=0, Total=22052 [2025-04-14 01:47:49,249 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-14 01:47:49,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 184 transitions, 2004 flow. Second operand has 149 states, 149 states have (on average 3.0738255033557045) internal successors, (458), 149 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:49,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:49,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-14 01:47:49,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:57,359 INFO L116 PetriNetUnfolderBase]: 7907/13259 cut-off events. [2025-04-14 01:47:57,359 INFO L117 PetriNetUnfolderBase]: For 5566347/5566347 co-relation queries the response was YES. [2025-04-14 01:47:57,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90306 conditions, 13259 events. 7907/13259 cut-off events. For 5566347/5566347 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 63798 event pairs, 2429 based on Foata normal form. 2592/15851 useless extension candidates. Maximal degree in co-relation 89733. Up to 6477 conditions per place. [2025-04-14 01:47:57,507 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 1551 selfloop transitions, 100 changer transitions 16/1667 dead transitions. [2025-04-14 01:47:57,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 502 places, 1667 transitions, 31733 flow [2025-04-14 01:47:57,507 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-04-14 01:47:57,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2025-04-14 01:47:57,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 896 transitions. [2025-04-14 01:47:57,509 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.411386593204775 [2025-04-14 01:47:57,509 INFO L175 Difference]: Start difference. First operand has 404 places, 184 transitions, 2004 flow. Second operand 99 states and 896 transitions. [2025-04-14 01:47:57,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 502 places, 1667 transitions, 31733 flow [2025-04-14 01:47:58,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 1667 transitions, 31141 flow, removed 241 selfloop flow, removed 50 redundant places. [2025-04-14 01:47:58,926 INFO L231 Difference]: Finished difference. Result has 500 places, 232 transitions, 2388 flow [2025-04-14 01:47:58,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=99, PETRI_FLOW=2388, PETRI_PLACES=500, PETRI_TRANSITIONS=232} [2025-04-14 01:47:58,927 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 477 predicate places. [2025-04-14 01:47:58,927 INFO L485 AbstractCegarLoop]: Abstraction has has 500 places, 232 transitions, 2388 flow [2025-04-14 01:47:58,927 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 149 states, 149 states have (on average 3.0738255033557045) internal successors, (458), 149 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:58,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:58,927 INFO L206 CegarLoopForPetriNet]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:58,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-14 01:47:59,128 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:47:59,128 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:47:59,129 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:59,129 INFO L85 PathProgramCache]: Analyzing trace with hash -17390669, now seen corresponding path program 6 times [2025-04-14 01:47:59,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:59,129 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958860520] [2025-04-14 01:47:59,129 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:47:59,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:59,137 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 104 statements into 48 equivalence classes. [2025-04-14 01:47:59,166 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 104 of 104 statements. [2025-04-14 01:47:59,167 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-04-14 01:47:59,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:48:02,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:48:02,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:48:02,529 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958860520] [2025-04-14 01:48:02,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958860520] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:48:02,529 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813686718] [2025-04-14 01:48:02,529 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:48:02,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:48:02,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:48:02,531 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:48:02,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-14 01:48:02,568 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 104 statements into 48 equivalence classes. [2025-04-14 01:48:02,611 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 104 of 104 statements. [2025-04-14 01:48:02,611 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-04-14 01:48:02,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:48:02,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-04-14 01:48:02,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:48:05,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:48:05,586 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:48:08,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:48:08,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813686718] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:48:08,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:48:08,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 202 [2025-04-14 01:48:08,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267008080] [2025-04-14 01:48:08,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:48:08,743 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 204 states [2025-04-14 01:48:08,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:48:08,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 204 interpolants. [2025-04-14 01:48:08,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15147, Invalid=26265, Unknown=0, NotChecked=0, Total=41412 [2025-04-14 01:48:08,747 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-14 01:48:08,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 500 places, 232 transitions, 2388 flow. Second operand has 204 states, 204 states have (on average 3.0588235294117645) internal successors, (624), 204 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:48:08,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:48:08,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-14 01:48:08,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:48:20,026 INFO L116 PetriNetUnfolderBase]: 8180/13714 cut-off events. [2025-04-14 01:48:20,027 INFO L117 PetriNetUnfolderBase]: For 4746759/4746759 co-relation queries the response was YES. [2025-04-14 01:48:20,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102301 conditions, 13714 events. 8180/13714 cut-off events. For 4746759/4746759 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 65900 event pairs, 2551 based on Foata normal form. 364/14078 useless extension candidates. Maximal degree in co-relation 101216. Up to 6645 conditions per place. [2025-04-14 01:48:20,188 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 1551 selfloop transitions, 107 changer transitions 17/1675 dead transitions. [2025-04-14 01:48:20,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 605 places, 1675 transitions, 33493 flow [2025-04-14 01:48:20,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2025-04-14 01:48:20,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2025-04-14 01:48:20,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 766 transitions. [2025-04-14 01:48:20,190 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32847341337907376 [2025-04-14 01:48:20,190 INFO L175 Difference]: Start difference. First operand has 500 places, 232 transitions, 2388 flow. Second operand 106 states and 766 transitions. [2025-04-14 01:48:20,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 605 places, 1675 transitions, 33493 flow [2025-04-14 01:48:22,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 1675 transitions, 32901 flow, removed 241 selfloop flow, removed 50 redundant places. [2025-04-14 01:48:22,566 INFO L231 Difference]: Finished difference. Result has 562 places, 239 transitions, 2130 flow [2025-04-14 01:48:22,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1802, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=106, PETRI_FLOW=2130, PETRI_PLACES=562, PETRI_TRANSITIONS=239} [2025-04-14 01:48:22,566 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 539 predicate places. [2025-04-14 01:48:22,567 INFO L485 AbstractCegarLoop]: Abstraction has has 562 places, 239 transitions, 2130 flow [2025-04-14 01:48:22,567 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 204 states, 204 states have (on average 3.0588235294117645) internal successors, (624), 204 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:48:22,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:48:22,567 INFO L206 CegarLoopForPetriNet]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:48:22,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-14 01:48:22,767 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:48:22,768 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:48:22,769 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:48:22,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1838126073, now seen corresponding path program 6 times [2025-04-14 01:48:22,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:48:22,769 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856596153] [2025-04-14 01:48:22,769 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:48:22,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:48:22,774 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 104 statements into 48 equivalence classes. [2025-04-14 01:48:22,798 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 104 of 104 statements. [2025-04-14 01:48:22,799 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-04-14 01:48:22,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:48:26,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:48:26,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:48:26,148 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856596153] [2025-04-14 01:48:26,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856596153] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:48:26,148 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153952800] [2025-04-14 01:48:26,149 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:48:26,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:48:26,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:48:26,150 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:48:26,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-14 01:48:26,187 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 104 statements into 48 equivalence classes. [2025-04-14 01:48:26,227 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 104 of 104 statements. [2025-04-14 01:48:26,227 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-04-14 01:48:26,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:48:26,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-04-14 01:48:26,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:48:29,203 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:48:29,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:48:32,194 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:48:32,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153952800] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:48:32,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:48:32,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 201 [2025-04-14 01:48:32,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146200664] [2025-04-14 01:48:32,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:48:32,195 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 203 states [2025-04-14 01:48:32,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:48:32,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 203 interpolants. [2025-04-14 01:48:32,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14950, Invalid=26056, Unknown=0, NotChecked=0, Total=41006 [2025-04-14 01:48:32,199 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-14 01:48:32,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 239 transitions, 2130 flow. Second operand has 203 states, 203 states have (on average 3.0591133004926108) internal successors, (621), 203 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:48:32,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:48:32,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-14 01:48:32,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:48:43,978 INFO L116 PetriNetUnfolderBase]: 8420/14116 cut-off events. [2025-04-14 01:48:43,978 INFO L117 PetriNetUnfolderBase]: For 4802743/4802743 co-relation queries the response was YES. [2025-04-14 01:48:44,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102131 conditions, 14116 events. 8420/14116 cut-off events. For 4802743/4802743 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 67960 event pairs, 2597 based on Foata normal form. 324/14440 useless extension candidates. Maximal degree in co-relation 101489. Up to 6932 conditions per place. [2025-04-14 01:48:44,138 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 1648 selfloop transitions, 106 changer transitions 16/1770 dead transitions. [2025-04-14 01:48:44,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 666 places, 1770 transitions, 34871 flow [2025-04-14 01:48:44,138 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2025-04-14 01:48:44,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2025-04-14 01:48:44,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 860 transitions. [2025-04-14 01:48:44,140 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3722943722943723 [2025-04-14 01:48:44,140 INFO L175 Difference]: Start difference. First operand has 562 places, 239 transitions, 2130 flow. Second operand 105 states and 860 transitions. [2025-04-14 01:48:44,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 666 places, 1770 transitions, 34871 flow [2025-04-14 01:48:46,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 1770 transitions, 34593 flow, removed 36 selfloop flow, removed 98 redundant places. [2025-04-14 01:48:46,772 INFO L231 Difference]: Finished difference. Result has 574 places, 245 transitions, 2168 flow [2025-04-14 01:48:46,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1858, PETRI_DIFFERENCE_MINUEND_PLACES=464, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=105, PETRI_FLOW=2168, PETRI_PLACES=574, PETRI_TRANSITIONS=245} [2025-04-14 01:48:46,773 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 551 predicate places. [2025-04-14 01:48:46,773 INFO L485 AbstractCegarLoop]: Abstraction has has 574 places, 245 transitions, 2168 flow [2025-04-14 01:48:46,773 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 203 states, 203 states have (on average 3.0591133004926108) internal successors, (621), 203 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:48:46,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:48:46,774 INFO L206 CegarLoopForPetriNet]: trace histogram [100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:48:46,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-14 01:48:46,974 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:48:46,974 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:48:46,976 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:48:46,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1341031819, now seen corresponding path program 7 times [2025-04-14 01:48:46,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:48:46,976 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006998194] [2025-04-14 01:48:46,976 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:48:46,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:48:46,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-04-14 01:48:47,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-04-14 01:48:47,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:48:47,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 01:48:47,019 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 01:48:47,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-04-14 01:48:47,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-04-14 01:48:47,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:48:47,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 01:48:47,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 01:48:47,090 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 01:48:47,091 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-14 01:48:47,092 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2025-04-14 01:48:47,092 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-04-14 01:48:47,092 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-14 01:48:47,092 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-14 01:48:47,092 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-14 01:48:47,092 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-14 01:48:47,093 INFO L422 BasicCegarLoop]: Path program histogram: [7, 6, 3, 3, 1, 1, 1, 1] [2025-04-14 01:48:47,235 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 01:48:47,235 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 01:48:47,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 01:48:47 BasicIcfg [2025-04-14 01:48:47,245 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 01:48:47,246 INFO L158 Benchmark]: Toolchain (without parser) took 98051.36ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 98.8MB in the beginning and 465.6MB in the end (delta: -366.7MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2025-04-14 01:48:47,246 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 87.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:48:47,246 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.27ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 75.8MB in the end (delta: 23.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-14 01:48:47,246 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.80ms. Allocated memory is still 142.6MB. Free memory was 75.8MB in the beginning and 73.3MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 01:48:47,246 INFO L158 Benchmark]: Boogie Preprocessor took 32.06ms. Allocated memory is still 142.6MB. Free memory was 73.3MB in the beginning and 72.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:48:47,246 INFO L158 Benchmark]: IcfgBuilder took 336.19ms. Allocated memory is still 142.6MB. Free memory was 72.0MB in the beginning and 49.4MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-14 01:48:47,247 INFO L158 Benchmark]: TraceAbstraction took 97225.45ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 48.8MB in the beginning and 465.6MB in the end (delta: -416.8MB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2025-04-14 01:48:47,252 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.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 419.27ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 75.8MB in the end (delta: 23.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.80ms. Allocated memory is still 142.6MB. Free memory was 75.8MB in the beginning and 73.3MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.06ms. Allocated memory is still 142.6MB. Free memory was 73.3MB in the beginning and 72.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 336.19ms. Allocated memory is still 142.6MB. Free memory was 72.0MB in the beginning and 49.4MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 97225.45ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 48.8MB in the beginning and 465.6MB in the end (delta: -416.8MB). Peak memory consumption was 1.0GB. 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 = 100 [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=100, limit=0, t1=-1] [L779] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [_N=100, limit=0, t1=-1, t2=0] [L766] 2 int i, bound; [L767] 2 int lim = _N + 1; VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, lim=101, limit=0] [L768] 2 limit = lim VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, lim=101, limit=101] [L757] 1 int i, bound; [L758] 1 int lim = _N; VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, lim=100, limit=101] [L759] 1 limit = lim VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, lim=100, limit=100] [L769] 2 bound = limit [L770] 2 i = 0 VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=0, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=1, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=2, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=3, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=4, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=5, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=6, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=7, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=8, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=9, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=10, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=11, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=12, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=13, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=14, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=15, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=16, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=17, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=18, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=19, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=20, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=21, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=22, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=23, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=24, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=25, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=26, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=27, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=28, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=29, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=30, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=31, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=32, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=33, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=34, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=35, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=36, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=37, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=38, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=39, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=40, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=41, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=42, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=43, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=44, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=45, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=46, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=47, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=48, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=49, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=50, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=51, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=52, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=53, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=54, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=55, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=56, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=57, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=58, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=59, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=60, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=61, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=62, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=63, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=64, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=65, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=66, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=67, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=68, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=69, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=70, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=71, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=72, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=73, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=74, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=75, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=76, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=77, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=78, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=79, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=80, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=81, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=82, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=83, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=84, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=85, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=86, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=87, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=88, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=89, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=90, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=91, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=92, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=93, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=94, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=95, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=96, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=97, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=98, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=99, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=100, lim=101, limit=100] [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=100, expression=0, limit=100] - 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: 97.0s, OverallIterations: 23, TraceHistogramMax: 100, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 59.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14585 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14585 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 259 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8929 IncrementalHoareTripleChecker+Invalid, 9188 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 259 mSolverCounterUnsat, 0 mSDtfsCounter, 8929 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2135 GetRequests, 216 SyntacticMatches, 179 SemanticMatches, 1740 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136408 ImplicationChecksByTransitivity, 45.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2388occurred in iteration=20, InterpolantAutomatonStates: 729, 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.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 32.8s InterpolantComputationTime, 1236 NumberOfCodeBlocks, 1204 NumberOfCodeBlocksAsserted, 357 NumberOfCheckSat, 1582 ConstructedInterpolants, 0 QuantifiedInterpolants, 7798 SizeOfPredicates, 50 NumberOfNonLiveVariables, 2430 ConjunctsInSsa, 480 ConjunctsInUnsatCore, 56 InterpolantComputations, 6 PerfectInterpolantSequences, 200/35476 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-14 01:48:47,277 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...