/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/array-eq-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:19:13,154 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:19:13,212 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 00:19:13,217 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:19:13,217 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:19:13,237 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:19:13,238 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:19:13,238 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:19:13,238 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:19:13,238 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:19:13,238 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:19:13,238 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:19:13,241 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:19:13,241 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:19:13,241 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:19:13,241 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:19:13,241 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:19:13,241 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:19:13,242 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:19:13,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:19:13,242 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:19:13,242 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:19:13,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:19:13,242 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:19:13,242 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:19:13,242 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:19:13,242 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:19:13,242 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:19:13,242 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:19:13,242 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:19:13,242 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:19:13,242 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:19:13,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:19:13,242 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:19:13,243 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:19:13,243 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:19:13,243 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:19:13,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:19:13,243 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:19:13,243 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:19:13,243 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:19:13,243 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:19:13,243 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:19:13,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:19:13,243 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:19:13,243 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:19:13,243 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:19:13,243 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 00:19:13,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:19:13,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:19:13,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:19:13,519 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:19:13,521 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:19:13,522 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/array-eq-symm.wvr.c [2025-04-14 00:19:14,796 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7da4a29c/f25d1229aca6418cadd73787684cca30/FLAG5263d1885 [2025-04-14 00:19:15,015 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:19:15,016 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/array-eq-symm.wvr.c [2025-04-14 00:19:15,036 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7da4a29c/f25d1229aca6418cadd73787684cca30/FLAG5263d1885 [2025-04-14 00:19:16,846 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7da4a29c/f25d1229aca6418cadd73787684cca30 [2025-04-14 00:19:16,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:19:16,851 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:19:16,853 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:19:16,853 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:19:16,857 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:19:16,858 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:19:16" (1/1) ... [2025-04-14 00:19:16,858 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6229127f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:19:16, skipping insertion in model container [2025-04-14 00:19:16,859 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:19:16" (1/1) ... [2025-04-14 00:19:16,875 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:19:17,081 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/array-eq-symm.wvr.c[2277,2290] [2025-04-14 00:19:17,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:19:17,096 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:19:17,125 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/array-eq-symm.wvr.c[2277,2290] [2025-04-14 00:19:17,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:19:17,137 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:19:17,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:19:17 WrapperNode [2025-04-14 00:19:17,138 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:19:17,139 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:19:17,139 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:19:17,139 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:19:17,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:19:17" (1/1) ... [2025-04-14 00:19:17,148 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:19:17" (1/1) ... [2025-04-14 00:19:17,163 INFO L138 Inliner]: procedures = 22, calls = 19, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 99 [2025-04-14 00:19:17,166 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:19:17,167 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:19:17,167 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:19:17,167 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:19:17,172 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:19:17" (1/1) ... [2025-04-14 00:19:17,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:19:17" (1/1) ... [2025-04-14 00:19:17,179 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:19:17" (1/1) ... [2025-04-14 00:19:17,195 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-04-14 00:19:17,196 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:19:17" (1/1) ... [2025-04-14 00:19:17,196 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:19:17" (1/1) ... [2025-04-14 00:19:17,202 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:19:17" (1/1) ... [2025-04-14 00:19:17,203 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:19:17" (1/1) ... [2025-04-14 00:19:17,207 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:19:17" (1/1) ... [2025-04-14 00:19:17,208 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:19:17" (1/1) ... [2025-04-14 00:19:17,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:19:17,212 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:19:17,212 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:19:17,212 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:19:17,213 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:19:17" (1/1) ... [2025-04-14 00:19:17,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:19:17,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:19:17,247 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 00:19:17,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 00:19:17,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:19:17,270 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 00:19:17,270 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 00:19:17,271 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 00:19:17,272 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 00:19:17,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:19:17,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 00:19:17,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 00:19:17,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 00:19:17,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 00:19:17,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:19:17,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:19:17,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 00:19:17,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 00:19:17,273 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:19:17,357 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:19:17,359 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:19:17,577 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:19:17,578 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:19:17,578 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:19:17,793 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:19:17,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:19:17 BoogieIcfgContainer [2025-04-14 00:19:17,795 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:19:17,798 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:19:17,798 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:19:17,801 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:19:17,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:19:16" (1/3) ... [2025-04-14 00:19:17,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b051db6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:19:17, skipping insertion in model container [2025-04-14 00:19:17,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:19:17" (2/3) ... [2025-04-14 00:19:17,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b051db6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:19:17, skipping insertion in model container [2025-04-14 00:19:17,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:19:17" (3/3) ... [2025-04-14 00:19:17,803 INFO L128 eAbstractionObserver]: Analyzing ICFG array-eq-symm.wvr.c [2025-04-14 00:19:17,813 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:19:17,814 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array-eq-symm.wvr.c that has 3 procedures, 18 locations, 19 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-14 00:19:17,814 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:19:17,847 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 00:19:17,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 21 transitions, 56 flow [2025-04-14 00:19:17,913 INFO L116 PetriNetUnfolderBase]: 4/19 cut-off events. [2025-04-14 00:19:17,915 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 00:19:17,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 19 events. 4/19 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 11 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 12. Up to 2 conditions per place. [2025-04-14 00:19:17,917 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 21 transitions, 56 flow [2025-04-14 00:19:17,922 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 18 transitions, 48 flow [2025-04-14 00:19:17,930 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:19:17,939 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;@5dd3bb1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:19:17,942 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 00:19:17,952 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:19:17,954 INFO L116 PetriNetUnfolderBase]: 4/17 cut-off events. [2025-04-14 00:19:17,954 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 00:19:17,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:17,954 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:17,955 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:19:17,959 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:17,959 INFO L85 PathProgramCache]: Analyzing trace with hash 2039712337, now seen corresponding path program 1 times [2025-04-14 00:19:17,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:17,965 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715408323] [2025-04-14 00:19:17,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:19:17,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:18,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 00:19:18,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:19:18,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:19:18,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:18,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:18,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:18,338 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715408323] [2025-04-14 00:19:18,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715408323] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:19:18,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:19:18,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 00:19:18,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844428093] [2025-04-14 00:19:18,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:19:18,344 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:19:18,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:18,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:19:18,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:19:18,365 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:19:18,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 18 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:18,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:18,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:19:18,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:18,446 INFO L116 PetriNetUnfolderBase]: 61/107 cut-off events. [2025-04-14 00:19:18,446 INFO L117 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-04-14 00:19:18,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 107 events. 61/107 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 282 event pairs, 8 based on Foata normal form. 1/70 useless extension candidates. Maximal degree in co-relation 179. Up to 77 conditions per place. [2025-04-14 00:19:18,448 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 21 selfloop transitions, 3 changer transitions 1/27 dead transitions. [2025-04-14 00:19:18,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 27 transitions, 125 flow [2025-04-14 00:19:18,449 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:19:18,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:19:18,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-04-14 00:19:18,456 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2025-04-14 00:19:18,457 INFO L175 Difference]: Start difference. First operand has 21 places, 18 transitions, 48 flow. Second operand 3 states and 38 transitions. [2025-04-14 00:19:18,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 27 transitions, 125 flow [2025-04-14 00:19:18,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 27 transitions, 111 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-14 00:19:18,461 INFO L231 Difference]: Finished difference. Result has 20 places, 20 transitions, 59 flow [2025-04-14 00:19:18,463 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=59, PETRI_PLACES=20, PETRI_TRANSITIONS=20} [2025-04-14 00:19:18,465 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2025-04-14 00:19:18,465 INFO L485 AbstractCegarLoop]: Abstraction has has 20 places, 20 transitions, 59 flow [2025-04-14 00:19:18,465 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:18,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:18,465 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:18,465 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:19:18,465 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:19:18,466 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:18,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1194616460, now seen corresponding path program 1 times [2025-04-14 00:19:18,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:18,466 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518268178] [2025-04-14 00:19:18,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:19:18,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:18,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 00:19:18,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:19:18,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:19:18,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:18,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:18,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:18,599 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518268178] [2025-04-14 00:19:18,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518268178] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:19:18,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:19:18,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:19:18,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365243916] [2025-04-14 00:19:18,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:19:18,600 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:19:18,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:18,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:19:18,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:19:18,601 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:19:18,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 20 transitions, 59 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:18,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:18,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:19:18,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:18,711 INFO L116 PetriNetUnfolderBase]: 79/158 cut-off events. [2025-04-14 00:19:18,712 INFO L117 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-04-14 00:19:18,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 158 events. 79/158 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 578 event pairs, 43 based on Foata normal form. 9/162 useless extension candidates. Maximal degree in co-relation 120. Up to 97 conditions per place. [2025-04-14 00:19:18,715 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 30 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2025-04-14 00:19:18,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 35 transitions, 166 flow [2025-04-14 00:19:18,716 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:19:18,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:19:18,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2025-04-14 00:19:18,716 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5595238095238095 [2025-04-14 00:19:18,716 INFO L175 Difference]: Start difference. First operand has 20 places, 20 transitions, 59 flow. Second operand 4 states and 47 transitions. [2025-04-14 00:19:18,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 35 transitions, 166 flow [2025-04-14 00:19:18,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 35 transitions, 162 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:19:18,717 INFO L231 Difference]: Finished difference. Result has 24 places, 22 transitions, 78 flow [2025-04-14 00:19:18,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=24, PETRI_TRANSITIONS=22} [2025-04-14 00:19:18,718 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2025-04-14 00:19:18,718 INFO L485 AbstractCegarLoop]: Abstraction has has 24 places, 22 transitions, 78 flow [2025-04-14 00:19:18,718 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:18,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:18,718 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:18,718 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:19:18,719 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:19:18,719 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:18,719 INFO L85 PathProgramCache]: Analyzing trace with hash -505186897, now seen corresponding path program 1 times [2025-04-14 00:19:18,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:18,719 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872004964] [2025-04-14 00:19:18,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:19:18,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:18,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 00:19:18,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:19:18,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:19:18,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:18,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:18,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:18,856 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872004964] [2025-04-14 00:19:18,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872004964] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:19:18,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:19:18,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:19:18,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492557821] [2025-04-14 00:19:18,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:19:18,857 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:19:18,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:18,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:19:18,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:19:18,857 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:19:18,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 22 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:18,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:18,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:19:18,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:18,951 INFO L116 PetriNetUnfolderBase]: 64/131 cut-off events. [2025-04-14 00:19:18,951 INFO L117 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-04-14 00:19:18,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 131 events. 64/131 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 429 event pairs, 34 based on Foata normal form. 5/132 useless extension candidates. Maximal degree in co-relation 252. Up to 97 conditions per place. [2025-04-14 00:19:18,956 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 17 selfloop transitions, 2 changer transitions 11/32 dead transitions. [2025-04-14 00:19:18,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 32 transitions, 162 flow [2025-04-14 00:19:18,956 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:19:18,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:19:18,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2025-04-14 00:19:18,957 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2025-04-14 00:19:18,957 INFO L175 Difference]: Start difference. First operand has 24 places, 22 transitions, 78 flow. Second operand 4 states and 45 transitions. [2025-04-14 00:19:18,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 32 transitions, 162 flow [2025-04-14 00:19:18,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 32 transitions, 156 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-14 00:19:18,958 INFO L231 Difference]: Finished difference. Result has 27 places, 21 transitions, 72 flow [2025-04-14 00:19:18,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=27, PETRI_TRANSITIONS=21} [2025-04-14 00:19:18,959 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 6 predicate places. [2025-04-14 00:19:18,959 INFO L485 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 72 flow [2025-04-14 00:19:18,959 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:18,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:18,959 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:18,959 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:19:18,959 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:19:18,959 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:18,959 INFO L85 PathProgramCache]: Analyzing trace with hash 2001150002, now seen corresponding path program 1 times [2025-04-14 00:19:18,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:18,960 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308205480] [2025-04-14 00:19:18,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:19:18,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:18,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 00:19:18,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 00:19:18,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:19:18,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:19,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:19:19,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:19,078 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308205480] [2025-04-14 00:19:19,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308205480] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:19:19,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:19:19,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:19:19,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218450260] [2025-04-14 00:19:19,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:19:19,078 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:19:19,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:19,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:19:19,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:19:19,079 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:19:19,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:19,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:19,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:19:19,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:19,172 INFO L116 PetriNetUnfolderBase]: 88/175 cut-off events. [2025-04-14 00:19:19,172 INFO L117 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-04-14 00:19:19,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 175 events. 88/175 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 649 event pairs, 39 based on Foata normal form. 9/180 useless extension candidates. Maximal degree in co-relation 417. Up to 62 conditions per place. [2025-04-14 00:19:19,173 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 36 selfloop transitions, 6 changer transitions 0/44 dead transitions. [2025-04-14 00:19:19,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 44 transitions, 223 flow [2025-04-14 00:19:19,175 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:19:19,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:19:19,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2025-04-14 00:19:19,176 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5619047619047619 [2025-04-14 00:19:19,176 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 72 flow. Second operand 5 states and 59 transitions. [2025-04-14 00:19:19,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 44 transitions, 223 flow [2025-04-14 00:19:19,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 44 transitions, 213 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-04-14 00:19:19,178 INFO L231 Difference]: Finished difference. Result has 28 places, 24 transitions, 101 flow [2025-04-14 00:19:19,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=101, PETRI_PLACES=28, PETRI_TRANSITIONS=24} [2025-04-14 00:19:19,178 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 7 predicate places. [2025-04-14 00:19:19,178 INFO L485 AbstractCegarLoop]: Abstraction has has 28 places, 24 transitions, 101 flow [2025-04-14 00:19:19,178 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:19,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:19,178 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:19,179 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:19:19,179 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:19:19,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:19,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1597994373, now seen corresponding path program 1 times [2025-04-14 00:19:19,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:19,179 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650316774] [2025-04-14 00:19:19,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:19:19,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:19,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 00:19:19,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 00:19:19,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:19:19,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:19,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:19:19,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:19,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650316774] [2025-04-14 00:19:19,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650316774] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:19:19,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:19:19,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:19:19,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413716877] [2025-04-14 00:19:19,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:19:19,279 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:19:19,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:19,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:19:19,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:19:19,280 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:19:19,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 24 transitions, 101 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:19,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:19,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:19:19,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:19,352 INFO L116 PetriNetUnfolderBase]: 67/142 cut-off events. [2025-04-14 00:19:19,352 INFO L117 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-04-14 00:19:19,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 142 events. 67/142 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 482 event pairs, 41 based on Foata normal form. 5/145 useless extension candidates. Maximal degree in co-relation 353. Up to 109 conditions per place. [2025-04-14 00:19:19,353 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 18 selfloop transitions, 3 changer transitions 9/32 dead transitions. [2025-04-14 00:19:19,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 32 transitions, 181 flow [2025-04-14 00:19:19,353 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:19:19,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:19:19,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2025-04-14 00:19:19,354 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44761904761904764 [2025-04-14 00:19:19,354 INFO L175 Difference]: Start difference. First operand has 28 places, 24 transitions, 101 flow. Second operand 5 states and 47 transitions. [2025-04-14 00:19:19,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 32 transitions, 181 flow [2025-04-14 00:19:19,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 32 transitions, 173 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-14 00:19:19,355 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 96 flow [2025-04-14 00:19:19,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=96, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2025-04-14 00:19:19,356 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 10 predicate places. [2025-04-14 00:19:19,356 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 96 flow [2025-04-14 00:19:19,356 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:19,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:19,356 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:19,356 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:19:19,356 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:19:19,357 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:19,357 INFO L85 PathProgramCache]: Analyzing trace with hash -809117498, now seen corresponding path program 1 times [2025-04-14 00:19:19,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:19,357 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432977658] [2025-04-14 00:19:19,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:19:19,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:19,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 00:19:19,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:19:19,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:19:19,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:19,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:19,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:19,885 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432977658] [2025-04-14 00:19:19,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432977658] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:19:19,885 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900738318] [2025-04-14 00:19:19,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:19:19,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:19,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:19:19,887 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:19:19,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-14 00:19:19,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 00:19:19,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:19:19,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:19:19,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:19,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-14 00:19:19,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:19:20,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:20,141 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:19:20,287 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-14 00:19:20,287 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-14 00:19:20,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:20,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900738318] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:19:20,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:19:20,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-04-14 00:19:20,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573416901] [2025-04-14 00:19:20,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:19:20,466 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 00:19:20,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:20,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 00:19:20,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-04-14 00:19:20,467 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:19:20,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 96 flow. Second operand has 18 states, 18 states have (on average 6.055555555555555) internal successors, (109), 18 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:20,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:20,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:19:20,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:20,653 INFO L116 PetriNetUnfolderBase]: 62/125 cut-off events. [2025-04-14 00:19:20,653 INFO L117 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-04-14 00:19:20,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341 conditions, 125 events. 62/125 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 8 based on Foata normal form. 5/127 useless extension candidates. Maximal degree in co-relation 316. Up to 63 conditions per place. [2025-04-14 00:19:20,654 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 26 selfloop transitions, 8 changer transitions 1/37 dead transitions. [2025-04-14 00:19:20,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 207 flow [2025-04-14 00:19:20,655 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:19:20,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:19:20,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 67 transitions. [2025-04-14 00:19:20,657 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39880952380952384 [2025-04-14 00:19:20,657 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 96 flow. Second operand 8 states and 67 transitions. [2025-04-14 00:19:20,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 37 transitions, 207 flow [2025-04-14 00:19:20,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 37 transitions, 199 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-04-14 00:19:20,659 INFO L231 Difference]: Finished difference. Result has 33 places, 24 transitions, 114 flow [2025-04-14 00:19:20,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=114, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2025-04-14 00:19:20,659 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 12 predicate places. [2025-04-14 00:19:20,659 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 114 flow [2025-04-14 00:19:20,660 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.055555555555555) internal successors, (109), 18 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:20,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:20,661 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:20,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-14 00:19:20,861 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-14 00:19:20,864 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:19:20,864 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:20,865 INFO L85 PathProgramCache]: Analyzing trace with hash 835720579, now seen corresponding path program 1 times [2025-04-14 00:19:20,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:20,865 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608395591] [2025-04-14 00:19:20,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:19:20,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:20,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 00:19:20,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:19:20,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:19:20,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:21,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:21,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:21,359 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608395591] [2025-04-14 00:19:21,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608395591] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:19:21,359 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200744857] [2025-04-14 00:19:21,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:19:21,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:21,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:19:21,361 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:19:21,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 00:19:21,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 00:19:21,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:19:21,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:19:21,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:21,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-14 00:19:21,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:19:21,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:21,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:19:21,675 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-14 00:19:21,676 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-14 00:19:21,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:21,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200744857] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 00:19:21,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 00:19:21,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 17 [2025-04-14 00:19:21,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516932712] [2025-04-14 00:19:21,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:19:21,828 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:19:21,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:21,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:19:21,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-04-14 00:19:21,828 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:19:21,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 114 flow. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:21,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:21,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:19:21,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:21,959 INFO L116 PetriNetUnfolderBase]: 55/110 cut-off events. [2025-04-14 00:19:21,959 INFO L117 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2025-04-14 00:19:21,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 338 conditions, 110 events. 55/110 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 277 event pairs, 10 based on Foata normal form. 5/113 useless extension candidates. Maximal degree in co-relation 312. Up to 79 conditions per place. [2025-04-14 00:19:21,961 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 19 selfloop transitions, 6 changer transitions 9/36 dead transitions. [2025-04-14 00:19:21,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 36 transitions, 214 flow [2025-04-14 00:19:21,961 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:19:21,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:19:21,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2025-04-14 00:19:21,962 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4217687074829932 [2025-04-14 00:19:21,962 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 114 flow. Second operand 7 states and 62 transitions. [2025-04-14 00:19:21,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 36 transitions, 214 flow [2025-04-14 00:19:21,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 36 transitions, 204 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-14 00:19:21,964 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 123 flow [2025-04-14 00:19:21,964 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=123, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2025-04-14 00:19:21,965 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 15 predicate places. [2025-04-14 00:19:21,965 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 123 flow [2025-04-14 00:19:21,965 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:21,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:21,965 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:21,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-14 00:19:22,169 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,SelfDestructingSolverStorable6 [2025-04-14 00:19:22,169 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:19:22,169 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:22,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1209930251, now seen corresponding path program 2 times [2025-04-14 00:19:22,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:22,170 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402973990] [2025-04-14 00:19:22,170 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:19:22,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:22,179 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-14 00:19:22,199 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:19:22,199 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:19:22,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:22,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:22,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:22,545 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402973990] [2025-04-14 00:19:22,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402973990] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:19:22,546 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111462043] [2025-04-14 00:19:22,546 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:19:22,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:22,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:19:22,550 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:19:22,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 00:19:22,587 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-14 00:19:22,602 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:19:22,602 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:19:22,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:22,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-14 00:19:22,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:19:22,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:22,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:19:22,849 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-14 00:19:22,849 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-14 00:19:23,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:23,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111462043] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:19:23,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:19:23,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 15 [2025-04-14 00:19:23,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535810442] [2025-04-14 00:19:23,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:19:23,075 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 00:19:23,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:23,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 00:19:23,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-04-14 00:19:23,076 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:19:23,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 123 flow. Second operand has 16 states, 16 states have (on average 5.875) internal successors, (94), 16 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:23,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:23,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:19:23,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:23,221 INFO L116 PetriNetUnfolderBase]: 39/75 cut-off events. [2025-04-14 00:19:23,221 INFO L117 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2025-04-14 00:19:23,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 75 events. 39/75 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 133 event pairs, 6 based on Foata normal form. 4/78 useless extension candidates. Maximal degree in co-relation 247. Up to 55 conditions per place. [2025-04-14 00:19:23,225 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 20 selfloop transitions, 8 changer transitions 0/30 dead transitions. [2025-04-14 00:19:23,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 30 transitions, 200 flow [2025-04-14 00:19:23,226 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:19:23,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:19:23,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2025-04-14 00:19:23,227 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2025-04-14 00:19:23,227 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 123 flow. Second operand 8 states and 60 transitions. [2025-04-14 00:19:23,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 30 transitions, 200 flow [2025-04-14 00:19:23,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 30 transitions, 186 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-04-14 00:19:23,228 INFO L231 Difference]: Finished difference. Result has 38 places, 24 transitions, 129 flow [2025-04-14 00:19:23,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=129, PETRI_PLACES=38, PETRI_TRANSITIONS=24} [2025-04-14 00:19:23,229 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 17 predicate places. [2025-04-14 00:19:23,229 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 24 transitions, 129 flow [2025-04-14 00:19:23,229 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.875) internal successors, (94), 16 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:23,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:23,229 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:23,240 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 00:19:23,429 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:23,430 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:19:23,430 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:23,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1151630610, now seen corresponding path program 1 times [2025-04-14 00:19:23,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:23,430 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110677751] [2025-04-14 00:19:23,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:19:23,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:23,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 00:19:23,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 00:19:23,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:19:23,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:23,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:19:23,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:23,501 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110677751] [2025-04-14 00:19:23,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110677751] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:19:23,501 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424852406] [2025-04-14 00:19:23,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:19:23,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:23,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:19:23,504 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 00:19:23,505 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 00:19:23,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 00:19:23,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 00:19:23,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:19:23,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:23,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 00:19:23,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:19:23,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:19:23,611 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:19:23,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:19:23,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424852406] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:19:23,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:19:23,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 2] total 5 [2025-04-14 00:19:23,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264170282] [2025-04-14 00:19:23,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:19:23,637 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:19:23,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:23,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:19:23,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:19:23,638 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:19:23,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 24 transitions, 129 flow. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:23,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:23,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:19:23,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:23,727 INFO L116 PetriNetUnfolderBase]: 92/171 cut-off events. [2025-04-14 00:19:23,727 INFO L117 PetriNetUnfolderBase]: For 186/186 co-relation queries the response was YES. [2025-04-14 00:19:23,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 619 conditions, 171 events. 92/171 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 480 event pairs, 5 based on Foata normal form. 2/172 useless extension candidates. Maximal degree in co-relation 591. Up to 77 conditions per place. [2025-04-14 00:19:23,729 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 41 selfloop transitions, 11 changer transitions 2/56 dead transitions. [2025-04-14 00:19:23,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 56 transitions, 370 flow [2025-04-14 00:19:23,731 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:19:23,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:19:23,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2025-04-14 00:19:23,732 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.54421768707483 [2025-04-14 00:19:23,732 INFO L175 Difference]: Start difference. First operand has 38 places, 24 transitions, 129 flow. Second operand 7 states and 80 transitions. [2025-04-14 00:19:23,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 56 transitions, 370 flow [2025-04-14 00:19:23,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 56 transitions, 351 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-04-14 00:19:23,734 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 199 flow [2025-04-14 00:19:23,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=199, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2025-04-14 00:19:23,734 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 19 predicate places. [2025-04-14 00:19:23,735 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 199 flow [2025-04-14 00:19:23,735 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:23,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:23,735 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:23,742 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 00:19:23,940 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:23,940 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:19:23,940 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:23,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1030879164, now seen corresponding path program 2 times [2025-04-14 00:19:23,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:23,941 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931561410] [2025-04-14 00:19:23,941 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:19:23,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:23,945 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-14 00:19:23,957 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 00:19:23,957 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:19:23,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:24,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:19:24,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:24,025 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931561410] [2025-04-14 00:19:24,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931561410] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:19:24,026 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266076965] [2025-04-14 00:19:24,026 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:19:24,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:24,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:19:24,028 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 00:19:24,039 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 00:19:24,083 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-14 00:19:24,107 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 00:19:24,107 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:19:24,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:24,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 00:19:24,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:19:24,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:19:24,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:19:24,184 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:19:24,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266076965] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:19:24,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:19:24,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 2] total 5 [2025-04-14 00:19:24,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226726139] [2025-04-14 00:19:24,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:19:24,185 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:19:24,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:24,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:19:24,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:19:24,186 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:19:24,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 199 flow. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:24,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:24,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:19:24,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:24,297 INFO L116 PetriNetUnfolderBase]: 140/257 cut-off events. [2025-04-14 00:19:24,297 INFO L117 PetriNetUnfolderBase]: For 367/367 co-relation queries the response was YES. [2025-04-14 00:19:24,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1032 conditions, 257 events. 140/257 cut-off events. For 367/367 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 843 event pairs, 23 based on Foata normal form. 2/258 useless extension candidates. Maximal degree in co-relation 1004. Up to 172 conditions per place. [2025-04-14 00:19:24,298 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 46 selfloop transitions, 11 changer transitions 2/61 dead transitions. [2025-04-14 00:19:24,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 61 transitions, 461 flow [2025-04-14 00:19:24,300 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:19:24,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:19:24,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2025-04-14 00:19:24,300 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2025-04-14 00:19:24,300 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 199 flow. Second operand 7 states and 77 transitions. [2025-04-14 00:19:24,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 61 transitions, 461 flow [2025-04-14 00:19:24,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 61 transitions, 434 flow, removed 12 selfloop flow, removed 1 redundant places. [2025-04-14 00:19:24,302 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 276 flow [2025-04-14 00:19:24,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=276, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2025-04-14 00:19:24,303 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 27 predicate places. [2025-04-14 00:19:24,303 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 276 flow [2025-04-14 00:19:24,303 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:24,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:24,303 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:24,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-14 00:19:24,504 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-14 00:19:24,504 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:19:24,504 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:24,504 INFO L85 PathProgramCache]: Analyzing trace with hash 294113493, now seen corresponding path program 3 times [2025-04-14 00:19:24,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:24,505 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100176132] [2025-04-14 00:19:24,505 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:19:24,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:24,512 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-04-14 00:19:24,530 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:19:24,530 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:19:24,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:24,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:19:24,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:24,608 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100176132] [2025-04-14 00:19:24,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100176132] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:19:24,608 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477728586] [2025-04-14 00:19:24,608 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:19:24,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:24,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:19:24,610 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 00:19:24,618 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 00:19:24,665 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-04-14 00:19:24,681 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:19:24,681 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:19:24,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:24,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 00:19:24,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:19:24,744 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:19:24,744 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:19:24,799 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:19:24,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477728586] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:19:24,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:19:24,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-04-14 00:19:24,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012527903] [2025-04-14 00:19:24,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:19:24,800 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-14 00:19:24,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:24,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-14 00:19:24,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-04-14 00:19:24,800 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:19:24,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 276 flow. Second operand has 15 states, 15 states have (on average 6.466666666666667) internal successors, (97), 15 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:24,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:24,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:19:24,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:25,003 INFO L116 PetriNetUnfolderBase]: 336/669 cut-off events. [2025-04-14 00:19:25,003 INFO L117 PetriNetUnfolderBase]: For 1512/1512 co-relation queries the response was YES. [2025-04-14 00:19:25,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2752 conditions, 669 events. 336/669 cut-off events. For 1512/1512 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3369 event pairs, 149 based on Foata normal form. 60/728 useless extension candidates. Maximal degree in co-relation 2570. Up to 253 conditions per place. [2025-04-14 00:19:25,008 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 99 selfloop transitions, 20 changer transitions 0/121 dead transitions. [2025-04-14 00:19:25,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 121 transitions, 1044 flow [2025-04-14 00:19:25,008 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 00:19:25,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 00:19:25,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 138 transitions. [2025-04-14 00:19:25,009 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2025-04-14 00:19:25,009 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 276 flow. Second operand 15 states and 138 transitions. [2025-04-14 00:19:25,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 121 transitions, 1044 flow [2025-04-14 00:19:25,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 121 transitions, 957 flow, removed 39 selfloop flow, removed 1 redundant places. [2025-04-14 00:19:25,015 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 465 flow [2025-04-14 00:19:25,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=465, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2025-04-14 00:19:25,017 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 46 predicate places. [2025-04-14 00:19:25,017 INFO L485 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 465 flow [2025-04-14 00:19:25,017 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.466666666666667) internal successors, (97), 15 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:25,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:25,018 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:25,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-14 00:19:25,222 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:25,222 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:19:25,222 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:25,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1341910636, now seen corresponding path program 4 times [2025-04-14 00:19:25,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:25,222 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943988861] [2025-04-14 00:19:25,222 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:19:25,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:25,229 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-14 00:19:25,237 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:19:25,237 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:19:25,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:25,284 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:19:25,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:25,284 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943988861] [2025-04-14 00:19:25,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943988861] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:19:25,284 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053886701] [2025-04-14 00:19:25,284 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:19:25,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:25,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:19:25,286 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 00:19:25,288 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 00:19:25,325 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-14 00:19:25,346 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:19:25,346 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:19:25,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:25,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 00:19:25,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:19:25,428 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:19:25,429 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:19:25,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:19:25,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053886701] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:19:25,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:19:25,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-14 00:19:25,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326630543] [2025-04-14 00:19:25,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:19:25,466 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 00:19:25,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:25,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 00:19:25,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-04-14 00:19:25,467 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:19:25,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 465 flow. Second operand has 12 states, 12 states have (on average 6.75) internal successors, (81), 12 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:25,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:25,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:19:25,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:25,637 INFO L116 PetriNetUnfolderBase]: 260/540 cut-off events. [2025-04-14 00:19:25,638 INFO L117 PetriNetUnfolderBase]: For 1321/1321 co-relation queries the response was YES. [2025-04-14 00:19:25,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2201 conditions, 540 events. 260/540 cut-off events. For 1321/1321 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2590 event pairs, 154 based on Foata normal form. 24/562 useless extension candidates. Maximal degree in co-relation 2036. Up to 389 conditions per place. [2025-04-14 00:19:25,640 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 41 selfloop transitions, 3 changer transitions 23/69 dead transitions. [2025-04-14 00:19:25,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 69 transitions, 650 flow [2025-04-14 00:19:25,641 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:19:25,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:19:25,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2025-04-14 00:19:25,641 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43537414965986393 [2025-04-14 00:19:25,642 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 465 flow. Second operand 7 states and 64 transitions. [2025-04-14 00:19:25,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 69 transitions, 650 flow [2025-04-14 00:19:25,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 69 transitions, 621 flow, removed 11 selfloop flow, removed 3 redundant places. [2025-04-14 00:19:25,647 INFO L231 Difference]: Finished difference. Result has 73 places, 46 transitions, 353 flow [2025-04-14 00:19:25,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=353, PETRI_PLACES=73, PETRI_TRANSITIONS=46} [2025-04-14 00:19:25,647 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 52 predicate places. [2025-04-14 00:19:25,647 INFO L485 AbstractCegarLoop]: Abstraction has has 73 places, 46 transitions, 353 flow [2025-04-14 00:19:25,648 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 12 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:25,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:25,648 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:25,655 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 00:19:25,848 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:25,848 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:19:25,849 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:25,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1615344548, now seen corresponding path program 5 times [2025-04-14 00:19:25,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:25,849 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352359060] [2025-04-14 00:19:25,849 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:19:25,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:25,856 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 00:19:25,860 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:19:25,860 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:19:25,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:25,908 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 00:19:25,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:25,908 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352359060] [2025-04-14 00:19:25,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352359060] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:19:25,908 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389583008] [2025-04-14 00:19:25,908 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:19:25,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:25,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:19:25,910 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 00:19:25,912 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 00:19:25,949 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 00:19:25,966 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:19:25,966 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:19:25,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:25,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 00:19:25,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:19:26,028 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 00:19:26,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:19:26,080 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 00:19:26,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389583008] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:19:26,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:19:26,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-14 00:19:26,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296285859] [2025-04-14 00:19:26,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:19:26,081 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-14 00:19:26,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:26,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-14 00:19:26,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-04-14 00:19:26,082 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:19:26,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 46 transitions, 353 flow. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:26,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:26,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:19:26,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:26,212 INFO L116 PetriNetUnfolderBase]: 167/330 cut-off events. [2025-04-14 00:19:26,212 INFO L117 PetriNetUnfolderBase]: For 930/930 co-relation queries the response was YES. [2025-04-14 00:19:26,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1392 conditions, 330 events. 167/330 cut-off events. For 930/930 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1282 event pairs, 94 based on Foata normal form. 12/341 useless extension candidates. Maximal degree in co-relation 1352. Up to 255 conditions per place. [2025-04-14 00:19:26,214 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 36 selfloop transitions, 4 changer transitions 16/58 dead transitions. [2025-04-14 00:19:26,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 58 transitions, 514 flow [2025-04-14 00:19:26,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:19:26,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:19:26,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2025-04-14 00:19:26,215 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4217687074829932 [2025-04-14 00:19:26,215 INFO L175 Difference]: Start difference. First operand has 73 places, 46 transitions, 353 flow. Second operand 7 states and 62 transitions. [2025-04-14 00:19:26,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 58 transitions, 514 flow [2025-04-14 00:19:26,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 58 transitions, 470 flow, removed 19 selfloop flow, removed 9 redundant places. [2025-04-14 00:19:26,220 INFO L231 Difference]: Finished difference. Result has 63 places, 42 transitions, 286 flow [2025-04-14 00:19:26,220 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=286, PETRI_PLACES=63, PETRI_TRANSITIONS=42} [2025-04-14 00:19:26,221 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 42 predicate places. [2025-04-14 00:19:26,221 INFO L485 AbstractCegarLoop]: Abstraction has has 63 places, 42 transitions, 286 flow [2025-04-14 00:19:26,221 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:26,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:26,221 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:26,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-14 00:19:26,422 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,SelfDestructingSolverStorable12 [2025-04-14 00:19:26,422 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:19:26,422 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:26,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1705342833, now seen corresponding path program 6 times [2025-04-14 00:19:26,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:26,423 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576294922] [2025-04-14 00:19:26,423 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:19:26,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:26,434 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-04-14 00:19:26,445 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:19:26,445 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 00:19:26,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:26,933 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:26,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:26,934 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576294922] [2025-04-14 00:19:26,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576294922] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:19:26,934 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667168295] [2025-04-14 00:19:26,934 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:19:26,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:26,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:19:26,938 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 00:19:26,941 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 00:19:26,982 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-04-14 00:19:27,003 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:19:27,003 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 00:19:27,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:27,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-14 00:19:27,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:19:27,312 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:27,312 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:19:27,433 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-14 00:19:27,433 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-14 00:19:27,657 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:27,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667168295] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:19:27,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:19:27,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 28 [2025-04-14 00:19:27,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236410794] [2025-04-14 00:19:27,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:19:27,659 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-14 00:19:27,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:27,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-14 00:19:27,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2025-04-14 00:19:27,660 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:19:27,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 42 transitions, 286 flow. Second operand has 29 states, 29 states have (on average 5.689655172413793) internal successors, (165), 29 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:27,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:27,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:19:27,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:28,024 INFO L116 PetriNetUnfolderBase]: 147/271 cut-off events. [2025-04-14 00:19:28,024 INFO L117 PetriNetUnfolderBase]: For 489/489 co-relation queries the response was YES. [2025-04-14 00:19:28,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1127 conditions, 271 events. 147/271 cut-off events. For 489/489 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 912 event pairs, 27 based on Foata normal form. 5/275 useless extension candidates. Maximal degree in co-relation 1089. Up to 211 conditions per place. [2025-04-14 00:19:28,026 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 44 selfloop transitions, 13 changer transitions 0/59 dead transitions. [2025-04-14 00:19:28,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 59 transitions, 479 flow [2025-04-14 00:19:28,026 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 00:19:28,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 00:19:28,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 91 transitions. [2025-04-14 00:19:28,027 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2025-04-14 00:19:28,027 INFO L175 Difference]: Start difference. First operand has 63 places, 42 transitions, 286 flow. Second operand 12 states and 91 transitions. [2025-04-14 00:19:28,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 59 transitions, 479 flow [2025-04-14 00:19:28,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 59 transitions, 443 flow, removed 14 selfloop flow, removed 7 redundant places. [2025-04-14 00:19:28,033 INFO L231 Difference]: Finished difference. Result has 64 places, 43 transitions, 296 flow [2025-04-14 00:19:28,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=296, PETRI_PLACES=64, PETRI_TRANSITIONS=43} [2025-04-14 00:19:28,033 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 43 predicate places. [2025-04-14 00:19:28,033 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 43 transitions, 296 flow [2025-04-14 00:19:28,034 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.689655172413793) internal successors, (165), 29 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:28,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:28,034 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:28,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-14 00:19:28,234 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,SelfDestructingSolverStorable13 [2025-04-14 00:19:28,234 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:19:28,235 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:28,235 INFO L85 PathProgramCache]: Analyzing trace with hash 410395064, now seen corresponding path program 7 times [2025-04-14 00:19:28,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:28,235 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446378162] [2025-04-14 00:19:28,235 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:19:28,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:28,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 00:19:28,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:19:28,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:19:28,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:28,687 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:28,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:28,688 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446378162] [2025-04-14 00:19:28,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446378162] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:19:28,688 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214710662] [2025-04-14 00:19:28,688 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:19:28,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:28,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:19:28,691 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 00:19:28,692 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 00:19:28,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 00:19:28,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:19:28,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:19:28,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:28,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-14 00:19:28,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:19:28,971 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:28,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:19:29,057 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-14 00:19:29,057 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-14 00:19:29,276 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:29,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214710662] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:19:29,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:19:29,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2025-04-14 00:19:29,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180764489] [2025-04-14 00:19:29,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:19:29,277 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-14 00:19:29,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:29,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-14 00:19:29,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=737, Unknown=0, NotChecked=0, Total=870 [2025-04-14 00:19:29,278 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:19:29,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 43 transitions, 296 flow. Second operand has 30 states, 30 states have (on average 5.7) internal successors, (171), 30 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:29,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:29,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:19:29,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:29,588 INFO L116 PetriNetUnfolderBase]: 148/279 cut-off events. [2025-04-14 00:19:29,588 INFO L117 PetriNetUnfolderBase]: For 575/575 co-relation queries the response was YES. [2025-04-14 00:19:29,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1176 conditions, 279 events. 148/279 cut-off events. For 575/575 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 982 event pairs, 39 based on Foata normal form. 3/281 useless extension candidates. Maximal degree in co-relation 1138. Up to 239 conditions per place. [2025-04-14 00:19:29,590 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 36 selfloop transitions, 11 changer transitions 10/59 dead transitions. [2025-04-14 00:19:29,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 59 transitions, 466 flow [2025-04-14 00:19:29,591 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 00:19:29,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 00:19:29,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 89 transitions. [2025-04-14 00:19:29,591 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3531746031746032 [2025-04-14 00:19:29,591 INFO L175 Difference]: Start difference. First operand has 64 places, 43 transitions, 296 flow. Second operand 12 states and 89 transitions. [2025-04-14 00:19:29,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 59 transitions, 466 flow [2025-04-14 00:19:29,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 59 transitions, 425 flow, removed 3 selfloop flow, removed 12 redundant places. [2025-04-14 00:19:29,595 INFO L231 Difference]: Finished difference. Result has 65 places, 43 transitions, 288 flow [2025-04-14 00:19:29,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=288, PETRI_PLACES=65, PETRI_TRANSITIONS=43} [2025-04-14 00:19:29,596 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 44 predicate places. [2025-04-14 00:19:29,596 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 43 transitions, 288 flow [2025-04-14 00:19:29,596 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.7) internal successors, (171), 30 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:29,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:29,596 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:29,603 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 00:19:29,796 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,SelfDestructingSolverStorable14 [2025-04-14 00:19:29,797 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:19:29,797 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:29,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1738470746, now seen corresponding path program 8 times [2025-04-14 00:19:29,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:29,797 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821348894] [2025-04-14 00:19:29,797 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:19:29,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:29,802 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-14 00:19:29,812 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:19:29,812 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:19:29,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:30,039 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:19:30,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:30,039 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821348894] [2025-04-14 00:19:30,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821348894] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:19:30,039 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972304306] [2025-04-14 00:19:30,039 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:19:30,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:30,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:19:30,041 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 00:19:30,043 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 00:19:30,087 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-14 00:19:30,104 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:19:30,104 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:19:30,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:30,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-14 00:19:30,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:19:30,155 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 00:19:30,210 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-14 00:19:30,243 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 00:19:30,421 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:30,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:19:30,761 INFO L325 Elim1Store]: treesize reduction 38, result has 53.7 percent of original size [2025-04-14 00:19:30,761 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 128 treesize of output 125 [2025-04-14 00:19:30,810 INFO L325 Elim1Store]: treesize reduction 15, result has 65.1 percent of original size [2025-04-14 00:19:30,811 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 70 [2025-04-14 00:19:30,854 INFO L325 Elim1Store]: treesize reduction 15, result has 65.1 percent of original size [2025-04-14 00:19:30,854 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 70 [2025-04-14 00:19:31,033 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse12 (* c_~i_BA~0 4)) (.cse13 (* c_~i_AB~0 4)) (.cse0 (= c_~i_BA~0 0))) (let ((.cse3 (not .cse0)) (.cse4 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse8 (+ 4 .cse13)) (.cse10 (+ 4 .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ .cse12 4)) (.cse1 (+ .cse12 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (= c_~i_AB~0 0))) (and (or (< c_~i_AB~0 1) (and (or .cse0 (forall ((v_arrayElimArr_2 (Array Int Int)) (v_subst_2 Int)) (not (= (select (select (store |c_#memory_int#1| v_subst_2 v_arrayElimArr_2) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) (select v_arrayElimArr_2 .cse2))))) (or .cse3 (forall ((v_arrayElimArr_2 (Array Int Int)) (v_subst_1 Int)) (not (= (select (select (store |c_#memory_int#1| v_subst_1 v_arrayElimArr_2) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse4) (select v_arrayElimArr_2 4))))))) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_subst_4 Int)) (let ((.cse5 (select (store |c_#memory_int#1| v_subst_4 v_arrayElimArr_1) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select v_arrayElimArr_1 .cse2) (select .cse5 .cse1))) (= (select v_arrayElimArr_1 4) (select .cse5 .cse4))))) (not .cse6)) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_subst_7 Int)) (let ((.cse7 (select (store |c_#memory_int#1| v_subst_7 v_arrayElimArr_1) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse9 (select .cse7 .cse10))) (or (not (= (select v_arrayElimArr_1 .cse2) (select .cse7 .cse1))) (= (select v_arrayElimArr_1 .cse8) .cse9) (= (select v_arrayElimArr_1 4) .cse9))))) (or (< (+ c_~i_AB~0 1) c_~An~0) (and (or .cse0 (forall ((v_arrayElimArr_3 (Array Int Int)) (v_subst_5 Int)) (not (= (select v_arrayElimArr_3 .cse2) (select (select (store |c_#memory_int#1| v_subst_5 v_arrayElimArr_3) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1))))) (or .cse3 (forall ((v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int)) (not (= (select (select (store |c_#memory_int#1| v_subst_6 v_arrayElimArr_3) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse4) (select v_arrayElimArr_3 4))))))) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_subst_3 Int)) (let ((.cse11 (select (store |c_#memory_int#1| v_subst_3 v_arrayElimArr_1) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (= (select v_arrayElimArr_1 .cse8) (select .cse11 .cse10)) (not (= (select v_arrayElimArr_1 .cse2) (select .cse11 .cse1)))))) .cse6)))) is different from false [2025-04-14 00:19:31,062 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:19:31,062 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2025-04-14 00:19:31,065 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2025-04-14 00:19:31,070 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-14 00:19:31,071 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 4 [2025-04-14 00:19:31,079 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:19:31,079 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-04-14 00:19:31,084 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2025-04-14 00:19:31,091 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:19:31,091 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2025-04-14 00:19:31,095 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2025-04-14 00:19:31,102 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:19:31,102 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-04-14 00:19:31,105 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2025-04-14 00:19:31,118 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:19:31,118 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 56 [2025-04-14 00:19:31,123 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-14 00:19:31,124 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 75 [2025-04-14 00:19:31,127 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 00:19:31,164 INFO L325 Elim1Store]: treesize reduction 8, result has 84.9 percent of original size [2025-04-14 00:19:31,164 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 72 treesize of output 78 [2025-04-14 00:19:31,198 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:19:31,198 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 49 [2025-04-14 00:19:31,208 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-14 00:19:31,208 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 64 [2025-04-14 00:19:31,212 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 00:19:31,240 INFO L325 Elim1Store]: treesize reduction 8, result has 83.0 percent of original size [2025-04-14 00:19:31,240 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 72 [2025-04-14 00:19:31,284 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-14 00:19:31,284 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 1 [2025-04-14 00:19:31,351 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-04-14 00:19:31,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972304306] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:19:31,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:19:31,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 29 [2025-04-14 00:19:31,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271662994] [2025-04-14 00:19:31,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:19:31,352 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-14 00:19:31,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:31,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-14 00:19:31,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=705, Unknown=2, NotChecked=54, Total=870 [2025-04-14 00:19:31,354 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:19:31,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 43 transitions, 288 flow. Second operand has 30 states, 30 states have (on average 5.6) internal successors, (168), 30 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:31,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:31,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:19:31,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:31,880 INFO L116 PetriNetUnfolderBase]: 147/278 cut-off events. [2025-04-14 00:19:31,880 INFO L117 PetriNetUnfolderBase]: For 693/693 co-relation queries the response was YES. [2025-04-14 00:19:31,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1203 conditions, 278 events. 147/278 cut-off events. For 693/693 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 978 event pairs, 23 based on Foata normal form. 8/285 useless extension candidates. Maximal degree in co-relation 1165. Up to 204 conditions per place. [2025-04-14 00:19:31,881 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 41 selfloop transitions, 17 changer transitions 7/67 dead transitions. [2025-04-14 00:19:31,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 67 transitions, 540 flow [2025-04-14 00:19:31,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-14 00:19:31,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-14 00:19:31,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 109 transitions. [2025-04-14 00:19:31,883 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3707482993197279 [2025-04-14 00:19:31,883 INFO L175 Difference]: Start difference. First operand has 65 places, 43 transitions, 288 flow. Second operand 14 states and 109 transitions. [2025-04-14 00:19:31,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 67 transitions, 540 flow [2025-04-14 00:19:31,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 67 transitions, 514 flow, removed 2 selfloop flow, removed 10 redundant places. [2025-04-14 00:19:31,885 INFO L231 Difference]: Finished difference. Result has 69 places, 45 transitions, 334 flow [2025-04-14 00:19:31,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=334, PETRI_PLACES=69, PETRI_TRANSITIONS=45} [2025-04-14 00:19:31,886 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 48 predicate places. [2025-04-14 00:19:31,886 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 45 transitions, 334 flow [2025-04-14 00:19:31,886 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.6) internal successors, (168), 30 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:31,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:31,886 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:31,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-14 00:19:32,090 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,SelfDestructingSolverStorable15 [2025-04-14 00:19:32,090 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:19:32,090 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:32,090 INFO L85 PathProgramCache]: Analyzing trace with hash 176577141, now seen corresponding path program 9 times [2025-04-14 00:19:32,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:32,090 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965137191] [2025-04-14 00:19:32,090 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:19:32,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:32,100 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-14 00:19:32,116 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:19:32,117 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:19:32,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:32,466 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 00:19:32,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:32,466 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965137191] [2025-04-14 00:19:32,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965137191] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:19:32,466 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692608945] [2025-04-14 00:19:32,466 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:19:32,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:32,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:19:32,470 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 00:19:32,476 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 00:19:32,528 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-14 00:19:32,548 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:19:32,548 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:19:32,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:32,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 00:19:32,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:19:32,886 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:32,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:19:32,947 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-14 00:19:32,947 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-14 00:19:33,173 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:33,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692608945] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:19:33,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:19:33,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 28 [2025-04-14 00:19:33,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823678729] [2025-04-14 00:19:33,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:19:33,174 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-14 00:19:33,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:33,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-14 00:19:33,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2025-04-14 00:19:33,175 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:19:33,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 45 transitions, 334 flow. Second operand has 29 states, 29 states have (on average 5.586206896551724) internal successors, (162), 29 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:33,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:33,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:19:33,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:33,455 INFO L116 PetriNetUnfolderBase]: 155/287 cut-off events. [2025-04-14 00:19:33,455 INFO L117 PetriNetUnfolderBase]: For 1235/1235 co-relation queries the response was YES. [2025-04-14 00:19:33,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1420 conditions, 287 events. 155/287 cut-off events. For 1235/1235 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 972 event pairs, 32 based on Foata normal form. 10/296 useless extension candidates. Maximal degree in co-relation 1380. Up to 228 conditions per place. [2025-04-14 00:19:33,457 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 45 selfloop transitions, 16 changer transitions 0/63 dead transitions. [2025-04-14 00:19:33,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 63 transitions, 555 flow [2025-04-14 00:19:33,458 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 00:19:33,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 00:19:33,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 96 transitions. [2025-04-14 00:19:33,459 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3516483516483517 [2025-04-14 00:19:33,459 INFO L175 Difference]: Start difference. First operand has 69 places, 45 transitions, 334 flow. Second operand 13 states and 96 transitions. [2025-04-14 00:19:33,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 63 transitions, 555 flow [2025-04-14 00:19:33,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 63 transitions, 509 flow, removed 8 selfloop flow, removed 11 redundant places. [2025-04-14 00:19:33,462 INFO L231 Difference]: Finished difference. Result has 70 places, 47 transitions, 354 flow [2025-04-14 00:19:33,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=354, PETRI_PLACES=70, PETRI_TRANSITIONS=47} [2025-04-14 00:19:33,462 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 49 predicate places. [2025-04-14 00:19:33,462 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 47 transitions, 354 flow [2025-04-14 00:19:33,462 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.586206896551724) internal successors, (162), 29 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:33,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:33,463 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:33,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-14 00:19:33,663 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,SelfDestructingSolverStorable16 [2025-04-14 00:19:33,663 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:19:33,664 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:33,664 INFO L85 PathProgramCache]: Analyzing trace with hash 265145784, now seen corresponding path program 10 times [2025-04-14 00:19:33,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:33,664 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122729545] [2025-04-14 00:19:33,664 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:19:33,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:33,669 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-14 00:19:33,678 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:19:33,678 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:19:33,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:33,825 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:19:33,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:33,826 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122729545] [2025-04-14 00:19:33,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122729545] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:19:33,826 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866202578] [2025-04-14 00:19:33,826 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:19:33,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:33,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:19:33,827 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 00:19:33,829 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 00:19:33,871 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-14 00:19:33,888 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:19:33,888 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:19:33,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:33,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-14 00:19:33,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:19:33,982 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:19:33,982 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:19:34,038 INFO L325 Elim1Store]: treesize reduction 24, result has 68.8 percent of original size [2025-04-14 00:19:34,039 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 71 [2025-04-14 00:19:34,105 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:19:34,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866202578] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:19:34,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:19:34,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 12 [2025-04-14 00:19:34,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024929428] [2025-04-14 00:19:34,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:19:34,106 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-14 00:19:34,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:34,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-14 00:19:34,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-04-14 00:19:34,106 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:19:34,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 47 transitions, 354 flow. Second operand has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:34,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:34,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:19:34,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:34,283 INFO L116 PetriNetUnfolderBase]: 160/296 cut-off events. [2025-04-14 00:19:34,283 INFO L117 PetriNetUnfolderBase]: For 1435/1435 co-relation queries the response was YES. [2025-04-14 00:19:34,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1505 conditions, 296 events. 160/296 cut-off events. For 1435/1435 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1028 event pairs, 14 based on Foata normal form. 8/303 useless extension candidates. Maximal degree in co-relation 1465. Up to 173 conditions per place. [2025-04-14 00:19:34,285 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 54 selfloop transitions, 17 changer transitions 1/74 dead transitions. [2025-04-14 00:19:34,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 74 transitions, 658 flow [2025-04-14 00:19:34,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 00:19:34,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 00:19:34,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2025-04-14 00:19:34,286 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46190476190476193 [2025-04-14 00:19:34,286 INFO L175 Difference]: Start difference. First operand has 70 places, 47 transitions, 354 flow. Second operand 10 states and 97 transitions. [2025-04-14 00:19:34,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 74 transitions, 658 flow [2025-04-14 00:19:34,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 74 transitions, 608 flow, removed 9 selfloop flow, removed 13 redundant places. [2025-04-14 00:19:34,289 INFO L231 Difference]: Finished difference. Result has 66 places, 47 transitions, 353 flow [2025-04-14 00:19:34,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=353, PETRI_PLACES=66, PETRI_TRANSITIONS=47} [2025-04-14 00:19:34,289 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 45 predicate places. [2025-04-14 00:19:34,290 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 47 transitions, 353 flow [2025-04-14 00:19:34,290 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:34,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:34,290 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:34,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-14 00:19:34,490 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,SelfDestructingSolverStorable17 [2025-04-14 00:19:34,490 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:19:34,491 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:34,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1046471616, now seen corresponding path program 11 times [2025-04-14 00:19:34,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:34,491 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082462930] [2025-04-14 00:19:34,491 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:19:34,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:34,497 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-14 00:19:34,505 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:19:34,505 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:19:34,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:34,820 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:34,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:34,820 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082462930] [2025-04-14 00:19:34,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082462930] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:19:34,820 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014513896] [2025-04-14 00:19:34,820 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:19:34,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:34,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:19:34,822 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 00:19:34,823 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 00:19:34,865 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-14 00:19:34,886 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:19:34,886 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:19:34,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:34,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-14 00:19:34,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:19:35,047 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:19:35,048 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:19:35,100 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-14 00:19:35,101 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-14 00:19:35,153 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:19:35,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014513896] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:19:35,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:19:35,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 5] total 17 [2025-04-14 00:19:35,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769649497] [2025-04-14 00:19:35,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:19:35,153 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 00:19:35,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:35,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 00:19:35,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-04-14 00:19:35,154 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:19:35,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 47 transitions, 353 flow. Second operand has 18 states, 18 states have (on average 6.444444444444445) internal successors, (116), 18 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:35,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:35,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:19:35,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:35,530 INFO L116 PetriNetUnfolderBase]: 178/334 cut-off events. [2025-04-14 00:19:35,530 INFO L117 PetriNetUnfolderBase]: For 1815/1815 co-relation queries the response was YES. [2025-04-14 00:19:35,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1763 conditions, 334 events. 178/334 cut-off events. For 1815/1815 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1230 event pairs, 19 based on Foata normal form. 16/349 useless extension candidates. Maximal degree in co-relation 1726. Up to 200 conditions per place. [2025-04-14 00:19:35,533 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 56 selfloop transitions, 21 changer transitions 1/80 dead transitions. [2025-04-14 00:19:35,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 80 transitions, 758 flow [2025-04-14 00:19:35,533 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 00:19:35,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-14 00:19:35,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 130 transitions. [2025-04-14 00:19:35,534 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3869047619047619 [2025-04-14 00:19:35,534 INFO L175 Difference]: Start difference. First operand has 66 places, 47 transitions, 353 flow. Second operand 16 states and 130 transitions. [2025-04-14 00:19:35,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 80 transitions, 758 flow [2025-04-14 00:19:35,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 80 transitions, 722 flow, removed 2 selfloop flow, removed 8 redundant places. [2025-04-14 00:19:35,537 INFO L231 Difference]: Finished difference. Result has 77 places, 50 transitions, 421 flow [2025-04-14 00:19:35,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=421, PETRI_PLACES=77, PETRI_TRANSITIONS=50} [2025-04-14 00:19:35,538 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 56 predicate places. [2025-04-14 00:19:35,538 INFO L485 AbstractCegarLoop]: Abstraction has has 77 places, 50 transitions, 421 flow [2025-04-14 00:19:35,538 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.444444444444445) internal successors, (116), 18 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:35,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:35,538 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:35,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-14 00:19:35,738 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:35,739 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:19:35,739 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:35,739 INFO L85 PathProgramCache]: Analyzing trace with hash 582416761, now seen corresponding path program 12 times [2025-04-14 00:19:35,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:35,739 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386616403] [2025-04-14 00:19:35,739 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:19:35,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:35,744 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-04-14 00:19:35,753 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:19:35,753 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 00:19:35,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:35,976 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:19:35,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:35,976 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386616403] [2025-04-14 00:19:35,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386616403] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:19:35,976 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562052680] [2025-04-14 00:19:35,976 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:19:35,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:35,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:19:35,978 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 00:19:35,979 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 00:19:36,023 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-04-14 00:19:36,041 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:19:36,041 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 00:19:36,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:36,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 00:19:36,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:19:36,242 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:19:36,242 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:19:36,323 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-14 00:19:36,324 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-14 00:19:36,462 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:19:36,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562052680] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:19:36,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:19:36,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 7] total 21 [2025-04-14 00:19:36,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989129009] [2025-04-14 00:19:36,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:19:36,463 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-14 00:19:36,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:36,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-14 00:19:36,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2025-04-14 00:19:36,464 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:19:36,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 50 transitions, 421 flow. Second operand has 22 states, 22 states have (on average 6.045454545454546) internal successors, (133), 22 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:36,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:36,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:19:36,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:36,693 INFO L116 PetriNetUnfolderBase]: 178/340 cut-off events. [2025-04-14 00:19:36,693 INFO L117 PetriNetUnfolderBase]: For 2634/2634 co-relation queries the response was YES. [2025-04-14 00:19:36,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1950 conditions, 340 events. 178/340 cut-off events. For 2634/2634 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1295 event pairs, 37 based on Foata normal form. 2/341 useless extension candidates. Maximal degree in co-relation 1907. Up to 312 conditions per place. [2025-04-14 00:19:36,695 INFO L140 encePairwiseOnDemand]: 14/21 looper letters, 43 selfloop transitions, 9 changer transitions 7/61 dead transitions. [2025-04-14 00:19:36,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 61 transitions, 603 flow [2025-04-14 00:19:36,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 00:19:36,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 00:19:36,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 74 transitions. [2025-04-14 00:19:36,696 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3523809523809524 [2025-04-14 00:19:36,696 INFO L175 Difference]: Start difference. First operand has 77 places, 50 transitions, 421 flow. Second operand 10 states and 74 transitions. [2025-04-14 00:19:36,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 61 transitions, 603 flow [2025-04-14 00:19:36,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 61 transitions, 541 flow, removed 12 selfloop flow, removed 12 redundant places. [2025-04-14 00:19:36,700 INFO L231 Difference]: Finished difference. Result has 76 places, 50 transitions, 388 flow [2025-04-14 00:19:36,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=388, PETRI_PLACES=76, PETRI_TRANSITIONS=50} [2025-04-14 00:19:36,700 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 55 predicate places. [2025-04-14 00:19:36,700 INFO L485 AbstractCegarLoop]: Abstraction has has 76 places, 50 transitions, 388 flow [2025-04-14 00:19:36,700 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.045454545454546) internal successors, (133), 22 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:36,700 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:36,700 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:36,706 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 00:19:36,901 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:36,901 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:19:36,901 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:36,901 INFO L85 PathProgramCache]: Analyzing trace with hash -727863213, now seen corresponding path program 13 times [2025-04-14 00:19:36,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:36,901 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522975728] [2025-04-14 00:19:36,901 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:19:36,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:36,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 00:19:36,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:19:36,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:19:36,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:37,343 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:37,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:37,344 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522975728] [2025-04-14 00:19:37,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522975728] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:19:37,344 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683932542] [2025-04-14 00:19:37,344 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:19:37,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:37,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:19:37,348 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 00:19:37,350 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 00:19:37,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 00:19:37,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:19:37,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:19:37,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:37,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-14 00:19:37,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:19:37,653 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:37,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:19:37,708 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-14 00:19:37,709 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-14 00:19:37,958 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:37,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683932542] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:19:37,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:19:37,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2025-04-14 00:19:37,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301086534] [2025-04-14 00:19:37,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:19:37,959 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-14 00:19:37,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:37,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-14 00:19:37,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2025-04-14 00:19:37,959 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:19:37,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 50 transitions, 388 flow. Second operand has 30 states, 30 states have (on average 5.633333333333334) internal successors, (169), 30 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:37,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:37,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:19:37,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:38,263 INFO L116 PetriNetUnfolderBase]: 170/324 cut-off events. [2025-04-14 00:19:38,263 INFO L117 PetriNetUnfolderBase]: For 2583/2583 co-relation queries the response was YES. [2025-04-14 00:19:38,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1855 conditions, 324 events. 170/324 cut-off events. For 2583/2583 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1162 event pairs, 32 based on Foata normal form. 5/328 useless extension candidates. Maximal degree in co-relation 1810. Up to 289 conditions per place. [2025-04-14 00:19:38,266 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 40 selfloop transitions, 13 changer transitions 7/62 dead transitions. [2025-04-14 00:19:38,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 62 transitions, 595 flow [2025-04-14 00:19:38,266 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 00:19:38,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 00:19:38,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 88 transitions. [2025-04-14 00:19:38,267 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3492063492063492 [2025-04-14 00:19:38,267 INFO L175 Difference]: Start difference. First operand has 76 places, 50 transitions, 388 flow. Second operand 12 states and 88 transitions. [2025-04-14 00:19:38,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 62 transitions, 595 flow [2025-04-14 00:19:38,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 62 transitions, 571 flow, removed 3 selfloop flow, removed 8 redundant places. [2025-04-14 00:19:38,271 INFO L231 Difference]: Finished difference. Result has 78 places, 50 transitions, 397 flow [2025-04-14 00:19:38,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=397, PETRI_PLACES=78, PETRI_TRANSITIONS=50} [2025-04-14 00:19:38,271 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 57 predicate places. [2025-04-14 00:19:38,271 INFO L485 AbstractCegarLoop]: Abstraction has has 78 places, 50 transitions, 397 flow [2025-04-14 00:19:38,272 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.633333333333334) internal successors, (169), 30 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:38,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:38,273 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:38,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-14 00:19:38,473 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:38,473 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:19:38,474 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:38,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1346816253, now seen corresponding path program 14 times [2025-04-14 00:19:38,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:38,474 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962738377] [2025-04-14 00:19:38,474 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:19:38,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:38,484 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-14 00:19:38,495 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:19:38,496 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:19:38,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:38,831 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 00:19:38,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:38,831 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962738377] [2025-04-14 00:19:38,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962738377] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:19:38,832 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570276190] [2025-04-14 00:19:38,832 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:19:38,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:38,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:19:38,834 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 00:19:38,834 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 00:19:38,880 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-14 00:19:38,896 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:19:38,896 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:19:38,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:38,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 00:19:38,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:19:39,126 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:39,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:19:39,186 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-14 00:19:39,186 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-14 00:19:39,380 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:39,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570276190] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:19:39,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:19:39,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 27 [2025-04-14 00:19:39,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601029923] [2025-04-14 00:19:39,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:19:39,380 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-14 00:19:39,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:39,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-14 00:19:39,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2025-04-14 00:19:39,381 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:19:39,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 50 transitions, 397 flow. Second operand has 28 states, 28 states have (on average 5.607142857142857) internal successors, (157), 28 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:39,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:39,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:19:39,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:39,672 INFO L116 PetriNetUnfolderBase]: 171/321 cut-off events. [2025-04-14 00:19:39,672 INFO L117 PetriNetUnfolderBase]: For 3132/3132 co-relation queries the response was YES. [2025-04-14 00:19:39,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1920 conditions, 321 events. 171/321 cut-off events. For 3132/3132 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1098 event pairs, 26 based on Foata normal form. 5/325 useless extension candidates. Maximal degree in co-relation 1875. Up to 266 conditions per place. [2025-04-14 00:19:39,675 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 46 selfloop transitions, 16 changer transitions 0/64 dead transitions. [2025-04-14 00:19:39,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 64 transitions, 632 flow [2025-04-14 00:19:39,676 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 00:19:39,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 00:19:39,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 94 transitions. [2025-04-14 00:19:39,676 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3443223443223443 [2025-04-14 00:19:39,676 INFO L175 Difference]: Start difference. First operand has 78 places, 50 transitions, 397 flow. Second operand 13 states and 94 transitions. [2025-04-14 00:19:39,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 64 transitions, 632 flow [2025-04-14 00:19:39,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 64 transitions, 595 flow, removed 4 selfloop flow, removed 11 redundant places. [2025-04-14 00:19:39,682 INFO L231 Difference]: Finished difference. Result has 79 places, 51 transitions, 412 flow [2025-04-14 00:19:39,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=412, PETRI_PLACES=79, PETRI_TRANSITIONS=51} [2025-04-14 00:19:39,683 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 58 predicate places. [2025-04-14 00:19:39,683 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 51 transitions, 412 flow [2025-04-14 00:19:39,683 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.607142857142857) internal successors, (157), 28 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:39,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:39,683 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:39,689 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 00:19:39,884 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:39,884 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:19:39,884 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:39,884 INFO L85 PathProgramCache]: Analyzing trace with hash -791065267, now seen corresponding path program 15 times [2025-04-14 00:19:39,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:39,885 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068504370] [2025-04-14 00:19:39,885 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:19:39,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:39,891 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-14 00:19:39,895 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 00:19:39,896 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:19:39,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:39,955 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:19:39,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:39,955 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068504370] [2025-04-14 00:19:39,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068504370] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:19:39,955 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916843454] [2025-04-14 00:19:39,955 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:19:39,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:39,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:19:39,960 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 00:19:39,961 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 00:19:40,024 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-14 00:19:40,049 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 00:19:40,049 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:19:40,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:40,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-14 00:19:40,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:19:40,130 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:19:40,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:19:40,155 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:19:40,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916843454] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:19:40,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:19:40,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 3] total 8 [2025-04-14 00:19:40,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851690533] [2025-04-14 00:19:40,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:19:40,156 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 00:19:40,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:40,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 00:19:40,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-14 00:19:40,157 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:19:40,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 51 transitions, 412 flow. Second operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:40,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:40,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:19:40,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:40,300 INFO L116 PetriNetUnfolderBase]: 259/479 cut-off events. [2025-04-14 00:19:40,300 INFO L117 PetriNetUnfolderBase]: For 5351/5351 co-relation queries the response was YES. [2025-04-14 00:19:40,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3117 conditions, 479 events. 259/479 cut-off events. For 5351/5351 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1930 event pairs, 22 based on Foata normal form. 2/480 useless extension candidates. Maximal degree in co-relation 3072. Up to 255 conditions per place. [2025-04-14 00:19:40,304 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 71 selfloop transitions, 26 changer transitions 2/101 dead transitions. [2025-04-14 00:19:40,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 101 transitions, 1081 flow [2025-04-14 00:19:40,304 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 00:19:40,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 00:19:40,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2025-04-14 00:19:40,305 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2025-04-14 00:19:40,305 INFO L175 Difference]: Start difference. First operand has 79 places, 51 transitions, 412 flow. Second operand 10 states and 110 transitions. [2025-04-14 00:19:40,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 101 transitions, 1081 flow [2025-04-14 00:19:40,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 101 transitions, 1041 flow, removed 4 selfloop flow, removed 11 redundant places. [2025-04-14 00:19:40,314 INFO L231 Difference]: Finished difference. Result has 81 places, 65 transitions, 655 flow [2025-04-14 00:19:40,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=655, PETRI_PLACES=81, PETRI_TRANSITIONS=65} [2025-04-14 00:19:40,314 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 60 predicate places. [2025-04-14 00:19:40,314 INFO L485 AbstractCegarLoop]: Abstraction has has 81 places, 65 transitions, 655 flow [2025-04-14 00:19:40,314 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:40,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:40,315 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:40,321 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 00:19:40,515 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:40,515 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:19:40,516 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:40,516 INFO L85 PathProgramCache]: Analyzing trace with hash -207449127, now seen corresponding path program 16 times [2025-04-14 00:19:40,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:40,516 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955597633] [2025-04-14 00:19:40,516 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:19:40,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:40,520 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-14 00:19:40,524 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 00:19:40,524 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:19:40,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:40,560 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:19:40,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:40,561 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955597633] [2025-04-14 00:19:40,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955597633] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:19:40,561 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578419679] [2025-04-14 00:19:40,561 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:19:40,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:40,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:19:40,563 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:19:40,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-14 00:19:40,616 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-14 00:19:40,633 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 00:19:40,633 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:19:40,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:40,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-14 00:19:40,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:19:40,698 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:19:40,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:19:40,716 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:19:40,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578419679] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:19:40,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:19:40,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 3] total 8 [2025-04-14 00:19:40,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001584674] [2025-04-14 00:19:40,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:19:40,717 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 00:19:40,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:40,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 00:19:40,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-14 00:19:40,717 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:19:40,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 65 transitions, 655 flow. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 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 00:19:40,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:40,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:19:40,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:40,878 INFO L116 PetriNetUnfolderBase]: 338/625 cut-off events. [2025-04-14 00:19:40,878 INFO L117 PetriNetUnfolderBase]: For 7680/7680 co-relation queries the response was YES. [2025-04-14 00:19:40,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4413 conditions, 625 events. 338/625 cut-off events. For 7680/7680 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2821 event pairs, 40 based on Foata normal form. 2/626 useless extension candidates. Maximal degree in co-relation 4366. Up to 360 conditions per place. [2025-04-14 00:19:40,882 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 72 selfloop transitions, 32 changer transitions 2/108 dead transitions. [2025-04-14 00:19:40,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 108 transitions, 1307 flow [2025-04-14 00:19:40,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 00:19:40,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 00:19:40,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2025-04-14 00:19:40,883 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-14 00:19:40,883 INFO L175 Difference]: Start difference. First operand has 81 places, 65 transitions, 655 flow. Second operand 10 states and 105 transitions. [2025-04-14 00:19:40,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 108 transitions, 1307 flow [2025-04-14 00:19:40,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 108 transitions, 1195 flow, removed 51 selfloop flow, removed 3 redundant places. [2025-04-14 00:19:40,893 INFO L231 Difference]: Finished difference. Result has 92 places, 77 transitions, 864 flow [2025-04-14 00:19:40,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=864, PETRI_PLACES=92, PETRI_TRANSITIONS=77} [2025-04-14 00:19:40,893 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 71 predicate places. [2025-04-14 00:19:40,893 INFO L485 AbstractCegarLoop]: Abstraction has has 92 places, 77 transitions, 864 flow [2025-04-14 00:19:40,893 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 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 00:19:40,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:40,893 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:40,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-14 00:19:41,094 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:41,094 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:19:41,095 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:41,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1472806185, now seen corresponding path program 17 times [2025-04-14 00:19:41,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:41,095 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594625053] [2025-04-14 00:19:41,095 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:19:41,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:41,102 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-14 00:19:41,110 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 00:19:41,110 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:19:41,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:41,158 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:19:41,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:41,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594625053] [2025-04-14 00:19:41,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594625053] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:19:41,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515467371] [2025-04-14 00:19:41,158 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:19:41,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:41,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:19:41,163 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:19:41,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-14 00:19:41,232 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-14 00:19:41,253 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 00:19:41,253 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:19:41,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:41,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-14 00:19:41,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:19:41,321 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:19:41,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:19:41,339 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:19:41,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515467371] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:19:41,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:19:41,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 3] total 8 [2025-04-14 00:19:41,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381352550] [2025-04-14 00:19:41,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:19:41,340 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 00:19:41,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:41,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 00:19:41,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-14 00:19:41,341 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:19:41,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 77 transitions, 864 flow. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 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 00:19:41,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:41,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:19:41,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:41,565 INFO L116 PetriNetUnfolderBase]: 434/799 cut-off events. [2025-04-14 00:19:41,565 INFO L117 PetriNetUnfolderBase]: For 10041/10041 co-relation queries the response was YES. [2025-04-14 00:19:41,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5843 conditions, 799 events. 434/799 cut-off events. For 10041/10041 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3834 event pairs, 77 based on Foata normal form. 2/800 useless extension candidates. Maximal degree in co-relation 5791. Up to 582 conditions per place. [2025-04-14 00:19:41,573 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 92 selfloop transitions, 27 changer transitions 2/123 dead transitions. [2025-04-14 00:19:41,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 123 transitions, 1630 flow [2025-04-14 00:19:41,574 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 00:19:41,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 00:19:41,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 104 transitions. [2025-04-14 00:19:41,574 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49523809523809526 [2025-04-14 00:19:41,574 INFO L175 Difference]: Start difference. First operand has 92 places, 77 transitions, 864 flow. Second operand 10 states and 104 transitions. [2025-04-14 00:19:41,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 123 transitions, 1630 flow [2025-04-14 00:19:41,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 123 transitions, 1540 flow, removed 39 selfloop flow, removed 4 redundant places. [2025-04-14 00:19:41,593 INFO L231 Difference]: Finished difference. Result has 101 places, 93 transitions, 1131 flow [2025-04-14 00:19:41,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1131, PETRI_PLACES=101, PETRI_TRANSITIONS=93} [2025-04-14 00:19:41,594 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 80 predicate places. [2025-04-14 00:19:41,594 INFO L485 AbstractCegarLoop]: Abstraction has has 101 places, 93 transitions, 1131 flow [2025-04-14 00:19:41,594 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 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 00:19:41,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:41,595 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:41,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-14 00:19:41,795 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-04-14 00:19:41,795 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:19:41,796 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:41,796 INFO L85 PathProgramCache]: Analyzing trace with hash 2013903862, now seen corresponding path program 18 times [2025-04-14 00:19:41,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:41,796 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608461282] [2025-04-14 00:19:41,796 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:19:41,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:41,802 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 3 equivalence classes. [2025-04-14 00:19:41,811 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:19:41,811 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:19:41,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:41,882 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-14 00:19:41,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:41,882 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608461282] [2025-04-14 00:19:41,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608461282] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:19:41,883 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893307354] [2025-04-14 00:19:41,883 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:19:41,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:41,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:19:41,885 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:19:41,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-14 00:19:41,938 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 3 equivalence classes. [2025-04-14 00:19:41,957 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:19:41,957 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:19:41,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:41,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 00:19:41,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:19:42,040 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-14 00:19:42,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:19:42,112 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-14 00:19:42,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893307354] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:19:42,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:19:42,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 20 [2025-04-14 00:19:42,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249694868] [2025-04-14 00:19:42,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:19:42,113 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-14 00:19:42,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:42,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-14 00:19:42,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2025-04-14 00:19:42,114 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:19:42,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 93 transitions, 1131 flow. Second operand has 21 states, 21 states have (on average 6.0476190476190474) internal successors, (127), 21 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:42,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:42,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:19:42,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:42,578 INFO L116 PetriNetUnfolderBase]: 1149/2322 cut-off events. [2025-04-14 00:19:42,579 INFO L117 PetriNetUnfolderBase]: For 32445/32445 co-relation queries the response was YES. [2025-04-14 00:19:42,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16975 conditions, 2322 events. 1149/2322 cut-off events. For 32445/32445 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 15731 event pairs, 412 based on Foata normal form. 246/2567 useless extension candidates. Maximal degree in co-relation 16126. Up to 890 conditions per place. [2025-04-14 00:19:42,601 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 216 selfloop transitions, 53 changer transitions 9/280 dead transitions. [2025-04-14 00:19:42,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 280 transitions, 3930 flow [2025-04-14 00:19:42,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-14 00:19:42,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-14 00:19:42,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 183 transitions. [2025-04-14 00:19:42,603 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41496598639455784 [2025-04-14 00:19:42,603 INFO L175 Difference]: Start difference. First operand has 101 places, 93 transitions, 1131 flow. Second operand 21 states and 183 transitions. [2025-04-14 00:19:42,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 280 transitions, 3930 flow [2025-04-14 00:19:42,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 280 transitions, 3557 flow, removed 176 selfloop flow, removed 2 redundant places. [2025-04-14 00:19:42,660 INFO L231 Difference]: Finished difference. Result has 128 places, 140 transitions, 1809 flow [2025-04-14 00:19:42,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1001, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1809, PETRI_PLACES=128, PETRI_TRANSITIONS=140} [2025-04-14 00:19:42,661 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 107 predicate places. [2025-04-14 00:19:42,661 INFO L485 AbstractCegarLoop]: Abstraction has has 128 places, 140 transitions, 1809 flow [2025-04-14 00:19:42,661 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.0476190476190474) internal successors, (127), 21 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:42,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:42,661 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:42,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-04-14 00:19:42,861 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-14 00:19:42,862 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:19:42,862 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:42,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1458203881, now seen corresponding path program 19 times [2025-04-14 00:19:42,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:42,863 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921593998] [2025-04-14 00:19:42,863 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:19:42,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:42,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 00:19:42,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:19:42,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:19:42,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:42,945 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:19:42,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:42,945 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921593998] [2025-04-14 00:19:42,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921593998] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:19:42,945 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136672737] [2025-04-14 00:19:42,946 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:19:42,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:42,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:19:42,947 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:19:42,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-14 00:19:42,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 00:19:43,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:19:43,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:19:43,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:43,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 00:19:43,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:19:43,103 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:19:43,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:19:43,179 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:19:43,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136672737] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:19:43,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:19:43,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2025-04-14 00:19:43,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674716839] [2025-04-14 00:19:43,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:19:43,180 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-14 00:19:43,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:43,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-14 00:19:43,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2025-04-14 00:19:43,180 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:19:43,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 140 transitions, 1809 flow. Second operand has 21 states, 21 states have (on average 6.428571428571429) internal successors, (135), 21 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:43,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:43,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:19:43,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:43,603 INFO L116 PetriNetUnfolderBase]: 699/1443 cut-off events. [2025-04-14 00:19:43,603 INFO L117 PetriNetUnfolderBase]: For 21589/21589 co-relation queries the response was YES. [2025-04-14 00:19:43,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10165 conditions, 1443 events. 699/1443 cut-off events. For 21589/21589 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 8775 event pairs, 327 based on Foata normal form. 114/1556 useless extension candidates. Maximal degree in co-relation 9621. Up to 793 conditions per place. [2025-04-14 00:19:43,615 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 85 selfloop transitions, 8 changer transitions 104/199 dead transitions. [2025-04-14 00:19:43,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 199 transitions, 2648 flow [2025-04-14 00:19:43,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-14 00:19:43,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-14 00:19:43,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 174 transitions. [2025-04-14 00:19:43,616 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3945578231292517 [2025-04-14 00:19:43,616 INFO L175 Difference]: Start difference. First operand has 128 places, 140 transitions, 1809 flow. Second operand 21 states and 174 transitions. [2025-04-14 00:19:43,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 199 transitions, 2648 flow [2025-04-14 00:19:43,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 199 transitions, 2500 flow, removed 54 selfloop flow, removed 8 redundant places. [2025-04-14 00:19:43,650 INFO L231 Difference]: Finished difference. Result has 149 places, 95 transitions, 1242 flow [2025-04-14 00:19:43,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1496, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1242, PETRI_PLACES=149, PETRI_TRANSITIONS=95} [2025-04-14 00:19:43,651 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 128 predicate places. [2025-04-14 00:19:43,651 INFO L485 AbstractCegarLoop]: Abstraction has has 149 places, 95 transitions, 1242 flow [2025-04-14 00:19:43,651 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.428571428571429) internal successors, (135), 21 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:43,651 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:43,651 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:43,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-04-14 00:19:43,851 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-14 00:19:43,852 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:19:43,852 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:43,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1438603512, now seen corresponding path program 20 times [2025-04-14 00:19:43,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:43,852 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540549138] [2025-04-14 00:19:43,853 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:19:43,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:43,859 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 00:19:43,871 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:19:43,871 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:19:43,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:44,142 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-14 00:19:44,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:44,142 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540549138] [2025-04-14 00:19:44,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540549138] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:19:44,142 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570904677] [2025-04-14 00:19:44,143 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:19:44,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:44,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:19:44,145 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:19:44,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-14 00:19:44,213 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 00:19:44,240 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:19:44,241 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:19:44,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:44,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-04-14 00:19:44,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:19:44,307 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 00:19:44,361 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-14 00:19:44,393 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-14 00:19:44,422 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 00:19:44,639 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:44,639 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:19:45,039 INFO L325 Elim1Store]: treesize reduction 17, result has 63.8 percent of original size [2025-04-14 00:19:45,040 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 76 [2025-04-14 00:19:45,074 INFO L325 Elim1Store]: treesize reduction 42, result has 53.3 percent of original size [2025-04-14 00:19:45,075 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 136 treesize of output 137 [2025-04-14 00:19:45,135 INFO L325 Elim1Store]: treesize reduction 17, result has 63.8 percent of original size [2025-04-14 00:19:45,136 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 76 [2025-04-14 00:19:45,150 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse17 (+ c_~i_AB~0 1))) (or (< |c_ULTIMATE.start_create_fresh_int_array_~size#1| (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|)) (let ((.cse15 (* c_~i_BA~0 4)) (.cse16 (* c_~i_AB~0 4)) (.cse9 (= .cse17 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|))) (let ((.cse7 (not .cse9)) (.cse8 (+ c_~i_BA~0 2)) (.cse6 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse10 (+ 8 .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ c_~A~0.offset 8 .cse16)) (.cse4 (+ .cse15 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ c_~A~0.offset .cse15 8))) (and (or (forall ((v_arrayElimArr_12 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_12) c_~A~0.base))) (let ((.cse0 (select v_arrayElimArr_12 .cse6)) (.cse3 (select .cse1 .cse5))) (or (not (= .cse0 (select .cse1 .cse2))) (= .cse0 .cse3) (= (select v_arrayElimArr_12 .cse4) .cse3))))) .cse7) (or (< .cse8 c_~An~0) (and (or .cse9 (forall ((v_arrayElimArr_11 (Array Int Int))) (not (= (select v_arrayElimArr_11 .cse10) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_11) c_~A~0.base) .cse2))))) (or (forall ((v_arrayElimArr_11 (Array Int Int))) (not (= (select v_arrayElimArr_11 .cse6) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_11) c_~A~0.base) .cse2)))) .cse7))) (or (= (+ c_~i_BA~0 1) |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) (and (or (forall ((v_arrayElimArr_12 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_12) c_~A~0.base))) (or (not (= (select v_arrayElimArr_12 .cse6) (select .cse11 .cse2))) (= (select v_arrayElimArr_12 .cse4) (select .cse11 .cse5))))) .cse7) (forall ((v_arrayElimArr_12 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_12) c_~A~0.base))) (or (not (= (select v_arrayElimArr_12 .cse10) (select .cse12 .cse2))) (= (select v_arrayElimArr_12 .cse4) (select .cse12 .cse5))))))) (or (and (or (forall ((v_arrayElimArr_13 (Array Int Int))) (not (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_13) c_~A~0.base) .cse2) (select v_arrayElimArr_13 .cse6)))) .cse7) (or .cse9 (forall ((v_arrayElimArr_13 (Array Int Int))) (not (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_13) c_~A~0.base) .cse2) (select v_arrayElimArr_13 .cse10)))))) (< .cse8 c_~Bn~0)) (forall ((v_arrayElimArr_12 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_12) c_~A~0.base))) (let ((.cse13 (select .cse14 .cse5))) (or (= (select v_arrayElimArr_12 .cse6) .cse13) (not (= (select v_arrayElimArr_12 .cse10) (select .cse14 .cse2))) (= (select v_arrayElimArr_12 .cse4) .cse13)))))))) (= c_~i_BA~0 .cse17))) is different from false [2025-04-14 00:19:45,223 WARN L849 $PredicateComparison]: unable to prove that (or (= c_~i_BA~0 (+ c_~i_AB~0 1)) (< |c_ULTIMATE.start_create_fresh_int_array_~size#1| (+ 3 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|)) (let ((.cse8 (= c_~i_AB~0 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|)) (.cse15 (* c_~i_BA~0 4)) (.cse16 (* c_~i_AB~0 4))) (let ((.cse7 (+ c_~i_BA~0 2)) (.cse0 (+ 8 .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ c_~A~0.offset 8 .cse16)) (.cse4 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ c_~A~0.offset .cse15 8)) (.cse5 (+ .cse15 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse9 (not .cse8))) (and (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_12 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_12) c_~A~0.base))) (let ((.cse3 (select .cse1 .cse6))) (or (not (= (select v_arrayElimArr_12 .cse0) (select .cse1 .cse2))) (= .cse3 (select v_arrayElimArr_12 .cse4)) (= .cse3 (select v_arrayElimArr_12 .cse5)))))) (or (< .cse7 c_~An~0) (and (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_11 (Array Int Int))) (not (= (select v_arrayElimArr_11 .cse0) (select (select (store |c_#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_11) c_~A~0.base) .cse2)))) .cse8) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_11 (Array Int Int))) (not (= (select v_arrayElimArr_11 .cse4) (select (select (store |c_#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_11) c_~A~0.base) .cse2)))) .cse9))) (or (and (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_13 (Array Int Int))) (not (= (select (select (store |c_#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_13) c_~A~0.base) .cse2) (select v_arrayElimArr_13 .cse0)))) .cse8) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_13 (Array Int Int))) (not (= (select (select (store |c_#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_13) c_~A~0.base) .cse2) (select v_arrayElimArr_13 .cse4)))) .cse9)) (< .cse7 c_~Bn~0)) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_12 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_12) c_~A~0.base))) (let ((.cse11 (select v_arrayElimArr_12 .cse4)) (.cse10 (select .cse12 .cse6))) (or (= .cse10 .cse11) (not (= (select .cse12 .cse2) .cse11)) (= .cse10 (select v_arrayElimArr_12 .cse5)))))) .cse9) (or (and (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_12 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_12) c_~A~0.base))) (or (not (= (select v_arrayElimArr_12 .cse0) (select .cse13 .cse2))) (= (select .cse13 .cse6) (select v_arrayElimArr_12 .cse5))))) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_12 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_12) c_~A~0.base))) (or (not (= (select .cse14 .cse2) (select v_arrayElimArr_12 .cse4))) (= (select .cse14 .cse6) (select v_arrayElimArr_12 .cse5))))) .cse9)) (= c_~i_BA~0 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|)))))) is different from false [2025-04-14 00:19:45,294 WARN L849 $PredicateComparison]: unable to prove that (or (= c_~i_BA~0 (+ c_~i_AB~0 1)) (let ((.cse13 (= c_~i_AB~0 0)) (.cse14 (* c_~i_AB~0 4)) (.cse15 (* c_~i_BA~0 4))) (let ((.cse4 (+ .cse15 8)) (.cse5 (+ .cse15 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse0 (+ 8 .cse14)) (.cse2 (+ 8 .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse8 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse9 (not .cse13))) (and (forall ((v_subst_13 Int) (v_arrayElimArr_12 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int#1| v_subst_13 v_arrayElimArr_12) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse3 (select .cse1 .cse5))) (or (not (= (select v_arrayElimArr_12 .cse0) (select .cse1 .cse2))) (= .cse3 (select v_arrayElimArr_12 8)) (= .cse3 (select v_arrayElimArr_12 .cse4)))))) (or (and (forall ((v_subst_14 Int) (v_arrayElimArr_12 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int#1| v_subst_14 v_arrayElimArr_12) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (= (select .cse6 .cse5) (select v_arrayElimArr_12 .cse4)) (not (= (select v_arrayElimArr_12 .cse0) (select .cse6 .cse2)))))) (or (forall ((v_subst_15 Int) (v_arrayElimArr_12 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int#1| v_subst_15 v_arrayElimArr_12) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse7 .cse8) (select v_arrayElimArr_12 8))) (= (select .cse7 .cse5) (select v_arrayElimArr_12 .cse4))))) .cse9)) (= c_~i_BA~0 0)) (or (forall ((v_subst_12 Int) (v_arrayElimArr_12 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int#1| v_subst_12 v_arrayElimArr_12) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse11 (select v_arrayElimArr_12 8)) (.cse12 (select .cse10 .cse5))) (or (not (= (select .cse10 .cse8) .cse11)) (= .cse12 .cse11) (= .cse12 (select v_arrayElimArr_12 .cse4)))))) .cse9) (or (and (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_subst_11 Int)) (not (= (select v_arrayElimArr_11 .cse0) (select (select (store |c_#memory_int#1| v_subst_11 v_arrayElimArr_11) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse2)))) .cse13) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_subst_10 Int)) (not (= (select (select (store |c_#memory_int#1| v_subst_10 v_arrayElimArr_11) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse8) (select v_arrayElimArr_11 8)))) .cse9)) (< (+ c_~i_BA~0 2) c_~An~0)) (or (and (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_subst_8 Int)) (not (= (select v_arrayElimArr_13 .cse0) (select (select (store |c_#memory_int#1| v_subst_8 v_arrayElimArr_13) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse2)))) .cse13) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_subst_9 Int)) (not (= (select v_arrayElimArr_13 8) (select (select (store |c_#memory_int#1| v_subst_9 v_arrayElimArr_13) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse8)))) .cse9)) (< c_~i_BA~0 1)))))) is different from false [2025-04-14 00:19:45,325 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:19:45,325 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 73 [2025-04-14 00:19:45,332 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-14 00:19:45,332 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 101 [2025-04-14 00:19:45,338 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 00:19:45,387 INFO L325 Elim1Store]: treesize reduction 8, result has 91.4 percent of original size [2025-04-14 00:19:45,388 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 98 treesize of output 133 [2025-04-14 00:19:45,518 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:19:45,519 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-04-14 00:19:45,521 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2025-04-14 00:19:45,525 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:19:45,525 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2025-04-14 00:19:45,527 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2025-04-14 00:19:45,535 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-14 00:19:45,535 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 1 [2025-04-14 00:19:45,542 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:19:45,542 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2025-04-14 00:19:45,545 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2025-04-14 00:19:45,553 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-14 00:19:45,553 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 1 [2025-04-14 00:19:45,652 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2025-04-14 00:19:45,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570904677] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:19:45,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:19:45,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 15] total 38 [2025-04-14 00:19:45,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495723953] [2025-04-14 00:19:45,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:19:45,653 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-14 00:19:45,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:45,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-14 00:19:45,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1074, Unknown=3, NotChecked=210, Total=1482 [2025-04-14 00:19:45,654 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:19:45,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 95 transitions, 1242 flow. Second operand has 39 states, 39 states have (on average 5.615384615384615) internal successors, (219), 39 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:45,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:45,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:19:45,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:47,403 INFO L116 PetriNetUnfolderBase]: 850/1567 cut-off events. [2025-04-14 00:19:47,403 INFO L117 PetriNetUnfolderBase]: For 26333/26333 co-relation queries the response was YES. [2025-04-14 00:19:47,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12443 conditions, 1567 events. 850/1567 cut-off events. For 26333/26333 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 8975 event pairs, 60 based on Foata normal form. 49/1615 useless extension candidates. Maximal degree in co-relation 12367. Up to 630 conditions per place. [2025-04-14 00:19:47,417 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 172 selfloop transitions, 106 changer transitions 7/287 dead transitions. [2025-04-14 00:19:47,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 287 transitions, 4353 flow [2025-04-14 00:19:47,429 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-14 00:19:47,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-04-14 00:19:47,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 331 transitions. [2025-04-14 00:19:47,431 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45034013605442175 [2025-04-14 00:19:47,431 INFO L175 Difference]: Start difference. First operand has 149 places, 95 transitions, 1242 flow. Second operand 35 states and 331 transitions. [2025-04-14 00:19:47,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 287 transitions, 4353 flow [2025-04-14 00:19:47,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 287 transitions, 3955 flow, removed 191 selfloop flow, removed 21 redundant places. [2025-04-14 00:19:47,490 INFO L231 Difference]: Finished difference. Result has 153 places, 177 transitions, 2847 flow [2025-04-14 00:19:47,490 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1018, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=2847, PETRI_PLACES=153, PETRI_TRANSITIONS=177} [2025-04-14 00:19:47,490 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 132 predicate places. [2025-04-14 00:19:47,490 INFO L485 AbstractCegarLoop]: Abstraction has has 153 places, 177 transitions, 2847 flow [2025-04-14 00:19:47,490 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 5.615384615384615) internal successors, (219), 39 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:47,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:47,490 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:47,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-14 00:19:47,691 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:47,691 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:19:47,691 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:47,692 INFO L85 PathProgramCache]: Analyzing trace with hash -124564421, now seen corresponding path program 21 times [2025-04-14 00:19:47,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:47,692 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947670077] [2025-04-14 00:19:47,692 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:19:47,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:47,697 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-04-14 00:19:47,711 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:19:47,712 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 00:19:47,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:47,999 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:19:48,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:48,000 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947670077] [2025-04-14 00:19:48,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947670077] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:19:48,000 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443042377] [2025-04-14 00:19:48,000 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:19:48,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:48,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:19:48,002 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:19:48,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-14 00:19:48,065 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-04-14 00:19:48,087 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:19:48,087 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 00:19:48,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:48,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-04-14 00:19:48,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:19:48,160 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 00:19:48,215 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-14 00:19:48,247 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-14 00:19:48,277 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 00:19:48,579 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:48,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:19:49,193 INFO L325 Elim1Store]: treesize reduction 42, result has 53.3 percent of original size [2025-04-14 00:19:49,193 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 136 treesize of output 137 [2025-04-14 00:19:49,261 INFO L325 Elim1Store]: treesize reduction 17, result has 63.8 percent of original size [2025-04-14 00:19:49,261 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 76 [2025-04-14 00:19:49,289 INFO L325 Elim1Store]: treesize reduction 17, result has 63.8 percent of original size [2025-04-14 00:19:49,289 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 76 [2025-04-14 00:19:49,815 WARN L849 $PredicateComparison]: unable to prove that (or (= c_~i_AB~0 (+ c_~i_BA~0 1)) (< 1 c_~i_AB~0) (< c_~An~0 (+ c_~i_BA~0 3)) (let ((.cse13 (* c_~i_AB~0 4)) (.cse14 (* c_~i_BA~0 4))) (let ((.cse1 (+ .cse14 8)) (.cse0 (+ .cse14 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ 8 .cse13)) (.cse4 (+ 8 .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (= c_~i_BA~0 0))) (and (or (< (+ c_~i_AB~0 2) c_~An~0) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_17 Int)) (not (= (select (select (store |c_#memory_int#1| v_subst_17 v_arrayElimArr_21) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse0) (select v_arrayElimArr_21 .cse1))))) (or .cse2 (and (or (forall ((v_subst_21 Int) (v_arrayElimArr_20 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int#1| v_subst_21 v_arrayElimArr_20) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse3 .cse0) (select v_arrayElimArr_20 .cse1))) (= (select .cse3 .cse4) (select v_arrayElimArr_20 .cse5))))) (= c_~i_AB~0 0)) (forall ((v_subst_20 Int) (v_arrayElimArr_20 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int#1| v_subst_20 v_arrayElimArr_20) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse6 (select .cse7 .cse4))) (or (= .cse6 (select v_arrayElimArr_20 .cse5)) (= .cse6 (select v_arrayElimArr_20 8)) (not (= (select .cse7 .cse0) (select v_arrayElimArr_20 .cse1))))))))) (or (forall ((v_arrayElimArr_22 (Array Int Int)) (v_subst_18 Int)) (not (= (select v_arrayElimArr_22 .cse1) (select (select (store |c_#memory_int#1| v_subst_18 v_arrayElimArr_22) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse0)))) (< c_~i_AB~0 1)) (or (let ((.cse10 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_subst_22 Int) (v_arrayElimArr_20 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int#1| v_subst_22 v_arrayElimArr_20) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse8 (select v_arrayElimArr_20 8)) (.cse11 (select .cse9 .cse4))) (or (not (= .cse8 (select .cse9 .cse10))) (= .cse8 .cse11) (= .cse11 (select v_arrayElimArr_20 .cse5)))))) (forall ((v_subst_23 Int) (v_arrayElimArr_20 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int#1| v_subst_23 v_arrayElimArr_20) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (= (select v_arrayElimArr_20 .cse5) (select .cse12 .cse4)) (not (= (select v_arrayElimArr_20 8) (select .cse12 .cse10)))))))) (not .cse2))))) (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< 0 c_~i_BA~0)) is different from false [2025-04-14 00:19:49,868 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:19:49,868 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 66 [2025-04-14 00:19:49,875 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-14 00:19:49,875 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 90 [2025-04-14 00:19:49,883 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 00:19:49,904 INFO L325 Elim1Store]: treesize reduction 8, result has 83.0 percent of original size [2025-04-14 00:19:49,905 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 87 treesize of output 87 [2025-04-14 00:19:49,952 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:19:49,952 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2025-04-14 00:19:49,955 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2025-04-14 00:19:49,962 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:19:49,963 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 73 [2025-04-14 00:19:49,970 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-14 00:19:49,971 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 101 [2025-04-14 00:19:49,975 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 00:19:49,976 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 00:19:50,019 INFO L325 Elim1Store]: treesize reduction 8, result has 90.6 percent of original size [2025-04-14 00:19:50,020 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 98 treesize of output 125 [2025-04-14 00:19:50,104 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-14 00:19:50,104 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 1 [2025-04-14 00:19:50,254 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-04-14 00:19:50,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443042377] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:19:50,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:19:50,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 15] total 41 [2025-04-14 00:19:50,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962849958] [2025-04-14 00:19:50,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:19:50,254 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-14 00:19:50,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:50,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-14 00:19:50,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=1308, Unknown=1, NotChecked=78, Total=1722 [2025-04-14 00:19:50,255 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:19:50,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 177 transitions, 2847 flow. Second operand has 42 states, 42 states have (on average 5.523809523809524) internal successors, (232), 42 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:50,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:50,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:19:50,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:54,915 INFO L116 PetriNetUnfolderBase]: 1740/3414 cut-off events. [2025-04-14 00:19:54,915 INFO L117 PetriNetUnfolderBase]: For 98105/98105 co-relation queries the response was YES. [2025-04-14 00:19:54,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31354 conditions, 3414 events. 1740/3414 cut-off events. For 98105/98105 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 24251 event pairs, 87 based on Foata normal form. 91/3504 useless extension candidates. Maximal degree in co-relation 31252. Up to 1204 conditions per place. [2025-04-14 00:19:54,939 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 223 selfloop transitions, 312 changer transitions 64/601 dead transitions. [2025-04-14 00:19:54,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 601 transitions, 10429 flow [2025-04-14 00:19:54,940 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-04-14 00:19:54,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2025-04-14 00:19:54,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 432 transitions. [2025-04-14 00:19:54,941 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4198250728862974 [2025-04-14 00:19:54,941 INFO L175 Difference]: Start difference. First operand has 153 places, 177 transitions, 2847 flow. Second operand 49 states and 432 transitions. [2025-04-14 00:19:54,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 601 transitions, 10429 flow [2025-04-14 00:19:55,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 601 transitions, 8152 flow, removed 1089 selfloop flow, removed 15 redundant places. [2025-04-14 00:19:55,247 INFO L231 Difference]: Finished difference. Result has 209 places, 443 transitions, 7099 flow [2025-04-14 00:19:55,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=2013, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=7099, PETRI_PLACES=209, PETRI_TRANSITIONS=443} [2025-04-14 00:19:55,248 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 188 predicate places. [2025-04-14 00:19:55,248 INFO L485 AbstractCegarLoop]: Abstraction has has 209 places, 443 transitions, 7099 flow [2025-04-14 00:19:55,248 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 5.523809523809524) internal successors, (232), 42 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:55,248 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:55,248 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:55,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-04-14 00:19:55,448 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-14 00:19:55,449 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:19:55,449 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:55,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1567221159, now seen corresponding path program 22 times [2025-04-14 00:19:55,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:55,449 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051074833] [2025-04-14 00:19:55,449 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:19:55,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:55,455 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-14 00:19:55,475 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:19:55,475 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:19:55,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:55,718 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-14 00:19:55,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:55,718 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051074833] [2025-04-14 00:19:55,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051074833] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:19:55,718 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363025340] [2025-04-14 00:19:55,718 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:19:55,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:55,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:19:55,723 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:19:55,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-14 00:19:55,803 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-14 00:19:55,831 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:19:55,831 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:19:55,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:55,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-14 00:19:55,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:19:55,944 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-14 00:19:55,944 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:19:56,027 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-14 00:19:56,028 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-14 00:19:56,101 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-14 00:19:56,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363025340] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:19:56,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:19:56,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 19 [2025-04-14 00:19:56,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105223687] [2025-04-14 00:19:56,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:19:56,101 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-14 00:19:56,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:56,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-14 00:19:56,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2025-04-14 00:19:56,103 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:19:56,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 443 transitions, 7099 flow. Second operand has 20 states, 20 states have (on average 6.55) internal successors, (131), 20 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:56,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:56,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:19:56,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:57,122 INFO L116 PetriNetUnfolderBase]: 1497/2966 cut-off events. [2025-04-14 00:19:57,122 INFO L117 PetriNetUnfolderBase]: For 108549/108549 co-relation queries the response was YES. [2025-04-14 00:19:57,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28249 conditions, 2966 events. 1497/2966 cut-off events. For 108549/108549 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 20626 event pairs, 54 based on Foata normal form. 44/3008 useless extension candidates. Maximal degree in co-relation 28125. Up to 1107 conditions per place. [2025-04-14 00:19:57,148 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 336 selfloop transitions, 198 changer transitions 41/577 dead transitions. [2025-04-14 00:19:57,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 577 transitions, 10639 flow [2025-04-14 00:19:57,149 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 00:19:57,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-14 00:19:57,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 162 transitions. [2025-04-14 00:19:57,149 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-04-14 00:19:57,149 INFO L175 Difference]: Start difference. First operand has 209 places, 443 transitions, 7099 flow. Second operand 18 states and 162 transitions. [2025-04-14 00:19:57,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 577 transitions, 10639 flow [2025-04-14 00:19:57,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 577 transitions, 9048 flow, removed 779 selfloop flow, removed 10 redundant places. [2025-04-14 00:19:57,618 INFO L231 Difference]: Finished difference. Result has 212 places, 464 transitions, 7013 flow [2025-04-14 00:19:57,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=5843, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=7013, PETRI_PLACES=212, PETRI_TRANSITIONS=464} [2025-04-14 00:19:57,619 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 191 predicate places. [2025-04-14 00:19:57,619 INFO L485 AbstractCegarLoop]: Abstraction has has 212 places, 464 transitions, 7013 flow [2025-04-14 00:19:57,619 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.55) internal successors, (131), 20 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:57,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:57,619 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:57,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-04-14 00:19:57,820 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:57,820 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:19:57,821 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:57,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1154781337, now seen corresponding path program 23 times [2025-04-14 00:19:57,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:57,821 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707429565] [2025-04-14 00:19:57,821 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:19:57,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:57,828 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 3 equivalence classes. [2025-04-14 00:19:57,836 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:19:57,836 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 00:19:57,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:58,070 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:19:58,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:58,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707429565] [2025-04-14 00:19:58,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707429565] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:19:58,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726798275] [2025-04-14 00:19:58,070 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:19:58,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:58,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:19:58,072 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:19:58,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-14 00:19:58,128 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 3 equivalence classes. [2025-04-14 00:19:58,153 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:19:58,153 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 00:19:58,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:58,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-14 00:19:58,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:19:58,295 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-14 00:19:58,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:19:58,330 INFO L325 Elim1Store]: treesize reduction 24, result has 68.8 percent of original size [2025-04-14 00:19:58,331 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 71 [2025-04-14 00:19:58,357 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-14 00:19:58,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726798275] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:19:58,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:19:58,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 5] total 17 [2025-04-14 00:19:58,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542656685] [2025-04-14 00:19:58,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:19:58,358 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 00:19:58,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:58,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 00:19:58,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-04-14 00:19:58,358 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:19:58,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 464 transitions, 7013 flow. Second operand has 18 states, 18 states have (on average 6.222222222222222) internal successors, (112), 18 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:58,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:58,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:19:58,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:59,179 INFO L116 PetriNetUnfolderBase]: 1423/2862 cut-off events. [2025-04-14 00:19:59,179 INFO L117 PetriNetUnfolderBase]: For 102265/102265 co-relation queries the response was YES. [2025-04-14 00:19:59,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25696 conditions, 2862 events. 1423/2862 cut-off events. For 102265/102265 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 19946 event pairs, 162 based on Foata normal form. 26/2886 useless extension candidates. Maximal degree in co-relation 25597. Up to 1818 conditions per place. [2025-04-14 00:19:59,205 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 315 selfloop transitions, 201 changer transitions 0/518 dead transitions. [2025-04-14 00:19:59,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 518 transitions, 8824 flow [2025-04-14 00:19:59,206 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 00:19:59,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-14 00:19:59,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 140 transitions. [2025-04-14 00:19:59,206 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-04-14 00:19:59,206 INFO L175 Difference]: Start difference. First operand has 212 places, 464 transitions, 7013 flow. Second operand 16 states and 140 transitions. [2025-04-14 00:19:59,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 518 transitions, 8824 flow [2025-04-14 00:19:59,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 518 transitions, 8073 flow, removed 231 selfloop flow, removed 9 redundant places. [2025-04-14 00:19:59,541 INFO L231 Difference]: Finished difference. Result has 217 places, 473 transitions, 7010 flow [2025-04-14 00:19:59,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=6237, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=192, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=7010, PETRI_PLACES=217, PETRI_TRANSITIONS=473} [2025-04-14 00:19:59,542 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 196 predicate places. [2025-04-14 00:19:59,542 INFO L485 AbstractCegarLoop]: Abstraction has has 217 places, 473 transitions, 7010 flow [2025-04-14 00:19:59,542 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.222222222222222) internal successors, (112), 18 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:59,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:59,542 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:59,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-04-14 00:19:59,743 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-04-14 00:19:59,743 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:19:59,743 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:59,743 INFO L85 PathProgramCache]: Analyzing trace with hash 967147763, now seen corresponding path program 24 times [2025-04-14 00:19:59,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:59,743 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95922626] [2025-04-14 00:19:59,743 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:19:59,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:59,749 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 3 equivalence classes. [2025-04-14 00:19:59,761 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:19:59,761 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:19:59,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:00,068 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-14 00:20:00,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:20:00,069 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95922626] [2025-04-14 00:20:00,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95922626] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:20:00,069 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307972954] [2025-04-14 00:20:00,069 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:20:00,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:20:00,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:20:00,071 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:20:00,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-14 00:20:00,175 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 3 equivalence classes. [2025-04-14 00:20:00,207 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:20:00,208 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:20:00,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:00,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 00:20:00,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:20:00,376 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-14 00:20:00,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:20:00,453 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-14 00:20:00,453 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-14 00:20:00,506 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-14 00:20:00,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307972954] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:20:00,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:20:00,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 6] total 19 [2025-04-14 00:20:00,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511900961] [2025-04-14 00:20:00,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:20:00,507 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-14 00:20:00,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:20:00,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-14 00:20:00,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-04-14 00:20:00,508 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:20:00,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 473 transitions, 7010 flow. Second operand has 20 states, 20 states have (on average 6.1) internal successors, (122), 20 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:20:00,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:20:00,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:20:00,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:20:01,238 INFO L116 PetriNetUnfolderBase]: 1479/2973 cut-off events. [2025-04-14 00:20:01,239 INFO L117 PetriNetUnfolderBase]: For 108328/108328 co-relation queries the response was YES. [2025-04-14 00:20:01,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25939 conditions, 2973 events. 1479/2973 cut-off events. For 108328/108328 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 20906 event pairs, 175 based on Foata normal form. 36/3007 useless extension candidates. Maximal degree in co-relation 25836. Up to 2248 conditions per place. [2025-04-14 00:20:01,258 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 428 selfloop transitions, 129 changer transitions 2/561 dead transitions. [2025-04-14 00:20:01,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 561 transitions, 9719 flow [2025-04-14 00:20:01,258 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-14 00:20:01,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-14 00:20:01,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 134 transitions. [2025-04-14 00:20:01,259 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4557823129251701 [2025-04-14 00:20:01,259 INFO L175 Difference]: Start difference. First operand has 217 places, 473 transitions, 7010 flow. Second operand 14 states and 134 transitions. [2025-04-14 00:20:01,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 561 transitions, 9719 flow [2025-04-14 00:20:01,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 561 transitions, 9385 flow, removed 35 selfloop flow, removed 12 redundant places. [2025-04-14 00:20:01,616 INFO L231 Difference]: Finished difference. Result has 222 places, 487 transitions, 7406 flow [2025-04-14 00:20:01,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=6676, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=7406, PETRI_PLACES=222, PETRI_TRANSITIONS=487} [2025-04-14 00:20:01,617 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 201 predicate places. [2025-04-14 00:20:01,617 INFO L485 AbstractCegarLoop]: Abstraction has has 222 places, 487 transitions, 7406 flow [2025-04-14 00:20:01,617 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.1) internal successors, (122), 20 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:20:01,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:20:01,617 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:20:01,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-04-14 00:20:01,818 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:20:01,818 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:20:01,818 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:20:01,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1740134840, now seen corresponding path program 25 times [2025-04-14 00:20:01,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:20:01,819 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644928331] [2025-04-14 00:20:01,819 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:20:01,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:20:01,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 00:20:01,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:20:01,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:20:01,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:02,321 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:20:02,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:20:02,321 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644928331] [2025-04-14 00:20:02,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644928331] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:20:02,321 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012389834] [2025-04-14 00:20:02,321 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:20:02,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:20:02,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:20:02,324 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:20:02,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-04-14 00:20:02,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 00:20:02,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:20:02,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:20:02,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:02,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 00:20:02,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:20:02,661 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:20:02,661 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:20:02,769 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-14 00:20:02,769 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-14 00:20:03,094 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:20:03,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012389834] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:20:03,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:20:03,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 41 [2025-04-14 00:20:03,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912356998] [2025-04-14 00:20:03,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:20:03,095 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-14 00:20:03,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:20:03,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-14 00:20:03,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1508, Unknown=0, NotChecked=0, Total=1722 [2025-04-14 00:20:03,096 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:20:03,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 487 transitions, 7406 flow. Second operand has 42 states, 42 states have (on average 5.4523809523809526) internal successors, (229), 42 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:20:03,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:20:03,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:20:03,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:20:04,007 INFO L116 PetriNetUnfolderBase]: 1477/2977 cut-off events. [2025-04-14 00:20:04,007 INFO L117 PetriNetUnfolderBase]: For 123656/123656 co-relation queries the response was YES. [2025-04-14 00:20:04,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27037 conditions, 2977 events. 1477/2977 cut-off events. For 123656/123656 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 21012 event pairs, 191 based on Foata normal form. 4/2979 useless extension candidates. Maximal degree in co-relation 26931. Up to 2894 conditions per place. [2025-04-14 00:20:04,029 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 457 selfloop transitions, 34 changer transitions 9/502 dead transitions. [2025-04-14 00:20:04,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 502 transitions, 8524 flow [2025-04-14 00:20:04,030 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 00:20:04,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-14 00:20:04,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 117 transitions. [2025-04-14 00:20:04,030 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3277310924369748 [2025-04-14 00:20:04,030 INFO L175 Difference]: Start difference. First operand has 222 places, 487 transitions, 7406 flow. Second operand 17 states and 117 transitions. [2025-04-14 00:20:04,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 502 transitions, 8524 flow [2025-04-14 00:20:04,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 502 transitions, 8155 flow, removed 78 selfloop flow, removed 15 redundant places. [2025-04-14 00:20:04,433 INFO L231 Difference]: Finished difference. Result has 225 places, 484 transitions, 7094 flow [2025-04-14 00:20:04,433 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=7045, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=487, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=453, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=7094, PETRI_PLACES=225, PETRI_TRANSITIONS=484} [2025-04-14 00:20:04,434 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 204 predicate places. [2025-04-14 00:20:04,434 INFO L485 AbstractCegarLoop]: Abstraction has has 225 places, 484 transitions, 7094 flow [2025-04-14 00:20:04,434 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 5.4523809523809526) internal successors, (229), 42 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:20:04,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:20:04,434 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:20:04,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2025-04-14 00:20:04,635 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:20:04,635 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:20:04,635 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:20:04,635 INFO L85 PathProgramCache]: Analyzing trace with hash -984533625, now seen corresponding path program 26 times [2025-04-14 00:20:04,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:20:04,636 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154108760] [2025-04-14 00:20:04,636 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:20:04,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:20:04,642 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 00:20:04,650 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:20:04,650 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:20:04,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:04,824 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-14 00:20:04,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:20:04,824 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154108760] [2025-04-14 00:20:04,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154108760] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:20:04,825 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104481080] [2025-04-14 00:20:04,825 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:20:04,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:20:04,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:20:04,826 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:20:04,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-04-14 00:20:04,884 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 00:20:04,900 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:20:04,900 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:20:04,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:04,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-14 00:20:04,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:20:05,128 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:20:05,129 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:20:05,177 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-14 00:20:05,178 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-14 00:20:05,332 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:20:05,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104481080] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:20:05,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:20:05,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 10] total 28 [2025-04-14 00:20:05,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17770806] [2025-04-14 00:20:05,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:20:05,332 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-14 00:20:05,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:20:05,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-14 00:20:05,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2025-04-14 00:20:05,333 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:20:05,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 484 transitions, 7094 flow. Second operand has 29 states, 29 states have (on average 5.827586206896552) internal successors, (169), 29 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:20:05,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:20:05,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:20:05,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:20:06,167 INFO L116 PetriNetUnfolderBase]: 1447/2903 cut-off events. [2025-04-14 00:20:06,167 INFO L117 PetriNetUnfolderBase]: For 99396/99396 co-relation queries the response was YES. [2025-04-14 00:20:06,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25193 conditions, 2903 events. 1447/2903 cut-off events. For 99396/99396 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 20268 event pairs, 172 based on Foata normal form. 15/2916 useless extension candidates. Maximal degree in co-relation 25088. Up to 2535 conditions per place. [2025-04-14 00:20:06,190 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 436 selfloop transitions, 76 changer transitions 15/529 dead transitions. [2025-04-14 00:20:06,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 529 transitions, 8866 flow [2025-04-14 00:20:06,190 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 00:20:06,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-14 00:20:06,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 157 transitions. [2025-04-14 00:20:06,191 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39348370927318294 [2025-04-14 00:20:06,191 INFO L175 Difference]: Start difference. First operand has 225 places, 484 transitions, 7094 flow. Second operand 19 states and 157 transitions. [2025-04-14 00:20:06,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 529 transitions, 8866 flow [2025-04-14 00:20:06,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 529 transitions, 8774 flow, removed 12 selfloop flow, removed 15 redundant places. [2025-04-14 00:20:06,563 INFO L231 Difference]: Finished difference. Result has 227 places, 481 transitions, 7141 flow [2025-04-14 00:20:06,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=6950, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=7141, PETRI_PLACES=227, PETRI_TRANSITIONS=481} [2025-04-14 00:20:06,564 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 206 predicate places. [2025-04-14 00:20:06,564 INFO L485 AbstractCegarLoop]: Abstraction has has 227 places, 481 transitions, 7141 flow [2025-04-14 00:20:06,564 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.827586206896552) internal successors, (169), 29 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:20:06,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:20:06,564 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:20:06,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-04-14 00:20:06,765 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:20:06,765 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:20:06,766 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:20:06,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1808694010, now seen corresponding path program 27 times [2025-04-14 00:20:06,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:20:06,766 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408722321] [2025-04-14 00:20:06,766 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:20:06,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:20:06,773 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-04-14 00:20:06,787 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:20:06,787 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 00:20:06,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:07,210 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:20:07,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:20:07,210 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408722321] [2025-04-14 00:20:07,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408722321] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:20:07,210 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881124432] [2025-04-14 00:20:07,210 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:20:07,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:20:07,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:20:07,212 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:20:07,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-04-14 00:20:07,271 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-04-14 00:20:07,289 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:20:07,289 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 00:20:07,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:07,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-14 00:20:07,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:20:07,595 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:20:07,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:20:07,662 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-14 00:20:07,663 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-14 00:20:07,890 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:20:07,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881124432] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:20:07,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:20:07,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 10] total 35 [2025-04-14 00:20:07,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108831541] [2025-04-14 00:20:07,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:20:07,891 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-14 00:20:07,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:20:07,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-14 00:20:07,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1129, Unknown=0, NotChecked=0, Total=1260 [2025-04-14 00:20:07,892 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:20:07,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 481 transitions, 7141 flow. Second operand has 36 states, 36 states have (on average 5.694444444444445) internal successors, (205), 36 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:20:07,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:20:07,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:20:07,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:20:09,171 INFO L116 PetriNetUnfolderBase]: 1622/3226 cut-off events. [2025-04-14 00:20:09,171 INFO L117 PetriNetUnfolderBase]: For 125464/125464 co-relation queries the response was YES. [2025-04-14 00:20:09,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28139 conditions, 3226 events. 1622/3226 cut-off events. For 125464/125464 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 22846 event pairs, 120 based on Foata normal form. 52/3277 useless extension candidates. Maximal degree in co-relation 28033. Up to 2558 conditions per place. [2025-04-14 00:20:09,195 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 483 selfloop transitions, 132 changer transitions 7/624 dead transitions. [2025-04-14 00:20:09,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 624 transitions, 10027 flow [2025-04-14 00:20:09,195 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-14 00:20:09,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-04-14 00:20:09,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 260 transitions. [2025-04-14 00:20:09,196 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37518037518037517 [2025-04-14 00:20:09,196 INFO L175 Difference]: Start difference. First operand has 227 places, 481 transitions, 7141 flow. Second operand 33 states and 260 transitions. [2025-04-14 00:20:09,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 624 transitions, 10027 flow [2025-04-14 00:20:09,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 624 transitions, 9759 flow, removed 46 selfloop flow, removed 17 redundant places. [2025-04-14 00:20:09,629 INFO L231 Difference]: Finished difference. Result has 246 places, 530 transitions, 7873 flow [2025-04-14 00:20:09,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=6801, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=7873, PETRI_PLACES=246, PETRI_TRANSITIONS=530} [2025-04-14 00:20:09,630 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 225 predicate places. [2025-04-14 00:20:09,630 INFO L485 AbstractCegarLoop]: Abstraction has has 246 places, 530 transitions, 7873 flow [2025-04-14 00:20:09,631 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.694444444444445) internal successors, (205), 36 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:20:09,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:20:09,631 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:20:09,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-04-14 00:20:09,831 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-04-14 00:20:09,832 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:20:09,832 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:20:09,832 INFO L85 PathProgramCache]: Analyzing trace with hash -298768832, now seen corresponding path program 28 times [2025-04-14 00:20:09,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:20:09,832 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362980025] [2025-04-14 00:20:09,832 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:20:09,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:20:09,839 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-14 00:20:09,847 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:20:09,847 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:20:09,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:10,044 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-14 00:20:10,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:20:10,044 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362980025] [2025-04-14 00:20:10,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362980025] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:20:10,044 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563305356] [2025-04-14 00:20:10,044 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:20:10,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:20:10,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:20:10,046 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:20:10,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-04-14 00:20:10,107 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-14 00:20:10,129 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:20:10,129 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:20:10,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:10,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-14 00:20:10,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:20:10,243 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-14 00:20:10,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:20:10,401 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-14 00:20:10,401 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-14 00:20:10,466 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-14 00:20:10,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563305356] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:20:10,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:20:10,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 21 [2025-04-14 00:20:10,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986145942] [2025-04-14 00:20:10,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:20:10,466 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-14 00:20:10,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:20:10,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-14 00:20:10,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2025-04-14 00:20:10,467 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:20:10,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 530 transitions, 7873 flow. Second operand has 22 states, 22 states have (on average 6.2272727272727275) internal successors, (137), 22 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:20:10,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:20:10,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:20:10,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:20:11,570 INFO L116 PetriNetUnfolderBase]: 1607/3219 cut-off events. [2025-04-14 00:20:11,570 INFO L117 PetriNetUnfolderBase]: For 128618/128618 co-relation queries the response was YES. [2025-04-14 00:20:11,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28629 conditions, 3219 events. 1607/3219 cut-off events. For 128618/128618 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 23080 event pairs, 71 based on Foata normal form. 18/3235 useless extension candidates. Maximal degree in co-relation 28518. Up to 1585 conditions per place. [2025-04-14 00:20:11,595 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 585 selfloop transitions, 58 changer transitions 40/685 dead transitions. [2025-04-14 00:20:11,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 685 transitions, 11681 flow [2025-04-14 00:20:11,596 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-14 00:20:11,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-14 00:20:11,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 166 transitions. [2025-04-14 00:20:11,596 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3952380952380952 [2025-04-14 00:20:11,596 INFO L175 Difference]: Start difference. First operand has 246 places, 530 transitions, 7873 flow. Second operand 20 states and 166 transitions. [2025-04-14 00:20:11,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 685 transitions, 11681 flow [2025-04-14 00:20:11,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 685 transitions, 11449 flow, removed 62 selfloop flow, removed 22 redundant places. [2025-04-14 00:20:11,965 INFO L231 Difference]: Finished difference. Result has 244 places, 532 transitions, 8192 flow [2025-04-14 00:20:11,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=7674, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=8192, PETRI_PLACES=244, PETRI_TRANSITIONS=532} [2025-04-14 00:20:11,965 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 223 predicate places. [2025-04-14 00:20:11,965 INFO L485 AbstractCegarLoop]: Abstraction has has 244 places, 532 transitions, 8192 flow [2025-04-14 00:20:11,966 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.2272727272727275) internal successors, (137), 22 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:20:11,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:20:11,966 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:20:11,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2025-04-14 00:20:12,166 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-04-14 00:20:12,166 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:20:12,167 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:20:12,167 INFO L85 PathProgramCache]: Analyzing trace with hash 931159518, now seen corresponding path program 29 times [2025-04-14 00:20:12,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:20:12,167 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639220604] [2025-04-14 00:20:12,167 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:20:12,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:20:12,172 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 3 equivalence classes. [2025-04-14 00:20:12,192 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:20:12,192 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 00:20:12,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:12,507 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-14 00:20:12,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:20:12,507 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639220604] [2025-04-14 00:20:12,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639220604] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:20:12,508 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707629268] [2025-04-14 00:20:12,508 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:20:12,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:20:12,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:20:12,510 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:20:12,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-04-14 00:20:12,579 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 3 equivalence classes. [2025-04-14 00:20:12,611 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:20:12,611 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 00:20:12,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:12,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-14 00:20:12,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:20:12,712 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-14 00:20:12,713 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:20:12,756 INFO L325 Elim1Store]: treesize reduction 24, result has 68.8 percent of original size [2025-04-14 00:20:12,756 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 71 [2025-04-14 00:20:12,781 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-14 00:20:12,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707629268] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:20:12,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:20:12,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 5] total 14 [2025-04-14 00:20:12,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373667682] [2025-04-14 00:20:12,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:20:12,782 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-14 00:20:12,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:20:12,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-14 00:20:12,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-04-14 00:20:12,783 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:20:12,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 532 transitions, 8192 flow. Second operand has 15 states, 15 states have (on average 6.533333333333333) internal successors, (98), 15 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:20:12,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:20:12,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:20:12,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:20:13,605 INFO L116 PetriNetUnfolderBase]: 1616/3199 cut-off events. [2025-04-14 00:20:13,606 INFO L117 PetriNetUnfolderBase]: For 135454/135454 co-relation queries the response was YES. [2025-04-14 00:20:13,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28609 conditions, 3199 events. 1616/3199 cut-off events. For 135454/135454 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 22280 event pairs, 103 based on Foata normal form. 48/3245 useless extension candidates. Maximal degree in co-relation 28499. Up to 2650 conditions per place. [2025-04-14 00:20:13,631 INFO L140 encePairwiseOnDemand]: 14/21 looper letters, 480 selfloop transitions, 119 changer transitions 2/603 dead transitions. [2025-04-14 00:20:13,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 603 transitions, 10468 flow [2025-04-14 00:20:13,632 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 00:20:13,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-14 00:20:13,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 147 transitions. [2025-04-14 00:20:13,632 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4375 [2025-04-14 00:20:13,632 INFO L175 Difference]: Start difference. First operand has 244 places, 532 transitions, 8192 flow. Second operand 16 states and 147 transitions. [2025-04-14 00:20:13,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 603 transitions, 10468 flow [2025-04-14 00:20:14,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 603 transitions, 9810 flow, removed 296 selfloop flow, removed 8 redundant places. [2025-04-14 00:20:14,129 INFO L231 Difference]: Finished difference. Result has 251 places, 544 transitions, 8136 flow [2025-04-14 00:20:14,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=7520, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=8136, PETRI_PLACES=251, PETRI_TRANSITIONS=544} [2025-04-14 00:20:14,131 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 230 predicate places. [2025-04-14 00:20:14,131 INFO L485 AbstractCegarLoop]: Abstraction has has 251 places, 544 transitions, 8136 flow [2025-04-14 00:20:14,131 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.533333333333333) internal successors, (98), 15 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:20:14,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:20:14,131 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:20:14,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2025-04-14 00:20:14,332 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:20:14,332 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:20:14,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:20:14,333 INFO L85 PathProgramCache]: Analyzing trace with hash 907896960, now seen corresponding path program 30 times [2025-04-14 00:20:14,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:20:14,333 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078686781] [2025-04-14 00:20:14,333 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:20:14,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:20:14,340 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 3 equivalence classes. [2025-04-14 00:20:14,349 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:20:14,349 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:20:14,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:14,552 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-14 00:20:14,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:20:14,552 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078686781] [2025-04-14 00:20:14,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078686781] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:20:14,552 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720828062] [2025-04-14 00:20:14,552 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:20:14,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:20:14,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:20:14,554 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:20:14,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-04-14 00:20:14,624 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 3 equivalence classes. [2025-04-14 00:20:14,641 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:20:14,641 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:20:14,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:14,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 00:20:14,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:20:14,764 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-14 00:20:14,765 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:20:14,839 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-14 00:20:14,839 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-14 00:20:14,896 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-14 00:20:14,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720828062] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:20:14,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:20:14,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 6] total 18 [2025-04-14 00:20:14,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989858925] [2025-04-14 00:20:14,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:20:14,897 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-14 00:20:14,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:20:14,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-14 00:20:14,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-04-14 00:20:14,898 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:20:14,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 544 transitions, 8136 flow. Second operand has 19 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 19 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:20:14,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:20:14,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:20:14,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:20:15,880 INFO L116 PetriNetUnfolderBase]: 1695/3322 cut-off events. [2025-04-14 00:20:15,881 INFO L117 PetriNetUnfolderBase]: For 141977/141977 co-relation queries the response was YES. [2025-04-14 00:20:15,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29543 conditions, 3322 events. 1695/3322 cut-off events. For 141977/141977 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 23078 event pairs, 73 based on Foata normal form. 80/3398 useless extension candidates. Maximal degree in co-relation 29428. Up to 2403 conditions per place. [2025-04-14 00:20:15,911 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 489 selfloop transitions, 159 changer transitions 3/653 dead transitions. [2025-04-14 00:20:15,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 653 transitions, 11140 flow [2025-04-14 00:20:15,912 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 00:20:15,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-14 00:20:15,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 168 transitions. [2025-04-14 00:20:15,913 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-04-14 00:20:15,913 INFO L175 Difference]: Start difference. First operand has 251 places, 544 transitions, 8136 flow. Second operand 18 states and 168 transitions. [2025-04-14 00:20:15,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 653 transitions, 11140 flow [2025-04-14 00:20:16,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 653 transitions, 10993 flow, removed 40 selfloop flow, removed 7 redundant places. [2025-04-14 00:20:16,368 INFO L231 Difference]: Finished difference. Result has 264 places, 562 transitions, 8741 flow [2025-04-14 00:20:16,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=7882, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=8741, PETRI_PLACES=264, PETRI_TRANSITIONS=562} [2025-04-14 00:20:16,369 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 243 predicate places. [2025-04-14 00:20:16,369 INFO L485 AbstractCegarLoop]: Abstraction has has 264 places, 562 transitions, 8741 flow [2025-04-14 00:20:16,369 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 19 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:20:16,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:20:16,369 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:20:16,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2025-04-14 00:20:16,569 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-04-14 00:20:16,570 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:20:16,570 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:20:16,570 INFO L85 PathProgramCache]: Analyzing trace with hash -558426039, now seen corresponding path program 31 times [2025-04-14 00:20:16,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:20:16,571 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394095592] [2025-04-14 00:20:16,571 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:20:16,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:20:16,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 00:20:16,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:20:16,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:20:16,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:17,064 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:20:17,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:20:17,064 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394095592] [2025-04-14 00:20:17,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394095592] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:20:17,064 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901742930] [2025-04-14 00:20:17,064 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:20:17,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:20:17,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:20:17,067 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:20:17,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-04-14 00:20:17,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 00:20:17,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:20:17,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:20:17,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:17,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 00:20:17,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:20:17,418 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:20:17,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:20:17,498 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-14 00:20:17,498 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-14 00:20:17,855 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:20:17,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901742930] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:20:17,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:20:17,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 41 [2025-04-14 00:20:17,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989684462] [2025-04-14 00:20:17,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:20:17,855 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-14 00:20:17,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:20:17,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-14 00:20:17,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1507, Unknown=0, NotChecked=0, Total=1722 [2025-04-14 00:20:17,856 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:20:17,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 562 transitions, 8741 flow. Second operand has 42 states, 42 states have (on average 5.5) internal successors, (231), 42 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:20:17,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:20:17,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:20:17,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:20:18,871 INFO L116 PetriNetUnfolderBase]: 1678/3291 cut-off events. [2025-04-14 00:20:18,871 INFO L117 PetriNetUnfolderBase]: For 142646/142646 co-relation queries the response was YES. [2025-04-14 00:20:18,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30189 conditions, 3291 events. 1678/3291 cut-off events. For 142646/142646 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 22781 event pairs, 162 based on Foata normal form. 6/3293 useless extension candidates. Maximal degree in co-relation 30072. Up to 3212 conditions per place. [2025-04-14 00:20:18,896 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 532 selfloop transitions, 34 changer transitions 8/576 dead transitions. [2025-04-14 00:20:18,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 576 transitions, 9988 flow [2025-04-14 00:20:18,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 00:20:18,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-14 00:20:18,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 116 transitions. [2025-04-14 00:20:18,897 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32492997198879553 [2025-04-14 00:20:18,897 INFO L175 Difference]: Start difference. First operand has 264 places, 562 transitions, 8741 flow. Second operand 17 states and 116 transitions. [2025-04-14 00:20:18,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 576 transitions, 9988 flow [2025-04-14 00:20:19,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 576 transitions, 9748 flow, removed 65 selfloop flow, removed 8 redundant places. [2025-04-14 00:20:19,431 INFO L231 Difference]: Finished difference. Result has 274 places, 559 transitions, 8540 flow [2025-04-14 00:20:19,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=8476, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=526, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=8540, PETRI_PLACES=274, PETRI_TRANSITIONS=559} [2025-04-14 00:20:19,433 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 253 predicate places. [2025-04-14 00:20:19,433 INFO L485 AbstractCegarLoop]: Abstraction has has 274 places, 559 transitions, 8540 flow [2025-04-14 00:20:19,433 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 5.5) internal successors, (231), 42 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:20:19,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:20:19,433 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:20:19,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2025-04-14 00:20:19,633 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-04-14 00:20:19,634 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:20:19,634 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:20:19,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1895073310, now seen corresponding path program 32 times [2025-04-14 00:20:19,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:20:19,634 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415678112] [2025-04-14 00:20:19,635 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:20:19,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:20:19,640 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 00:20:19,647 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:20:19,647 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:20:19,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:19,879 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:20:19,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:20:19,879 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415678112] [2025-04-14 00:20:19,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415678112] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:20:19,879 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37545933] [2025-04-14 00:20:19,879 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:20:19,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:20:19,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:20:19,881 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:20:19,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-04-14 00:20:19,947 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 00:20:19,966 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:20:19,966 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:20:19,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:19,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-14 00:20:19,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:20:20,153 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:20:20,153 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:20:20,207 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-14 00:20:20,208 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-14 00:20:20,436 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:20:20,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37545933] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:20:20,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:20:20,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 28 [2025-04-14 00:20:20,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223866911] [2025-04-14 00:20:20,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:20:20,436 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-14 00:20:20,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:20:20,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-14 00:20:20,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2025-04-14 00:20:20,437 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:20:20,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 559 transitions, 8540 flow. Second operand has 29 states, 29 states have (on average 5.620689655172414) internal successors, (163), 29 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:20:20,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:20:20,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:20:20,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:20:21,264 INFO L116 PetriNetUnfolderBase]: 1679/3285 cut-off events. [2025-04-14 00:20:21,265 INFO L117 PetriNetUnfolderBase]: For 147911/147911 co-relation queries the response was YES. [2025-04-14 00:20:21,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29991 conditions, 3285 events. 1679/3285 cut-off events. For 147911/147911 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 22719 event pairs, 125 based on Foata normal form. 5/3286 useless extension candidates. Maximal degree in co-relation 29879. Up to 3068 conditions per place. [2025-04-14 00:20:21,290 INFO L140 encePairwiseOnDemand]: 14/21 looper letters, 534 selfloop transitions, 45 changer transitions 1/582 dead transitions. [2025-04-14 00:20:21,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 582 transitions, 9993 flow [2025-04-14 00:20:21,290 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 00:20:21,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 00:20:21,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 111 transitions. [2025-04-14 00:20:21,291 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3523809523809524 [2025-04-14 00:20:21,291 INFO L175 Difference]: Start difference. First operand has 274 places, 559 transitions, 8540 flow. Second operand 15 states and 111 transitions. [2025-04-14 00:20:21,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 582 transitions, 9993 flow [2025-04-14 00:20:21,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 582 transitions, 9883 flow, removed 21 selfloop flow, removed 15 redundant places. [2025-04-14 00:20:21,832 INFO L231 Difference]: Finished difference. Result has 272 places, 560 transitions, 8556 flow [2025-04-14 00:20:21,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=8430, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=514, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=8556, PETRI_PLACES=272, PETRI_TRANSITIONS=560} [2025-04-14 00:20:21,833 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 251 predicate places. [2025-04-14 00:20:21,833 INFO L485 AbstractCegarLoop]: Abstraction has has 272 places, 560 transitions, 8556 flow [2025-04-14 00:20:21,833 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.620689655172414) internal successors, (163), 29 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:20:21,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:20:21,833 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:20:21,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2025-04-14 00:20:22,033 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-04-14 00:20:22,034 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:20:22,034 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:20:22,034 INFO L85 PathProgramCache]: Analyzing trace with hash -624063629, now seen corresponding path program 33 times [2025-04-14 00:20:22,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:20:22,035 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939950161] [2025-04-14 00:20:22,035 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:20:22,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:20:22,041 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-04-14 00:20:22,051 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:20:22,052 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 00:20:22,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:22,210 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-14 00:20:22,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:20:22,210 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939950161] [2025-04-14 00:20:22,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939950161] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:20:22,210 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364560490] [2025-04-14 00:20:22,210 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:20:22,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:20:22,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:20:22,212 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:20:22,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-04-14 00:20:22,285 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-04-14 00:20:22,305 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:20:22,305 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 00:20:22,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:22,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 00:20:22,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:20:22,405 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-14 00:20:22,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:20:22,452 INFO L325 Elim1Store]: treesize reduction 24, result has 68.8 percent of original size [2025-04-14 00:20:22,452 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 71 [2025-04-14 00:20:22,495 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-14 00:20:22,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364560490] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:20:22,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:20:22,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 5] total 16 [2025-04-14 00:20:22,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863662381] [2025-04-14 00:20:22,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:20:22,496 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-14 00:20:22,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:20:22,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-14 00:20:22,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-04-14 00:20:22,496 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:20:22,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 560 transitions, 8556 flow. Second operand has 17 states, 17 states have (on average 6.352941176470588) internal successors, (108), 17 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:20:22,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:20:22,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:20:22,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:20:23,513 INFO L116 PetriNetUnfolderBase]: 1742/3405 cut-off events. [2025-04-14 00:20:23,514 INFO L117 PetriNetUnfolderBase]: For 157559/157559 co-relation queries the response was YES. [2025-04-14 00:20:23,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30981 conditions, 3405 events. 1742/3405 cut-off events. For 157559/157559 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 23728 event pairs, 162 based on Foata normal form. 36/3439 useless extension candidates. Maximal degree in co-relation 30860. Up to 3105 conditions per place. [2025-04-14 00:20:23,541 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 557 selfloop transitions, 75 changer transitions 4/638 dead transitions. [2025-04-14 00:20:23,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 638 transitions, 10733 flow [2025-04-14 00:20:23,542 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-14 00:20:23,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-14 00:20:23,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 197 transitions. [2025-04-14 00:20:23,542 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4264069264069264 [2025-04-14 00:20:23,542 INFO L175 Difference]: Start difference. First operand has 272 places, 560 transitions, 8556 flow. Second operand 22 states and 197 transitions. [2025-04-14 00:20:23,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 638 transitions, 10733 flow [2025-04-14 00:20:24,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 638 transitions, 10633 flow, removed 6 selfloop flow, removed 13 redundant places. [2025-04-14 00:20:24,059 INFO L231 Difference]: Finished difference. Result has 289 places, 586 transitions, 9008 flow [2025-04-14 00:20:24,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=8456, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=509, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=9008, PETRI_PLACES=289, PETRI_TRANSITIONS=586} [2025-04-14 00:20:24,060 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 268 predicate places. [2025-04-14 00:20:24,060 INFO L485 AbstractCegarLoop]: Abstraction has has 289 places, 586 transitions, 9008 flow [2025-04-14 00:20:24,060 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.352941176470588) internal successors, (108), 17 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:20:24,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:20:24,060 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:20:24,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2025-04-14 00:20:24,261 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:20:24,261 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:20:24,261 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:20:24,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1859725359, now seen corresponding path program 34 times [2025-04-14 00:20:24,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:20:24,262 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82569412] [2025-04-14 00:20:24,262 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:20:24,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:20:24,268 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-14 00:20:24,273 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:20:24,274 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:20:24,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:24,447 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-14 00:20:24,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:20:24,447 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82569412] [2025-04-14 00:20:24,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82569412] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:20:24,447 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842576266] [2025-04-14 00:20:24,447 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:20:24,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:20:24,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:20:24,449 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:20:24,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-04-14 00:20:24,523 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-14 00:20:24,543 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:20:24,544 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:20:24,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:24,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-14 00:20:24,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:20:24,783 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-14 00:20:24,783 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:20:24,833 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-14 00:20:24,834 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-14 00:20:24,878 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-14 00:20:24,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842576266] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:20:24,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:20:24,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 7] total 22 [2025-04-14 00:20:24,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712745120] [2025-04-14 00:20:24,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:20:24,879 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-14 00:20:24,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:20:24,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-14 00:20:24,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2025-04-14 00:20:24,879 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:20:24,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 586 transitions, 9008 flow. Second operand has 23 states, 23 states have (on average 6.130434782608695) internal successors, (141), 23 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:20:24,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:20:24,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:20:24,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:20:25,944 INFO L116 PetriNetUnfolderBase]: 1777/3452 cut-off events. [2025-04-14 00:20:25,945 INFO L117 PetriNetUnfolderBase]: For 193489/193489 co-relation queries the response was YES. [2025-04-14 00:20:25,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33001 conditions, 3452 events. 1777/3452 cut-off events. For 193489/193489 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 23936 event pairs, 162 based on Foata normal form. 52/3502 useless extension candidates. Maximal degree in co-relation 32873. Up to 3045 conditions per place. [2025-04-14 00:20:25,977 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 528 selfloop transitions, 100 changer transitions 8/638 dead transitions. [2025-04-14 00:20:25,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 638 transitions, 11599 flow [2025-04-14 00:20:25,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 00:20:25,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-14 00:20:25,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 140 transitions. [2025-04-14 00:20:25,978 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39215686274509803 [2025-04-14 00:20:25,979 INFO L175 Difference]: Start difference. First operand has 289 places, 586 transitions, 9008 flow. Second operand 17 states and 140 transitions. [2025-04-14 00:20:25,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 638 transitions, 11599 flow [2025-04-14 00:20:26,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 638 transitions, 11342 flow, removed 60 selfloop flow, removed 16 redundant places. [2025-04-14 00:20:26,682 INFO L231 Difference]: Finished difference. Result has 289 places, 587 transitions, 9287 flow [2025-04-14 00:20:26,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=8657, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=487, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=9287, PETRI_PLACES=289, PETRI_TRANSITIONS=587} [2025-04-14 00:20:26,683 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 268 predicate places. [2025-04-14 00:20:26,683 INFO L485 AbstractCegarLoop]: Abstraction has has 289 places, 587 transitions, 9287 flow [2025-04-14 00:20:26,683 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.130434782608695) internal successors, (141), 23 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:20:26,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:20:26,683 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:20:26,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2025-04-14 00:20:26,883 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:20:26,884 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:20:26,884 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:20:26,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1772817816, now seen corresponding path program 35 times [2025-04-14 00:20:26,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:20:26,884 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140494509] [2025-04-14 00:20:26,884 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:20:26,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:20:26,890 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 3 equivalence classes. [2025-04-14 00:20:26,894 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:20:26,895 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 00:20:26,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:26,944 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-14 00:20:26,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:20:26,945 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140494509] [2025-04-14 00:20:26,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140494509] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:20:26,945 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496978915] [2025-04-14 00:20:26,945 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:20:26,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:20:26,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:20:26,947 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:20:26,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-04-14 00:20:27,017 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 3 equivalence classes. [2025-04-14 00:20:27,041 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:20:27,041 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 00:20:27,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:27,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-14 00:20:27,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:20:27,112 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-14 00:20:27,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:20:27,136 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-14 00:20:27,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496978915] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:20:27,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:20:27,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 4] total 11 [2025-04-14 00:20:27,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749209260] [2025-04-14 00:20:27,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:20:27,137 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-14 00:20:27,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:20:27,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-14 00:20:27,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-04-14 00:20:27,137 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:20:27,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 587 transitions, 9287 flow. Second operand has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:20:27,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:20:27,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:20:27,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:20:28,159 INFO L116 PetriNetUnfolderBase]: 2045/3984 cut-off events. [2025-04-14 00:20:28,160 INFO L117 PetriNetUnfolderBase]: For 295559/295559 co-relation queries the response was YES. [2025-04-14 00:20:28,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42469 conditions, 3984 events. 2045/3984 cut-off events. For 295559/295559 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 28490 event pairs, 133 based on Foata normal form. 6/3980 useless extension candidates. Maximal degree in co-relation 42342. Up to 2259 conditions per place. [2025-04-14 00:20:28,193 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 413 selfloop transitions, 280 changer transitions 4/699 dead transitions. [2025-04-14 00:20:28,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 699 transitions, 13098 flow [2025-04-14 00:20:28,193 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 00:20:28,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 00:20:28,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 133 transitions. [2025-04-14 00:20:28,194 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48717948717948717 [2025-04-14 00:20:28,194 INFO L175 Difference]: Start difference. First operand has 289 places, 587 transitions, 9287 flow. Second operand 13 states and 133 transitions. [2025-04-14 00:20:28,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 699 transitions, 13098 flow [2025-04-14 00:20:28,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 699 transitions, 12582 flow, removed 173 selfloop flow, removed 14 redundant places. [2025-04-14 00:20:28,964 INFO L231 Difference]: Finished difference. Result has 291 places, 646 transitions, 11043 flow [2025-04-14 00:20:28,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=8835, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=238, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=11043, PETRI_PLACES=291, PETRI_TRANSITIONS=646} [2025-04-14 00:20:28,965 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 270 predicate places. [2025-04-14 00:20:28,965 INFO L485 AbstractCegarLoop]: Abstraction has has 291 places, 646 transitions, 11043 flow [2025-04-14 00:20:28,965 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:20:28,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:20:28,966 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:20:28,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2025-04-14 00:20:29,166 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2025-04-14 00:20:29,166 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:20:29,167 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:20:29,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1194348985, now seen corresponding path program 36 times [2025-04-14 00:20:29,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:20:29,167 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166115457] [2025-04-14 00:20:29,167 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:20:29,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:20:29,173 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 4 equivalence classes. [2025-04-14 00:20:29,182 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:20:29,183 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-14 00:20:29,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:29,307 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-14 00:20:29,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:20:29,307 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166115457] [2025-04-14 00:20:29,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166115457] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:20:29,308 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322405774] [2025-04-14 00:20:29,308 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:20:29,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:20:29,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:20:29,311 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:20:29,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-04-14 00:20:29,389 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 4 equivalence classes. [2025-04-14 00:20:29,469 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:20:29,469 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-14 00:20:29,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:29,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 00:20:29,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:20:29,597 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-14 00:20:29,597 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:20:29,690 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-14 00:20:29,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322405774] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:20:29,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:20:29,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-04-14 00:20:29,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065939198] [2025-04-14 00:20:29,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:20:29,691 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-14 00:20:29,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:20:29,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-14 00:20:29,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=355, Unknown=0, NotChecked=0, Total=506 [2025-04-14 00:20:29,691 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:20:29,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 646 transitions, 11043 flow. Second operand has 23 states, 23 states have (on average 6.173913043478261) internal successors, (142), 23 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:20:29,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:20:29,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:20:29,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:20:30,991 INFO L116 PetriNetUnfolderBase]: 2190/4451 cut-off events. [2025-04-14 00:20:30,991 INFO L117 PetriNetUnfolderBase]: For 327050/327050 co-relation queries the response was YES. [2025-04-14 00:20:31,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49361 conditions, 4451 events. 2190/4451 cut-off events. For 327050/327050 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 33207 event pairs, 772 based on Foata normal form. 222/4659 useless extension candidates. Maximal degree in co-relation 49231. Up to 3012 conditions per place. [2025-04-14 00:20:31,038 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 596 selfloop transitions, 72 changer transitions 99/769 dead transitions. [2025-04-14 00:20:31,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 769 transitions, 14871 flow [2025-04-14 00:20:31,039 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 00:20:31,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 00:20:31,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 94 transitions. [2025-04-14 00:20:31,039 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44761904761904764 [2025-04-14 00:20:31,039 INFO L175 Difference]: Start difference. First operand has 291 places, 646 transitions, 11043 flow. Second operand 10 states and 94 transitions. [2025-04-14 00:20:31,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 769 transitions, 14871 flow [2025-04-14 00:20:32,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 769 transitions, 14352 flow, removed 237 selfloop flow, removed 8 redundant places. [2025-04-14 00:20:32,189 INFO L231 Difference]: Finished difference. Result has 293 places, 566 transitions, 9932 flow [2025-04-14 00:20:32,189 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=9116, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=477, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9932, PETRI_PLACES=293, PETRI_TRANSITIONS=566} [2025-04-14 00:20:32,190 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 272 predicate places. [2025-04-14 00:20:32,190 INFO L485 AbstractCegarLoop]: Abstraction has has 293 places, 566 transitions, 9932 flow [2025-04-14 00:20:32,190 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.173913043478261) internal successors, (142), 23 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:20:32,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:20:32,190 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:20:32,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2025-04-14 00:20:32,391 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2025-04-14 00:20:32,391 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:20:32,391 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:20:32,392 INFO L85 PathProgramCache]: Analyzing trace with hash -84379886, now seen corresponding path program 37 times [2025-04-14 00:20:32,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:20:32,392 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507860427] [2025-04-14 00:20:32,392 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:20:32,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:20:32,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 00:20:32,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:20:32,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:20:32,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:32,463 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-14 00:20:32,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:20:32,464 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507860427] [2025-04-14 00:20:32,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507860427] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:20:32,464 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272905692] [2025-04-14 00:20:32,464 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:20:32,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:20:32,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:20:32,466 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:20:32,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2025-04-14 00:20:32,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 00:20:32,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:20:32,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:20:32,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:32,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-14 00:20:32,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:20:32,666 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-14 00:20:32,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:20:32,683 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-14 00:20:32,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272905692] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:20:32,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:20:32,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 4] total 11 [2025-04-14 00:20:32,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788156762] [2025-04-14 00:20:32,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:20:32,683 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-14 00:20:32,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:20:32,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-14 00:20:32,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-04-14 00:20:32,684 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:20:32,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 566 transitions, 9932 flow. Second operand has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:20:32,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:20:32,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:20:32,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:20:33,883 INFO L116 PetriNetUnfolderBase]: 2225/4527 cut-off events. [2025-04-14 00:20:33,883 INFO L117 PetriNetUnfolderBase]: For 350887/350887 co-relation queries the response was YES. [2025-04-14 00:20:33,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52276 conditions, 4527 events. 2225/4527 cut-off events. For 350887/350887 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 34162 event pairs, 199 based on Foata normal form. 7/4531 useless extension candidates. Maximal degree in co-relation 52142. Up to 3616 conditions per place. [2025-04-14 00:20:33,923 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 491 selfloop transitions, 153 changer transitions 7/653 dead transitions. [2025-04-14 00:20:33,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 653 transitions, 13505 flow [2025-04-14 00:20:33,924 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 00:20:33,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 00:20:33,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 132 transitions. [2025-04-14 00:20:33,924 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4835164835164835 [2025-04-14 00:20:33,924 INFO L175 Difference]: Start difference. First operand has 293 places, 566 transitions, 9932 flow. Second operand 13 states and 132 transitions. [2025-04-14 00:20:33,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 653 transitions, 13505 flow [2025-04-14 00:20:35,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 653 transitions, 13374 flow, removed 59 selfloop flow, removed 7 redundant places. [2025-04-14 00:20:35,190 INFO L231 Difference]: Finished difference. Result has 302 places, 604 transitions, 11311 flow [2025-04-14 00:20:35,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=9813, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=11311, PETRI_PLACES=302, PETRI_TRANSITIONS=604} [2025-04-14 00:20:35,190 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 281 predicate places. [2025-04-14 00:20:35,191 INFO L485 AbstractCegarLoop]: Abstraction has has 302 places, 604 transitions, 11311 flow [2025-04-14 00:20:35,191 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:20:35,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:20:35,191 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:20:35,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2025-04-14 00:20:35,391 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2025-04-14 00:20:35,391 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:20:35,392 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:20:35,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1628244076, now seen corresponding path program 38 times [2025-04-14 00:20:35,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:20:35,392 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426612070] [2025-04-14 00:20:35,392 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:20:35,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:20:35,399 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 00:20:35,404 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:20:35,404 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:20:35,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:35,563 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:20:35,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:20:35,563 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426612070] [2025-04-14 00:20:35,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426612070] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:20:35,563 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247673874] [2025-04-14 00:20:35,563 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:20:35,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:20:35,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:20:35,565 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:20:35,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2025-04-14 00:20:35,644 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 00:20:35,661 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:20:35,661 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:20:35,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:35,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-14 00:20:35,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:20:35,745 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-14 00:20:35,746 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:20:35,775 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-14 00:20:35,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247673874] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:20:35,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:20:35,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 4] total 18 [2025-04-14 00:20:35,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670733941] [2025-04-14 00:20:35,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:20:35,776 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-14 00:20:35,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:20:35,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-14 00:20:35,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2025-04-14 00:20:35,777 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:20:35,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 604 transitions, 11311 flow. Second operand has 20 states, 20 states have (on average 6.75) internal successors, (135), 20 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:20:35,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:20:35,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:20:35,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:20:37,236 INFO L116 PetriNetUnfolderBase]: 2458/5006 cut-off events. [2025-04-14 00:20:37,237 INFO L117 PetriNetUnfolderBase]: For 423700/423700 co-relation queries the response was YES. [2025-04-14 00:20:37,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61818 conditions, 5006 events. 2458/5006 cut-off events. For 423700/423700 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 39250 event pairs, 238 based on Foata normal form. 10/5014 useless extension candidates. Maximal degree in co-relation 61682. Up to 4277 conditions per place. [2025-04-14 00:20:37,297 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 572 selfloop transitions, 135 changer transitions 8/717 dead transitions. [2025-04-14 00:20:37,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 717 transitions, 15536 flow [2025-04-14 00:20:37,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-14 00:20:37,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-14 00:20:37,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 186 transitions. [2025-04-14 00:20:37,299 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4217687074829932 [2025-04-14 00:20:37,299 INFO L175 Difference]: Start difference. First operand has 302 places, 604 transitions, 11311 flow. Second operand 21 states and 186 transitions. [2025-04-14 00:20:37,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 717 transitions, 15536 flow [2025-04-14 00:20:38,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 717 transitions, 15123 flow, removed 192 selfloop flow, removed 4 redundant places. [2025-04-14 00:20:38,797 INFO L231 Difference]: Finished difference. Result has 324 places, 660 transitions, 12684 flow [2025-04-14 00:20:38,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=10646, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=12684, PETRI_PLACES=324, PETRI_TRANSITIONS=660} [2025-04-14 00:20:38,798 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 303 predicate places. [2025-04-14 00:20:38,798 INFO L485 AbstractCegarLoop]: Abstraction has has 324 places, 660 transitions, 12684 flow [2025-04-14 00:20:38,798 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.75) internal successors, (135), 20 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:20:38,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:20:38,798 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:20:38,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2025-04-14 00:20:38,999 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2025-04-14 00:20:38,999 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:20:39,000 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:20:39,000 INFO L85 PathProgramCache]: Analyzing trace with hash 309759881, now seen corresponding path program 39 times [2025-04-14 00:20:39,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:20:39,000 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352670341] [2025-04-14 00:20:39,000 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:20:39,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:20:39,007 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-04-14 00:20:39,016 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:20:39,017 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 00:20:39,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:39,104 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-14 00:20:39,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:20:39,104 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352670341] [2025-04-14 00:20:39,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352670341] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:20:39,104 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354374027] [2025-04-14 00:20:39,104 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:20:39,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:20:39,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:20:39,106 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:20:39,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2025-04-14 00:20:39,181 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-04-14 00:20:39,200 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:20:39,200 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 00:20:39,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:39,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 00:20:39,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:20:39,304 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-14 00:20:39,304 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:20:39,389 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-14 00:20:39,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354374027] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:20:39,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:20:39,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2025-04-14 00:20:39,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755883263] [2025-04-14 00:20:39,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:20:39,389 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-14 00:20:39,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:20:39,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-14 00:20:39,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2025-04-14 00:20:39,390 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:20:39,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 660 transitions, 12684 flow. Second operand has 25 states, 25 states have (on average 5.92) internal successors, (148), 25 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:20:39,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:20:39,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:20:39,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:20:41,619 INFO L116 PetriNetUnfolderBase]: 3465/7294 cut-off events. [2025-04-14 00:20:41,619 INFO L117 PetriNetUnfolderBase]: For 662340/662340 co-relation queries the response was YES. [2025-04-14 00:20:41,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93420 conditions, 7294 events. 3465/7294 cut-off events. For 662340/662340 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 63244 event pairs, 375 based on Foata normal form. 294/7586 useless extension candidates. Maximal degree in co-relation 93275. Up to 4640 conditions per place. [2025-04-14 00:20:41,693 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 724 selfloop transitions, 118 changer transitions 120/964 dead transitions. [2025-04-14 00:20:41,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 964 transitions, 20831 flow [2025-04-14 00:20:41,694 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 00:20:41,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 00:20:41,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 106 transitions. [2025-04-14 00:20:41,695 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42063492063492064 [2025-04-14 00:20:41,695 INFO L175 Difference]: Start difference. First operand has 324 places, 660 transitions, 12684 flow. Second operand 12 states and 106 transitions. [2025-04-14 00:20:41,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 964 transitions, 20831 flow [2025-04-14 00:20:44,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 964 transitions, 19682 flow, removed 553 selfloop flow, removed 7 redundant places. [2025-04-14 00:20:44,565 INFO L231 Difference]: Finished difference. Result has 332 places, 731 transitions, 14255 flow [2025-04-14 00:20:44,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=12000, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=660, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=14255, PETRI_PLACES=332, PETRI_TRANSITIONS=731} [2025-04-14 00:20:44,566 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 311 predicate places. [2025-04-14 00:20:44,566 INFO L485 AbstractCegarLoop]: Abstraction has has 332 places, 731 transitions, 14255 flow [2025-04-14 00:20:44,566 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.92) internal successors, (148), 25 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:20:44,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:20:44,567 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:20:44,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2025-04-14 00:20:44,767 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:20:44,767 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:20:44,768 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:20:44,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1630053480, now seen corresponding path program 40 times [2025-04-14 00:20:44,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:20:44,768 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690262703] [2025-04-14 00:20:44,768 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:20:44,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:20:44,775 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-14 00:20:44,779 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:20:44,779 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:20:44,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:44,850 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-14 00:20:44,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:20:44,850 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690262703] [2025-04-14 00:20:44,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690262703] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:20:44,850 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394638184] [2025-04-14 00:20:44,850 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:20:44,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:20:44,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:20:44,853 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:20:44,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2025-04-14 00:20:44,937 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-14 00:20:44,967 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:20:44,968 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:20:44,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:44,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 00:20:44,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:20:45,075 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-14 00:20:45,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:20:45,134 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-14 00:20:45,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394638184] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:20:45,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:20:45,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-04-14 00:20:45,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102572383] [2025-04-14 00:20:45,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:20:45,135 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-14 00:20:45,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:20:45,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-14 00:20:45,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2025-04-14 00:20:45,135 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:20:45,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 731 transitions, 14255 flow. Second operand has 22 states, 22 states have (on average 6.0) internal successors, (132), 22 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:20:45,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:20:45,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:20:45,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:20:46,671 INFO L116 PetriNetUnfolderBase]: 2599/5469 cut-off events. [2025-04-14 00:20:46,671 INFO L117 PetriNetUnfolderBase]: For 484072/484072 co-relation queries the response was YES. [2025-04-14 00:20:46,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67296 conditions, 5469 events. 2599/5469 cut-off events. For 484072/484072 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 44447 event pairs, 1151 based on Foata normal form. 138/5605 useless extension candidates. Maximal degree in co-relation 67148. Up to 4673 conditions per place. [2025-04-14 00:20:46,829 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 602 selfloop transitions, 5 changer transitions 133/742 dead transitions. [2025-04-14 00:20:46,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 742 transitions, 15915 flow [2025-04-14 00:20:46,830 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 00:20:46,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 00:20:46,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions. [2025-04-14 00:20:46,830 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39826839826839827 [2025-04-14 00:20:46,831 INFO L175 Difference]: Start difference. First operand has 332 places, 731 transitions, 14255 flow. Second operand 11 states and 92 transitions. [2025-04-14 00:20:46,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 742 transitions, 15915 flow [2025-04-14 00:20:48,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 742 transitions, 15500 flow, removed 190 selfloop flow, removed 6 redundant places. [2025-04-14 00:20:48,982 INFO L231 Difference]: Finished difference. Result has 341 places, 609 transitions, 11336 flow [2025-04-14 00:20:48,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=12854, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11336, PETRI_PLACES=341, PETRI_TRANSITIONS=609} [2025-04-14 00:20:48,983 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 320 predicate places. [2025-04-14 00:20:48,983 INFO L485 AbstractCegarLoop]: Abstraction has has 341 places, 609 transitions, 11336 flow [2025-04-14 00:20:48,983 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.0) internal successors, (132), 22 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:20:48,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:20:48,984 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:20:48,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2025-04-14 00:20:49,184 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-04-14 00:20:49,184 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:20:49,185 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:20:49,185 INFO L85 PathProgramCache]: Analyzing trace with hash 217135019, now seen corresponding path program 41 times [2025-04-14 00:20:49,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:20:49,185 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291391388] [2025-04-14 00:20:49,185 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:20:49,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:20:49,195 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 3 equivalence classes. [2025-04-14 00:20:49,204 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:20:49,205 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 00:20:49,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:49,698 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:20:49,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:20:49,698 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291391388] [2025-04-14 00:20:49,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291391388] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:20:49,698 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175565399] [2025-04-14 00:20:49,698 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:20:49,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:20:49,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:20:49,700 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:20:49,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2025-04-14 00:20:49,791 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 3 equivalence classes. [2025-04-14 00:20:49,833 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:20:49,833 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 00:20:49,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:49,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-14 00:20:49,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:20:50,067 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-14 00:20:50,067 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:20:50,147 INFO L325 Elim1Store]: treesize reduction 24, result has 68.8 percent of original size [2025-04-14 00:20:50,148 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 64 [2025-04-14 00:20:50,214 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-14 00:20:50,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175565399] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:20:50,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:20:50,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 6] total 29 [2025-04-14 00:20:50,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521751394] [2025-04-14 00:20:50,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:20:50,215 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-14 00:20:50,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:20:50,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-14 00:20:50,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=783, Unknown=0, NotChecked=0, Total=870 [2025-04-14 00:20:50,216 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:20:50,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 609 transitions, 11336 flow. Second operand has 30 states, 30 states have (on average 5.933333333333334) internal successors, (178), 30 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:20:50,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:20:50,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:20:50,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:20:52,314 INFO L116 PetriNetUnfolderBase]: 2354/4756 cut-off events. [2025-04-14 00:20:52,315 INFO L117 PetriNetUnfolderBase]: For 418211/418211 co-relation queries the response was YES. [2025-04-14 00:20:52,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58573 conditions, 4756 events. 2354/4756 cut-off events. For 418211/418211 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 36573 event pairs, 166 based on Foata normal form. 65/4820 useless extension candidates. Maximal degree in co-relation 58419. Up to 3921 conditions per place. [2025-04-14 00:20:52,373 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 536 selfloop transitions, 151 changer transitions 8/697 dead transitions. [2025-04-14 00:20:52,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 697 transitions, 13711 flow [2025-04-14 00:20:52,374 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-14 00:20:52,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-04-14 00:20:52,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 273 transitions. [2025-04-14 00:20:52,374 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38235294117647056 [2025-04-14 00:20:52,375 INFO L175 Difference]: Start difference. First operand has 341 places, 609 transitions, 11336 flow. Second operand 34 states and 273 transitions. [2025-04-14 00:20:52,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 697 transitions, 13711 flow [2025-04-14 00:20:54,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 697 transitions, 13146 flow, removed 248 selfloop flow, removed 28 redundant places. [2025-04-14 00:20:54,041 INFO L231 Difference]: Finished difference. Result has 320 places, 619 transitions, 11441 flow [2025-04-14 00:20:54,042 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=10548, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=593, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=458, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=11441, PETRI_PLACES=320, PETRI_TRANSITIONS=619} [2025-04-14 00:20:54,042 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 299 predicate places. [2025-04-14 00:20:54,042 INFO L485 AbstractCegarLoop]: Abstraction has has 320 places, 619 transitions, 11441 flow [2025-04-14 00:20:54,042 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.933333333333334) internal successors, (178), 30 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:20:54,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:20:54,043 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:20:54,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2025-04-14 00:20:54,243 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-04-14 00:20:54,243 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:20:54,244 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:20:54,244 INFO L85 PathProgramCache]: Analyzing trace with hash 935413252, now seen corresponding path program 42 times [2025-04-14 00:20:54,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:20:54,244 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246923090] [2025-04-14 00:20:54,244 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:20:54,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:20:54,251 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 3 equivalence classes. [2025-04-14 00:20:54,259 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:20:54,260 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:20:54,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:54,346 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-14 00:20:54,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:20:54,346 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246923090] [2025-04-14 00:20:54,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246923090] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:20:54,347 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428319216] [2025-04-14 00:20:54,347 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:20:54,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:20:54,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:20:54,349 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:20:54,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2025-04-14 00:20:54,432 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 3 equivalence classes. [2025-04-14 00:20:54,451 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:20:54,451 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:20:54,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:54,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 00:20:54,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:20:54,542 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-14 00:20:54,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:20:54,611 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-14 00:20:54,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428319216] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:20:54,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:20:54,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-04-14 00:20:54,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905718950] [2025-04-14 00:20:54,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:20:54,612 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-14 00:20:54,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:20:54,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-14 00:20:54,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2025-04-14 00:20:54,613 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:20:54,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 619 transitions, 11441 flow. Second operand has 23 states, 23 states have (on average 5.826086956521739) internal successors, (134), 23 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 00:20:54,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:20:54,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:20:54,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:20:55,948 INFO L116 PetriNetUnfolderBase]: 2046/4102 cut-off events. [2025-04-14 00:20:55,948 INFO L117 PetriNetUnfolderBase]: For 334839/334839 co-relation queries the response was YES. [2025-04-14 00:20:55,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48846 conditions, 4102 events. 2046/4102 cut-off events. For 334839/334839 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 30066 event pairs, 862 based on Foata normal form. 72/4173 useless extension candidates. Maximal degree in co-relation 48707. Up to 3709 conditions per place. [2025-04-14 00:20:55,988 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 561 selfloop transitions, 6 changer transitions 81/650 dead transitions. [2025-04-14 00:20:55,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 650 transitions, 13324 flow [2025-04-14 00:20:55,989 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 00:20:55,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 00:20:55,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 90 transitions. [2025-04-14 00:20:55,989 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38961038961038963 [2025-04-14 00:20:55,989 INFO L175 Difference]: Start difference. First operand has 320 places, 619 transitions, 11441 flow. Second operand 11 states and 90 transitions. [2025-04-14 00:20:55,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 650 transitions, 13324 flow [2025-04-14 00:20:57,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 650 transitions, 12934 flow, removed 116 selfloop flow, removed 18 redundant places. [2025-04-14 00:20:57,169 INFO L231 Difference]: Finished difference. Result has 316 places, 569 transitions, 10154 flow [2025-04-14 00:20:57,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=10679, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=593, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10154, PETRI_PLACES=316, PETRI_TRANSITIONS=569} [2025-04-14 00:20:57,170 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 295 predicate places. [2025-04-14 00:20:57,170 INFO L485 AbstractCegarLoop]: Abstraction has has 316 places, 569 transitions, 10154 flow [2025-04-14 00:20:57,170 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.826086956521739) internal successors, (134), 23 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 00:20:57,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:20:57,170 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:20:57,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2025-04-14 00:20:57,371 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-04-14 00:20:57,371 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:20:57,372 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:20:57,372 INFO L85 PathProgramCache]: Analyzing trace with hash -873437957, now seen corresponding path program 43 times [2025-04-14 00:20:57,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:20:57,372 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065508995] [2025-04-14 00:20:57,372 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:20:57,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:20:57,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 00:20:57,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:20:57,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:20:57,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:57,886 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:20:57,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:20:57,886 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065508995] [2025-04-14 00:20:57,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065508995] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:20:57,886 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019667437] [2025-04-14 00:20:57,886 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:20:57,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:20:57,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:20:57,888 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:20:57,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2025-04-14 00:20:57,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 00:20:57,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:20:57,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:20:57,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:57,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-14 00:20:57,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:20:58,405 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:20:58,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:20:58,564 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-14 00:20:58,564 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-14 00:20:59,070 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 20 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:20:59,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019667437] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:20:59,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:20:59,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 53 [2025-04-14 00:20:59,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818200380] [2025-04-14 00:20:59,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:20:59,071 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-04-14 00:20:59,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:20:59,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-04-14 00:20:59,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=2563, Unknown=0, NotChecked=0, Total=2862 [2025-04-14 00:20:59,072 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:20:59,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 569 transitions, 10154 flow. Second operand has 54 states, 54 states have (on average 5.351851851851852) internal successors, (289), 54 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:20:59,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:20:59,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:20:59,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:21:00,652 INFO L116 PetriNetUnfolderBase]: 1942/3787 cut-off events. [2025-04-14 00:21:00,652 INFO L117 PetriNetUnfolderBase]: For 303861/303861 co-relation queries the response was YES. [2025-04-14 00:21:00,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44722 conditions, 3787 events. 1942/3787 cut-off events. For 303861/303861 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 27086 event pairs, 148 based on Foata normal form. 5/3791 useless extension candidates. Maximal degree in co-relation 44582. Up to 3602 conditions per place. [2025-04-14 00:21:00,689 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 580 selfloop transitions, 35 changer transitions 0/617 dead transitions. [2025-04-14 00:21:00,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 617 transitions, 12103 flow [2025-04-14 00:21:00,690 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-14 00:21:00,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-14 00:21:00,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 165 transitions. [2025-04-14 00:21:00,690 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2025-04-14 00:21:00,690 INFO L175 Difference]: Start difference. First operand has 316 places, 569 transitions, 10154 flow. Second operand 22 states and 165 transitions. [2025-04-14 00:21:00,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 617 transitions, 12103 flow [2025-04-14 00:21:01,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 617 transitions, 11830 flow, removed 124 selfloop flow, removed 14 redundant places. [2025-04-14 00:21:01,598 INFO L231 Difference]: Finished difference. Result has 313 places, 575 transitions, 10062 flow [2025-04-14 00:21:01,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=9881, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=535, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=10062, PETRI_PLACES=313, PETRI_TRANSITIONS=575} [2025-04-14 00:21:01,599 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 292 predicate places. [2025-04-14 00:21:01,599 INFO L485 AbstractCegarLoop]: Abstraction has has 313 places, 575 transitions, 10062 flow [2025-04-14 00:21:01,599 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.351851851851852) internal successors, (289), 54 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:21:01,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:21:01,599 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:21:01,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2025-04-14 00:21:01,799 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:21:01,799 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:21:01,800 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:21:01,800 INFO L85 PathProgramCache]: Analyzing trace with hash -558594856, now seen corresponding path program 44 times [2025-04-14 00:21:01,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:21:01,800 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270818370] [2025-04-14 00:21:01,800 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:21:01,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:21:01,806 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-14 00:21:01,812 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:21:01,812 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:21:01,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:02,237 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:21:02,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:21:02,238 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270818370] [2025-04-14 00:21:02,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270818370] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:21:02,238 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318733818] [2025-04-14 00:21:02,238 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:21:02,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:21:02,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:21:02,240 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:21:02,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2025-04-14 00:21:02,324 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-14 00:21:02,343 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:21:02,343 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:21:02,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:02,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-14 00:21:02,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:21:02,822 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:21:02,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:21:02,970 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-14 00:21:02,970 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-14 00:21:03,387 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:21:03,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318733818] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:21:03,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:21:03,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 18] total 52 [2025-04-14 00:21:03,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654330302] [2025-04-14 00:21:03,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:21:03,387 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-04-14 00:21:03,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:21:03,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-04-14 00:21:03,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=2461, Unknown=0, NotChecked=0, Total=2756 [2025-04-14 00:21:03,388 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:21:03,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 575 transitions, 10062 flow. Second operand has 53 states, 53 states have (on average 5.320754716981132) internal successors, (282), 53 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:21:03,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:21:03,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:21:03,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:21:04,641 INFO L116 PetriNetUnfolderBase]: 1945/3799 cut-off events. [2025-04-14 00:21:04,642 INFO L117 PetriNetUnfolderBase]: For 310110/310110 co-relation queries the response was YES. [2025-04-14 00:21:04,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44876 conditions, 3799 events. 1945/3799 cut-off events. For 310110/310110 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 27378 event pairs, 168 based on Foata normal form. 3/3801 useless extension candidates. Maximal degree in co-relation 44738. Up to 3737 conditions per place. [2025-04-14 00:21:04,678 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 566 selfloop transitions, 19 changer transitions 14/601 dead transitions. [2025-04-14 00:21:04,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 601 transitions, 11425 flow [2025-04-14 00:21:04,679 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-14 00:21:04,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-14 00:21:04,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 139 transitions. [2025-04-14 00:21:04,679 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33095238095238094 [2025-04-14 00:21:04,679 INFO L175 Difference]: Start difference. First operand has 313 places, 575 transitions, 10062 flow. Second operand 20 states and 139 transitions. [2025-04-14 00:21:04,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 601 transitions, 11425 flow [2025-04-14 00:21:05,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 601 transitions, 11344 flow, removed 14 selfloop flow, removed 17 redundant places. [2025-04-14 00:21:05,744 INFO L231 Difference]: Finished difference. Result has 319 places, 575 transitions, 10033 flow [2025-04-14 00:21:05,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=9984, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=10033, PETRI_PLACES=319, PETRI_TRANSITIONS=575} [2025-04-14 00:21:05,745 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 298 predicate places. [2025-04-14 00:21:05,745 INFO L485 AbstractCegarLoop]: Abstraction has has 319 places, 575 transitions, 10033 flow [2025-04-14 00:21:05,745 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 5.320754716981132) internal successors, (282), 53 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:21:05,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:21:05,745 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:21:05,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2025-04-14 00:21:05,946 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:21:05,946 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:21:05,947 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:21:05,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1764732010, now seen corresponding path program 45 times [2025-04-14 00:21:05,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:21:05,947 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896397292] [2025-04-14 00:21:05,947 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:21:05,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:21:05,954 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 3 equivalence classes. [2025-04-14 00:21:05,962 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:21:05,962 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 00:21:05,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:06,168 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-14 00:21:06,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:21:06,168 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896397292] [2025-04-14 00:21:06,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896397292] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:21:06,168 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022243847] [2025-04-14 00:21:06,168 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:21:06,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:21:06,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:21:06,170 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:21:06,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2025-04-14 00:21:06,261 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 3 equivalence classes. [2025-04-14 00:21:06,284 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:21:06,284 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 00:21:06,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:06,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-14 00:21:06,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:21:06,464 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 00:21:06,679 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:21:06,679 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:21:07,071 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:21:07,072 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 88 [2025-04-14 00:21:07,088 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2025-04-14 00:21:07,096 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-14 00:21:07,097 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 22 [2025-04-14 00:21:07,105 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:21:07,105 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 88 [2025-04-14 00:21:07,120 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2025-04-14 00:21:07,125 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2025-04-14 00:21:07,141 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:21:07,142 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 164 [2025-04-14 00:21:07,177 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-14 00:21:07,177 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2025-04-14 00:21:07,216 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-14 00:21:07,216 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 194 [2025-04-14 00:21:07,580 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:21:07,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022243847] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:21:07,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:21:07,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19, 15] total 42 [2025-04-14 00:21:07,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827676097] [2025-04-14 00:21:07,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:21:07,581 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-14 00:21:07,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:21:07,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-14 00:21:07,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1606, Unknown=0, NotChecked=0, Total=1806 [2025-04-14 00:21:07,582 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:21:07,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 575 transitions, 10033 flow. Second operand has 43 states, 43 states have (on average 5.558139534883721) internal successors, (239), 43 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:21:07,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:21:07,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:21:07,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:21:09,353 INFO L116 PetriNetUnfolderBase]: 2052/4021 cut-off events. [2025-04-14 00:21:09,353 INFO L117 PetriNetUnfolderBase]: For 350476/350476 co-relation queries the response was YES. [2025-04-14 00:21:09,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48154 conditions, 4021 events. 2052/4021 cut-off events. For 350476/350476 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 29509 event pairs, 149 based on Foata normal form. 19/4039 useless extension candidates. Maximal degree in co-relation 48013. Up to 3600 conditions per place. [2025-04-14 00:21:09,395 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 571 selfloop transitions, 70 changer transitions 27/670 dead transitions. [2025-04-14 00:21:09,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 670 transitions, 13128 flow [2025-04-14 00:21:09,395 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-14 00:21:09,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-04-14 00:21:09,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 203 transitions. [2025-04-14 00:21:09,396 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3717948717948718 [2025-04-14 00:21:09,396 INFO L175 Difference]: Start difference. First operand has 319 places, 575 transitions, 10033 flow. Second operand 26 states and 203 transitions. [2025-04-14 00:21:09,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 670 transitions, 13128 flow [2025-04-14 00:21:10,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 670 transitions, 13066 flow, removed 12 selfloop flow, removed 18 redundant places. [2025-04-14 00:21:10,392 INFO L231 Difference]: Finished difference. Result has 328 places, 600 transitions, 10826 flow [2025-04-14 00:21:10,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=9948, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=10826, PETRI_PLACES=328, PETRI_TRANSITIONS=600} [2025-04-14 00:21:10,393 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 307 predicate places. [2025-04-14 00:21:10,393 INFO L485 AbstractCegarLoop]: Abstraction has has 328 places, 600 transitions, 10826 flow [2025-04-14 00:21:10,393 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 5.558139534883721) internal successors, (239), 43 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:21:10,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:21:10,394 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:21:10,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2025-04-14 00:21:10,594 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:21:10,594 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:21:10,595 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:21:10,595 INFO L85 PathProgramCache]: Analyzing trace with hash 755851032, now seen corresponding path program 46 times [2025-04-14 00:21:10,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:21:10,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710070029] [2025-04-14 00:21:10,595 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:21:10,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:21:10,601 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-14 00:21:10,607 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:21:10,607 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:21:10,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:10,845 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-14 00:21:10,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:21:10,845 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710070029] [2025-04-14 00:21:10,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710070029] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:21:10,845 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850592279] [2025-04-14 00:21:10,846 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:21:10,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:21:10,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:21:10,847 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:21:10,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2025-04-14 00:21:10,932 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-14 00:21:10,953 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:21:10,954 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:21:10,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:10,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-14 00:21:10,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:21:11,161 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-14 00:21:11,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:21:11,204 INFO L325 Elim1Store]: treesize reduction 24, result has 68.8 percent of original size [2025-04-14 00:21:11,205 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 71 [2025-04-14 00:21:11,271 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-14 00:21:11,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850592279] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:21:11,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:21:11,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 6] total 22 [2025-04-14 00:21:11,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829062589] [2025-04-14 00:21:11,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:21:11,272 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-14 00:21:11,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:21:11,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-14 00:21:11,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2025-04-14 00:21:11,273 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:21:11,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 600 transitions, 10826 flow. Second operand has 23 states, 23 states have (on average 6.391304347826087) internal successors, (147), 23 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:21:11,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:21:11,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:21:11,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:21:12,642 INFO L116 PetriNetUnfolderBase]: 2279/4482 cut-off events. [2025-04-14 00:21:12,642 INFO L117 PetriNetUnfolderBase]: For 451817/451817 co-relation queries the response was YES. [2025-04-14 00:21:12,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56753 conditions, 4482 events. 2279/4482 cut-off events. For 451817/451817 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 33674 event pairs, 153 based on Foata normal form. 21/4502 useless extension candidates. Maximal degree in co-relation 56609. Up to 2454 conditions per place. [2025-04-14 00:21:12,687 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 421 selfloop transitions, 301 changer transitions 6/730 dead transitions. [2025-04-14 00:21:12,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 730 transitions, 15340 flow [2025-04-14 00:21:12,688 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 00:21:12,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-14 00:21:12,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 156 transitions. [2025-04-14 00:21:12,689 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2025-04-14 00:21:12,689 INFO L175 Difference]: Start difference. First operand has 328 places, 600 transitions, 10826 flow. Second operand 16 states and 156 transitions. [2025-04-14 00:21:12,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 730 transitions, 15340 flow [2025-04-14 00:21:14,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 730 transitions, 14863 flow, removed 221 selfloop flow, removed 17 redundant places. [2025-04-14 00:21:14,105 INFO L231 Difference]: Finished difference. Result has 326 places, 663 transitions, 12732 flow [2025-04-14 00:21:14,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=10401, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=254, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=12732, PETRI_PLACES=326, PETRI_TRANSITIONS=663} [2025-04-14 00:21:14,106 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 305 predicate places. [2025-04-14 00:21:14,106 INFO L485 AbstractCegarLoop]: Abstraction has has 326 places, 663 transitions, 12732 flow [2025-04-14 00:21:14,106 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.391304347826087) internal successors, (147), 23 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:21:14,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:21:14,106 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:21:14,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2025-04-14 00:21:14,307 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2025-04-14 00:21:14,307 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:21:14,307 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:21:14,307 INFO L85 PathProgramCache]: Analyzing trace with hash -322099224, now seen corresponding path program 47 times [2025-04-14 00:21:14,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:21:14,308 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613811380] [2025-04-14 00:21:14,308 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:21:14,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:21:14,320 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 3 equivalence classes. [2025-04-14 00:21:14,327 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:21:14,327 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 00:21:14,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:14,624 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:21:14,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:21:14,625 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613811380] [2025-04-14 00:21:14,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613811380] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:21:14,625 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399661997] [2025-04-14 00:21:14,625 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:21:14,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:21:14,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:21:14,627 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:21:14,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2025-04-14 00:21:14,712 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 3 equivalence classes. [2025-04-14 00:21:14,760 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:21:14,760 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 00:21:14,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:14,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-14 00:21:14,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:21:15,053 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-14 00:21:15,054 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:21:15,097 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-14 00:21:15,097 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-14 00:21:15,191 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-14 00:21:15,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399661997] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:21:15,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:21:15,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 7] total 29 [2025-04-14 00:21:15,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628772564] [2025-04-14 00:21:15,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:21:15,192 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-14 00:21:15,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:21:15,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-14 00:21:15,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2025-04-14 00:21:15,192 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:21:15,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 663 transitions, 12732 flow. Second operand has 30 states, 30 states have (on average 6.0) internal successors, (180), 30 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:21:15,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:21:15,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:21:15,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:21:17,263 INFO L116 PetriNetUnfolderBase]: 2299/4526 cut-off events. [2025-04-14 00:21:17,263 INFO L117 PetriNetUnfolderBase]: For 478827/478827 co-relation queries the response was YES. [2025-04-14 00:21:17,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58701 conditions, 4526 events. 2299/4526 cut-off events. For 478827/478827 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 34137 event pairs, 162 based on Foata normal form. 20/4545 useless extension candidates. Maximal degree in co-relation 58556. Up to 2881 conditions per place. [2025-04-14 00:21:17,307 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 461 selfloop transitions, 278 changer transitions 3/744 dead transitions. [2025-04-14 00:21:17,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 744 transitions, 16326 flow [2025-04-14 00:21:17,308 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-14 00:21:17,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-04-14 00:21:17,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 211 transitions. [2025-04-14 00:21:17,309 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38644688644688646 [2025-04-14 00:21:17,309 INFO L175 Difference]: Start difference. First operand has 326 places, 663 transitions, 12732 flow. Second operand 26 states and 211 transitions. [2025-04-14 00:21:17,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 744 transitions, 16326 flow [2025-04-14 00:21:18,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 744 transitions, 15818 flow, removed 244 selfloop flow, removed 7 redundant places. [2025-04-14 00:21:18,691 INFO L231 Difference]: Finished difference. Result has 348 places, 669 transitions, 13188 flow [2025-04-14 00:21:18,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=12244, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=663, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=274, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=13188, PETRI_PLACES=348, PETRI_TRANSITIONS=669} [2025-04-14 00:21:18,692 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 327 predicate places. [2025-04-14 00:21:18,692 INFO L485 AbstractCegarLoop]: Abstraction has has 348 places, 669 transitions, 13188 flow [2025-04-14 00:21:18,693 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.0) internal successors, (180), 30 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:21:18,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:21:18,693 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:21:18,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2025-04-14 00:21:18,893 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2025-04-14 00:21:18,894 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:21:18,894 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:21:18,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1377173871, now seen corresponding path program 48 times [2025-04-14 00:21:18,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:21:18,894 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248701149] [2025-04-14 00:21:18,894 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:21:18,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:21:18,902 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 3 equivalence classes. [2025-04-14 00:21:18,909 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:21:18,909 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:21:18,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:19,257 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:21:19,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:21:19,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248701149] [2025-04-14 00:21:19,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248701149] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:21:19,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893008439] [2025-04-14 00:21:19,257 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:21:19,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:21:19,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:21:19,259 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:21:19,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2025-04-14 00:21:19,357 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 3 equivalence classes. [2025-04-14 00:21:19,380 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:21:19,380 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:21:19,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:19,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-14 00:21:19,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:21:19,696 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:21:19,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:21:19,756 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-14 00:21:19,757 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-14 00:21:20,055 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:21:20,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893008439] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:21:20,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:21:20,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 13] total 39 [2025-04-14 00:21:20,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143709374] [2025-04-14 00:21:20,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:21:20,056 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-14 00:21:20,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:21:20,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-14 00:21:20,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1370, Unknown=0, NotChecked=0, Total=1560 [2025-04-14 00:21:20,056 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:21:20,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 669 transitions, 13188 flow. Second operand has 40 states, 40 states have (on average 5.45) internal successors, (218), 40 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:21:20,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:21:20,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:21:20,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:21:21,614 INFO L116 PetriNetUnfolderBase]: 2294/4521 cut-off events. [2025-04-14 00:21:21,615 INFO L117 PetriNetUnfolderBase]: For 496555/496555 co-relation queries the response was YES. [2025-04-14 00:21:21,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59635 conditions, 4521 events. 2294/4521 cut-off events. For 496555/496555 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 34041 event pairs, 218 based on Foata normal form. 5/4525 useless extension candidates. Maximal degree in co-relation 59483. Up to 4436 conditions per place. [2025-04-14 00:21:21,663 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 651 selfloop transitions, 32 changer transitions 7/692 dead transitions. [2025-04-14 00:21:21,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 692 transitions, 14920 flow [2025-04-14 00:21:21,663 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 00:21:21,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-14 00:21:21,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 142 transitions. [2025-04-14 00:21:21,664 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3558897243107769 [2025-04-14 00:21:21,664 INFO L175 Difference]: Start difference. First operand has 348 places, 669 transitions, 13188 flow. Second operand 19 states and 142 transitions. [2025-04-14 00:21:21,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 692 transitions, 14920 flow [2025-04-14 00:21:23,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 692 transitions, 14457 flow, removed 82 selfloop flow, removed 24 redundant places. [2025-04-14 00:21:23,197 INFO L231 Difference]: Finished difference. Result has 343 places, 668 transitions, 12794 flow [2025-04-14 00:21:23,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=12722, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=668, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=636, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=12794, PETRI_PLACES=343, PETRI_TRANSITIONS=668} [2025-04-14 00:21:23,198 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 322 predicate places. [2025-04-14 00:21:23,198 INFO L485 AbstractCegarLoop]: Abstraction has has 343 places, 668 transitions, 12794 flow [2025-04-14 00:21:23,198 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 5.45) internal successors, (218), 40 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:21:23,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:21:23,198 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:21:23,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2025-04-14 00:21:23,399 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2025-04-14 00:21:23,399 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:21:23,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:21:23,399 INFO L85 PathProgramCache]: Analyzing trace with hash 345140603, now seen corresponding path program 49 times [2025-04-14 00:21:23,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:21:23,400 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598330105] [2025-04-14 00:21:23,400 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:21:23,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:21:23,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 00:21:23,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:21:23,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:21:23,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:23,937 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:21:23,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:21:23,937 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598330105] [2025-04-14 00:21:23,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598330105] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:21:23,937 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681123081] [2025-04-14 00:21:23,937 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:21:23,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:21:23,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:21:23,939 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:21:23,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2025-04-14 00:21:24,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 00:21:24,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:21:24,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:21:24,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:24,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-14 00:21:24,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:21:24,419 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:21:24,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:21:24,480 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-14 00:21:24,481 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-14 00:21:24,955 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:21:24,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681123081] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:21:24,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:21:24,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 53 [2025-04-14 00:21:24,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107981797] [2025-04-14 00:21:24,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:21:24,956 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-04-14 00:21:24,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:21:24,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-04-14 00:21:24,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=2545, Unknown=0, NotChecked=0, Total=2862 [2025-04-14 00:21:24,957 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:21:24,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 668 transitions, 12794 flow. Second operand has 54 states, 54 states have (on average 5.351851851851852) internal successors, (289), 54 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:21:24,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:21:24,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:21:24,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:21:26,960 INFO L116 PetriNetUnfolderBase]: 2314/4564 cut-off events. [2025-04-14 00:21:26,960 INFO L117 PetriNetUnfolderBase]: For 462838/462838 co-relation queries the response was YES. [2025-04-14 00:21:26,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58222 conditions, 4564 events. 2314/4564 cut-off events. For 462838/462838 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 34299 event pairs, 143 based on Foata normal form. 15/4578 useless extension candidates. Maximal degree in co-relation 58073. Up to 4319 conditions per place. [2025-04-14 00:21:27,004 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 645 selfloop transitions, 59 changer transitions 1/707 dead transitions. [2025-04-14 00:21:27,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 707 transitions, 14649 flow [2025-04-14 00:21:27,005 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-14 00:21:27,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-14 00:21:27,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 170 transitions. [2025-04-14 00:21:27,005 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3373015873015873 [2025-04-14 00:21:27,005 INFO L175 Difference]: Start difference. First operand has 343 places, 668 transitions, 12794 flow. Second operand 24 states and 170 transitions. [2025-04-14 00:21:27,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 707 transitions, 14649 flow [2025-04-14 00:21:28,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 707 transitions, 14561 flow, removed 10 selfloop flow, removed 18 redundant places. [2025-04-14 00:21:28,302 INFO L231 Difference]: Finished difference. Result has 348 places, 671 transitions, 12893 flow [2025-04-14 00:21:28,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=12708, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=668, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=609, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=12893, PETRI_PLACES=348, PETRI_TRANSITIONS=671} [2025-04-14 00:21:28,303 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 327 predicate places. [2025-04-14 00:21:28,303 INFO L485 AbstractCegarLoop]: Abstraction has has 348 places, 671 transitions, 12893 flow [2025-04-14 00:21:28,303 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.351851851851852) internal successors, (289), 54 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:21:28,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:21:28,304 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:21:28,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2025-04-14 00:21:28,504 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2025-04-14 00:21:28,504 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:21:28,505 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:21:28,505 INFO L85 PathProgramCache]: Analyzing trace with hash -615661671, now seen corresponding path program 50 times [2025-04-14 00:21:28,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:21:28,505 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246656649] [2025-04-14 00:21:28,505 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:21:28,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:21:28,513 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-14 00:21:28,519 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:21:28,519 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:21:28,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:29,147 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:21:29,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:21:29,147 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246656649] [2025-04-14 00:21:29,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246656649] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:21:29,148 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388404354] [2025-04-14 00:21:29,148 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:21:29,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:21:29,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:21:29,150 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:21:29,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2025-04-14 00:21:29,252 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-14 00:21:29,273 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:21:29,274 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:21:29,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:29,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-14 00:21:29,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:21:29,714 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:21:29,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:21:29,796 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-14 00:21:29,796 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-14 00:21:30,259 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:21:30,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388404354] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:21:30,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:21:30,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 18] total 52 [2025-04-14 00:21:30,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818726301] [2025-04-14 00:21:30,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:21:30,260 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-04-14 00:21:30,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:21:30,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-04-14 00:21:30,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=2450, Unknown=0, NotChecked=0, Total=2756 [2025-04-14 00:21:30,261 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:21:30,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 671 transitions, 12893 flow. Second operand has 53 states, 53 states have (on average 5.283018867924528) internal successors, (280), 53 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:21:30,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:21:30,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:21:30,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:21:31,848 INFO L116 PetriNetUnfolderBase]: 2306/4535 cut-off events. [2025-04-14 00:21:31,849 INFO L117 PetriNetUnfolderBase]: For 459746/459746 co-relation queries the response was YES. [2025-04-14 00:21:31,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58172 conditions, 4535 events. 2306/4535 cut-off events. For 459746/459746 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 34050 event pairs, 214 based on Foata normal form. 2/4536 useless extension candidates. Maximal degree in co-relation 58023. Up to 4479 conditions per place. [2025-04-14 00:21:31,891 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 653 selfloop transitions, 29 changer transitions 4/688 dead transitions. [2025-04-14 00:21:31,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 688 transitions, 14330 flow [2025-04-14 00:21:31,891 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-14 00:21:31,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-14 00:21:31,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 147 transitions. [2025-04-14 00:21:31,892 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3181818181818182 [2025-04-14 00:21:31,892 INFO L175 Difference]: Start difference. First operand has 348 places, 671 transitions, 12893 flow. Second operand 22 states and 147 transitions. [2025-04-14 00:21:31,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 688 transitions, 14330 flow [2025-04-14 00:21:33,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 688 transitions, 14182 flow, removed 17 selfloop flow, removed 22 redundant places. [2025-04-14 00:21:33,168 INFO L231 Difference]: Finished difference. Result has 349 places, 670 transitions, 12795 flow [2025-04-14 00:21:33,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=12745, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=642, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=12795, PETRI_PLACES=349, PETRI_TRANSITIONS=670} [2025-04-14 00:21:33,169 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 328 predicate places. [2025-04-14 00:21:33,169 INFO L485 AbstractCegarLoop]: Abstraction has has 349 places, 670 transitions, 12795 flow [2025-04-14 00:21:33,169 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 5.283018867924528) internal successors, (280), 53 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:21:33,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:21:33,169 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:21:33,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2025-04-14 00:21:33,369 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2025-04-14 00:21:33,370 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:21:33,370 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:21:33,370 INFO L85 PathProgramCache]: Analyzing trace with hash -498357553, now seen corresponding path program 51 times [2025-04-14 00:21:33,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:21:33,370 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629443568] [2025-04-14 00:21:33,370 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:21:33,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:21:33,377 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 3 equivalence classes. [2025-04-14 00:21:33,386 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:21:33,386 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 00:21:33,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:33,793 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:21:33,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:21:33,793 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629443568] [2025-04-14 00:21:33,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629443568] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:21:33,793 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488151000] [2025-04-14 00:21:33,793 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:21:33,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:21:33,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:21:33,796 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:21:33,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2025-04-14 00:21:34,003 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 3 equivalence classes. [2025-04-14 00:21:34,030 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:21:34,031 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 00:21:34,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:34,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-14 00:21:34,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:21:34,286 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 00:21:34,498 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:21:34,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:21:34,997 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:21:34,997 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 88 [2025-04-14 00:21:35,014 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2025-04-14 00:21:35,021 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-14 00:21:35,022 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 22 [2025-04-14 00:21:35,029 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:21:35,029 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 88 [2025-04-14 00:21:35,045 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2025-04-14 00:21:35,054 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:21:35,054 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 164 [2025-04-14 00:21:35,094 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-14 00:21:35,094 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2025-04-14 00:21:35,133 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-14 00:21:35,133 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 194 [2025-04-14 00:21:35,431 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:21:35,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488151000] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:21:35,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:21:35,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 15] total 45 [2025-04-14 00:21:35,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369327219] [2025-04-14 00:21:35,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:21:35,431 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-14 00:21:35,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:21:35,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-14 00:21:35,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1817, Unknown=0, NotChecked=0, Total=2070 [2025-04-14 00:21:35,432 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:21:35,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 670 transitions, 12795 flow. Second operand has 46 states, 46 states have (on average 5.369565217391305) internal successors, (247), 46 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 00:21:35,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:21:35,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:21:35,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:21:37,088 INFO L116 PetriNetUnfolderBase]: 2309/4540 cut-off events. [2025-04-14 00:21:37,088 INFO L117 PetriNetUnfolderBase]: For 461884/461884 co-relation queries the response was YES. [2025-04-14 00:21:37,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58102 conditions, 4540 events. 2309/4540 cut-off events. For 461884/461884 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 34099 event pairs, 217 based on Foata normal form. 2/4541 useless extension candidates. Maximal degree in co-relation 57951. Up to 4487 conditions per place. [2025-04-14 00:21:37,134 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 655 selfloop transitions, 27 changer transitions 7/691 dead transitions. [2025-04-14 00:21:37,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 691 transitions, 14361 flow [2025-04-14 00:21:37,135 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-14 00:21:37,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-14 00:21:37,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 145 transitions. [2025-04-14 00:21:37,135 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31385281385281383 [2025-04-14 00:21:37,135 INFO L175 Difference]: Start difference. First operand has 349 places, 670 transitions, 12795 flow. Second operand 22 states and 145 transitions. [2025-04-14 00:21:37,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 691 transitions, 14361 flow [2025-04-14 00:21:38,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 691 transitions, 14293 flow, removed 5 selfloop flow, removed 20 redundant places. [2025-04-14 00:21:38,703 INFO L231 Difference]: Finished difference. Result has 353 places, 673 transitions, 12889 flow [2025-04-14 00:21:38,703 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=12727, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=643, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=12889, PETRI_PLACES=353, PETRI_TRANSITIONS=673} [2025-04-14 00:21:38,704 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 332 predicate places. [2025-04-14 00:21:38,704 INFO L485 AbstractCegarLoop]: Abstraction has has 353 places, 673 transitions, 12889 flow [2025-04-14 00:21:38,704 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 5.369565217391305) internal successors, (247), 46 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 00:21:38,704 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:21:38,704 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:21:38,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2025-04-14 00:21:38,904 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2025-04-14 00:21:38,905 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:21:38,905 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:21:38,905 INFO L85 PathProgramCache]: Analyzing trace with hash 39498025, now seen corresponding path program 52 times [2025-04-14 00:21:38,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:21:38,905 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722456754] [2025-04-14 00:21:38,905 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:21:38,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:21:38,912 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-14 00:21:38,918 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:21:38,918 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:21:38,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:39,093 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-14 00:21:39,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:21:39,093 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722456754] [2025-04-14 00:21:39,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722456754] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:21:39,093 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104065273] [2025-04-14 00:21:39,093 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:21:39,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:21:39,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:21:39,095 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:21:39,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2025-04-14 00:21:39,190 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-14 00:21:39,210 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:21:39,211 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:21:39,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:39,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-14 00:21:39,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:21:39,321 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-14 00:21:39,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:21:39,390 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-14 00:21:39,390 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-14 00:21:39,440 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-14 00:21:39,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104065273] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:21:39,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:21:39,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 6] total 21 [2025-04-14 00:21:39,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390903229] [2025-04-14 00:21:39,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:21:39,440 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-14 00:21:39,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:21:39,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-14 00:21:39,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-04-14 00:21:39,441 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:21:39,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 673 transitions, 12889 flow. Second operand has 22 states, 22 states have (on average 6.409090909090909) internal successors, (141), 22 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:21:39,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:21:39,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:21:39,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:21:40,898 INFO L116 PetriNetUnfolderBase]: 2285/4470 cut-off events. [2025-04-14 00:21:40,898 INFO L117 PetriNetUnfolderBase]: For 457928/457928 co-relation queries the response was YES. [2025-04-14 00:21:40,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57244 conditions, 4470 events. 2285/4470 cut-off events. For 457928/457928 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 33528 event pairs, 63 based on Foata normal form. 10/4479 useless extension candidates. Maximal degree in co-relation 57089. Up to 2181 conditions per place. [2025-04-14 00:21:40,943 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 762 selfloop transitions, 62 changer transitions 30/856 dead transitions. [2025-04-14 00:21:40,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 856 transitions, 17895 flow [2025-04-14 00:21:40,944 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 00:21:40,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-14 00:21:40,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 140 transitions. [2025-04-14 00:21:40,944 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37037037037037035 [2025-04-14 00:21:40,944 INFO L175 Difference]: Start difference. First operand has 353 places, 673 transitions, 12889 flow. Second operand 18 states and 140 transitions. [2025-04-14 00:21:40,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 856 transitions, 17895 flow [2025-04-14 00:21:42,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 856 transitions, 17803 flow, removed 22 selfloop flow, removed 18 redundant places. [2025-04-14 00:21:42,460 INFO L231 Difference]: Finished difference. Result has 351 places, 673 transitions, 12961 flow [2025-04-14 00:21:42,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=12809, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=613, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=12961, PETRI_PLACES=351, PETRI_TRANSITIONS=673} [2025-04-14 00:21:42,461 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 330 predicate places. [2025-04-14 00:21:42,461 INFO L485 AbstractCegarLoop]: Abstraction has has 351 places, 673 transitions, 12961 flow [2025-04-14 00:21:42,461 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.409090909090909) internal successors, (141), 22 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:21:42,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:21:42,461 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:21:42,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2025-04-14 00:21:42,662 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:21:42,662 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:21:42,663 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:21:42,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1684209887, now seen corresponding path program 53 times [2025-04-14 00:21:42,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:21:42,663 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670199254] [2025-04-14 00:21:42,663 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:21:42,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:21:42,670 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 5 equivalence classes. [2025-04-14 00:21:42,676 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:21:42,676 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-14 00:21:42,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:43,125 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:21:43,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:21:43,125 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670199254] [2025-04-14 00:21:43,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670199254] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:21:43,125 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688248304] [2025-04-14 00:21:43,125 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:21:43,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:21:43,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:21:43,127 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:21:43,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2025-04-14 00:21:43,235 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 5 equivalence classes. [2025-04-14 00:21:43,299 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:21:43,300 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-14 00:21:43,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:43,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 00:21:43,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:21:43,501 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-14 00:21:43,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:21:43,535 INFO L325 Elim1Store]: treesize reduction 24, result has 68.8 percent of original size [2025-04-14 00:21:43,535 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 71 [2025-04-14 00:21:43,630 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-14 00:21:43,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688248304] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:21:43,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:21:43,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 6] total 31 [2025-04-14 00:21:43,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130331274] [2025-04-14 00:21:43,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:21:43,631 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-14 00:21:43,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:21:43,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-14 00:21:43,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=896, Unknown=0, NotChecked=0, Total=992 [2025-04-14 00:21:43,632 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:21:43,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 673 transitions, 12961 flow. Second operand has 32 states, 32 states have (on average 5.875) internal successors, (188), 32 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:21:43,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:21:43,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:21:43,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:21:45,504 INFO L116 PetriNetUnfolderBase]: 2282/4462 cut-off events. [2025-04-14 00:21:45,504 INFO L117 PetriNetUnfolderBase]: For 491539/491539 co-relation queries the response was YES. [2025-04-14 00:21:45,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58161 conditions, 4462 events. 2282/4462 cut-off events. For 491539/491539 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 33066 event pairs, 135 based on Foata normal form. 20/4481 useless extension candidates. Maximal degree in co-relation 58008. Up to 3792 conditions per place. [2025-04-14 00:21:45,556 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 589 selfloop transitions, 158 changer transitions 4/753 dead transitions. [2025-04-14 00:21:45,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 753 transitions, 16440 flow [2025-04-14 00:21:45,556 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-14 00:21:45,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-14 00:21:45,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 242 transitions. [2025-04-14 00:21:45,557 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38412698412698415 [2025-04-14 00:21:45,557 INFO L175 Difference]: Start difference. First operand has 351 places, 673 transitions, 12961 flow. Second operand 30 states and 242 transitions. [2025-04-14 00:21:45,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 753 transitions, 16440 flow [2025-04-14 00:21:47,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 753 transitions, 16098 flow, removed 135 selfloop flow, removed 10 redundant places. [2025-04-14 00:21:47,130 INFO L231 Difference]: Finished difference. Result has 369 places, 676 transitions, 13208 flow [2025-04-14 00:21:47,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=12662, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=13208, PETRI_PLACES=369, PETRI_TRANSITIONS=676} [2025-04-14 00:21:47,131 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 348 predicate places. [2025-04-14 00:21:47,131 INFO L485 AbstractCegarLoop]: Abstraction has has 369 places, 676 transitions, 13208 flow [2025-04-14 00:21:47,131 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.875) internal successors, (188), 32 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:21:47,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:21:47,132 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:21:47,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2025-04-14 00:21:47,332 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:21:47,332 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:21:47,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:21:47,333 INFO L85 PathProgramCache]: Analyzing trace with hash -339251412, now seen corresponding path program 54 times [2025-04-14 00:21:47,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:21:47,333 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117686708] [2025-04-14 00:21:47,333 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:21:47,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:21:47,340 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-14 00:21:47,352 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:21:47,353 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-14 00:21:47,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:47,695 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 29 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:21:47,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:21:47,696 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117686708] [2025-04-14 00:21:47,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117686708] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:21:47,696 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333156715] [2025-04-14 00:21:47,696 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:21:47,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:21:47,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:21:47,698 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:21:47,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2025-04-14 00:21:47,794 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-14 00:21:47,815 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:21:47,816 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-14 00:21:47,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:47,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-14 00:21:47,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:21:48,202 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:21:48,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:21:48,323 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-14 00:21:48,323 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-14 00:21:48,561 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:21:48,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333156715] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:21:48,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:21:48,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 13] total 39 [2025-04-14 00:21:48,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457513510] [2025-04-14 00:21:48,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:21:48,561 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-14 00:21:48,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:21:48,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-14 00:21:48,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1385, Unknown=0, NotChecked=0, Total=1560 [2025-04-14 00:21:48,562 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:21:48,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 676 transitions, 13208 flow. Second operand has 40 states, 40 states have (on average 5.5) internal successors, (220), 40 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:21:48,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:21:48,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:21:48,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:21:50,287 INFO L116 PetriNetUnfolderBase]: 2295/4485 cut-off events. [2025-04-14 00:21:50,288 INFO L117 PetriNetUnfolderBase]: For 482381/482381 co-relation queries the response was YES. [2025-04-14 00:21:50,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58576 conditions, 4485 events. 2295/4485 cut-off events. For 482381/482381 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 33392 event pairs, 206 based on Foata normal form. 6/4490 useless extension candidates. Maximal degree in co-relation 58420. Up to 4282 conditions per place. [2025-04-14 00:21:50,346 INFO L140 encePairwiseOnDemand]: 14/21 looper letters, 655 selfloop transitions, 58 changer transitions 0/715 dead transitions. [2025-04-14 00:21:50,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 715 transitions, 15732 flow [2025-04-14 00:21:50,346 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-14 00:21:50,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-14 00:21:50,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 155 transitions. [2025-04-14 00:21:50,347 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35147392290249435 [2025-04-14 00:21:50,347 INFO L175 Difference]: Start difference. First operand has 369 places, 676 transitions, 13208 flow. Second operand 21 states and 155 transitions. [2025-04-14 00:21:50,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 715 transitions, 15732 flow [2025-04-14 00:21:51,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 715 transitions, 15317 flow, removed 60 selfloop flow, removed 27 redundant places. [2025-04-14 00:21:51,882 INFO L231 Difference]: Finished difference. Result has 363 places, 680 transitions, 13063 flow [2025-04-14 00:21:51,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=12823, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=676, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=620, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=13063, PETRI_PLACES=363, PETRI_TRANSITIONS=680} [2025-04-14 00:21:51,882 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 342 predicate places. [2025-04-14 00:21:51,882 INFO L485 AbstractCegarLoop]: Abstraction has has 363 places, 680 transitions, 13063 flow [2025-04-14 00:21:51,883 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 5.5) internal successors, (220), 40 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:21:51,883 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:21:51,883 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:21:51,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0 [2025-04-14 00:21:52,083 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:21:52,083 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:21:52,084 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:21:52,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1287666061, now seen corresponding path program 55 times [2025-04-14 00:21:52,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:21:52,084 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842296443] [2025-04-14 00:21:52,084 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:21:52,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:21:52,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 00:21:52,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:21:52,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:21:52,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:52,582 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:21:52,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:21:52,582 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842296443] [2025-04-14 00:21:52,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842296443] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:21:52,583 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687342317] [2025-04-14 00:21:52,583 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:21:52,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:21:52,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:21:52,584 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:21:52,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2025-04-14 00:21:52,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 00:21:52,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:21:52,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:21:52,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:52,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-14 00:21:52,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:21:53,085 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:21:53,085 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:21:53,185 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-14 00:21:53,185 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-14 00:21:53,677 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:21:53,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687342317] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:21:53,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:21:53,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 53 [2025-04-14 00:21:53,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210218835] [2025-04-14 00:21:53,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:21:53,678 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-04-14 00:21:53,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:21:53,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-04-14 00:21:53,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=2558, Unknown=0, NotChecked=0, Total=2862 [2025-04-14 00:21:53,679 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:21:53,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 680 transitions, 13063 flow. Second operand has 54 states, 54 states have (on average 5.351851851851852) internal successors, (289), 54 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:21:53,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:21:53,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:21:53,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:21:55,386 INFO L116 PetriNetUnfolderBase]: 2295/4491 cut-off events. [2025-04-14 00:21:55,386 INFO L117 PetriNetUnfolderBase]: For 471717/471717 co-relation queries the response was YES. [2025-04-14 00:21:55,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58162 conditions, 4491 events. 2295/4491 cut-off events. For 471717/471717 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 33427 event pairs, 209 based on Foata normal form. 2/4492 useless extension candidates. Maximal degree in co-relation 58007. Up to 4437 conditions per place. [2025-04-14 00:21:55,434 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 663 selfloop transitions, 25 changer transitions 9/699 dead transitions. [2025-04-14 00:21:55,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 699 transitions, 14659 flow [2025-04-14 00:21:55,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-14 00:21:55,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-14 00:21:55,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 147 transitions. [2025-04-14 00:21:55,435 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3181818181818182 [2025-04-14 00:21:55,435 INFO L175 Difference]: Start difference. First operand has 363 places, 680 transitions, 13063 flow. Second operand 22 states and 147 transitions. [2025-04-14 00:21:55,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 699 transitions, 14659 flow [2025-04-14 00:21:56,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 699 transitions, 14506 flow, removed 20 selfloop flow, removed 20 redundant places. [2025-04-14 00:21:56,743 INFO L231 Difference]: Finished difference. Result has 367 places, 679 transitions, 12951 flow [2025-04-14 00:21:56,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=12911, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=655, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=12951, PETRI_PLACES=367, PETRI_TRANSITIONS=679} [2025-04-14 00:21:56,743 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 346 predicate places. [2025-04-14 00:21:56,743 INFO L485 AbstractCegarLoop]: Abstraction has has 367 places, 679 transitions, 12951 flow [2025-04-14 00:21:56,744 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.351851851851852) internal successors, (289), 54 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:21:56,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:21:56,744 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:21:56,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2025-04-14 00:21:56,944 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable62 [2025-04-14 00:21:56,944 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:21:56,945 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:21:56,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1389795922, now seen corresponding path program 56 times [2025-04-14 00:21:56,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:21:56,945 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739921881] [2025-04-14 00:21:56,945 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:21:56,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:21:56,951 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-14 00:21:56,956 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:21:56,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:21:56,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:57,366 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:21:57,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:21:57,366 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739921881] [2025-04-14 00:21:57,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739921881] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:21:57,366 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534213222] [2025-04-14 00:21:57,367 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:21:57,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:21:57,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:21:57,368 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:21:57,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2025-04-14 00:21:57,567 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-14 00:21:57,610 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:21:57,610 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:21:57,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:57,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-14 00:21:57,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:21:58,159 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:21:58,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:21:58,252 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-14 00:21:58,253 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-14 00:21:58,712 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:21:58,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534213222] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:21:58,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:21:58,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 18] total 52 [2025-04-14 00:21:58,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795034547] [2025-04-14 00:21:58,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:21:58,714 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-04-14 00:21:58,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:21:58,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-04-14 00:21:58,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=2463, Unknown=0, NotChecked=0, Total=2756 [2025-04-14 00:21:58,715 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:21:58,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 679 transitions, 12951 flow. Second operand has 53 states, 53 states have (on average 5.320754716981132) internal successors, (282), 53 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:21:58,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:21:58,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:21:58,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:22:00,537 INFO L116 PetriNetUnfolderBase]: 2349/4579 cut-off events. [2025-04-14 00:22:00,537 INFO L117 PetriNetUnfolderBase]: For 495443/495443 co-relation queries the response was YES. [2025-04-14 00:22:00,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59536 conditions, 4579 events. 2349/4579 cut-off events. For 495443/495443 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 34182 event pairs, 212 based on Foata normal form. 16/4594 useless extension candidates. Maximal degree in co-relation 59379. Up to 4362 conditions per place. [2025-04-14 00:22:00,590 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 660 selfloop transitions, 71 changer transitions 0/733 dead transitions. [2025-04-14 00:22:00,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 733 transitions, 15607 flow [2025-04-14 00:22:00,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-14 00:22:00,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-14 00:22:00,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 173 transitions. [2025-04-14 00:22:00,591 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3295238095238095 [2025-04-14 00:22:00,591 INFO L175 Difference]: Start difference. First operand has 367 places, 679 transitions, 12951 flow. Second operand 25 states and 173 transitions. [2025-04-14 00:22:00,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 733 transitions, 15607 flow [2025-04-14 00:22:02,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 733 transitions, 15537 flow, removed 10 selfloop flow, removed 20 redundant places. [2025-04-14 00:22:02,244 INFO L231 Difference]: Finished difference. Result has 370 places, 697 transitions, 13469 flow [2025-04-14 00:22:02,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=12881, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=608, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=13469, PETRI_PLACES=370, PETRI_TRANSITIONS=697} [2025-04-14 00:22:02,246 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 349 predicate places. [2025-04-14 00:22:02,246 INFO L485 AbstractCegarLoop]: Abstraction has has 370 places, 697 transitions, 13469 flow [2025-04-14 00:22:02,246 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 5.320754716981132) internal successors, (282), 53 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:22:02,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:22:02,247 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:22:02,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Ended with exit code 0 [2025-04-14 00:22:02,450 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2025-04-14 00:22:02,450 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:22:02,451 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:22:02,451 INFO L85 PathProgramCache]: Analyzing trace with hash 420608728, now seen corresponding path program 57 times [2025-04-14 00:22:02,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:22:02,451 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234180781] [2025-04-14 00:22:02,451 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:22:02,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:22:02,459 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-14 00:22:02,479 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:22:02,479 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-14 00:22:02,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:22:02,936 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:22:02,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:22:02,936 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234180781] [2025-04-14 00:22:02,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234180781] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:22:02,936 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093952860] [2025-04-14 00:22:02,937 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:22:02,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:22:02,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:22:02,938 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:22:02,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2025-04-14 00:22:03,041 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-14 00:22:03,137 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:22:03,137 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-14 00:22:03,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:22:03,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-04-14 00:22:03,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:22:03,428 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 00:22:03,768 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:22:03,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:22:04,356 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:22:04,356 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 88 [2025-04-14 00:22:04,370 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2025-04-14 00:22:04,377 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-14 00:22:04,377 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 22 [2025-04-14 00:22:04,385 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:22:04,386 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 164 [2025-04-14 00:22:04,417 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-14 00:22:04,417 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2025-04-14 00:22:04,453 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-14 00:22:04,454 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 194 [2025-04-14 00:22:04,827 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:22:04,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093952860] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:22:04,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:22:04,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 15] total 51 [2025-04-14 00:22:04,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151454378] [2025-04-14 00:22:04,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:22:04,827 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-04-14 00:22:04,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:22:04,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-04-14 00:22:04,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=2339, Unknown=0, NotChecked=0, Total=2652 [2025-04-14 00:22:04,829 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:22:04,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 697 transitions, 13469 flow. Second operand has 52 states, 52 states have (on average 5.403846153846154) internal successors, (281), 52 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:22:04,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:22:04,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:22:04,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:22:07,008 INFO L116 PetriNetUnfolderBase]: 2409/4695 cut-off events. [2025-04-14 00:22:07,008 INFO L117 PetriNetUnfolderBase]: For 525780/525780 co-relation queries the response was YES. [2025-04-14 00:22:07,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62092 conditions, 4695 events. 2409/4695 cut-off events. For 525780/525780 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 35163 event pairs, 209 based on Foata normal form. 12/4706 useless extension candidates. Maximal degree in co-relation 61935. Up to 4473 conditions per place. [2025-04-14 00:22:07,055 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 679 selfloop transitions, 68 changer transitions 2/751 dead transitions. [2025-04-14 00:22:07,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 751 transitions, 16252 flow [2025-04-14 00:22:07,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-14 00:22:07,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-14 00:22:07,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 178 transitions. [2025-04-14 00:22:07,056 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33904761904761904 [2025-04-14 00:22:07,056 INFO L175 Difference]: Start difference. First operand has 370 places, 697 transitions, 13469 flow. Second operand 25 states and 178 transitions. [2025-04-14 00:22:07,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 751 transitions, 16252 flow [2025-04-14 00:22:08,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 751 transitions, 16063 flow, removed 48 selfloop flow, removed 21 redundant places. [2025-04-14 00:22:08,597 INFO L231 Difference]: Finished difference. Result has 375 places, 713 transitions, 13903 flow [2025-04-14 00:22:08,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=13280, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=697, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=13903, PETRI_PLACES=375, PETRI_TRANSITIONS=713} [2025-04-14 00:22:08,598 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 354 predicate places. [2025-04-14 00:22:08,598 INFO L485 AbstractCegarLoop]: Abstraction has has 375 places, 713 transitions, 13903 flow [2025-04-14 00:22:08,599 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 5.403846153846154) internal successors, (281), 52 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:22:08,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:22:08,599 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:22:08,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0 [2025-04-14 00:22:08,799 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:22:08,799 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:22:08,800 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:22:08,800 INFO L85 PathProgramCache]: Analyzing trace with hash -413925381, now seen corresponding path program 58 times [2025-04-14 00:22:08,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:22:08,800 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431305359] [2025-04-14 00:22:08,800 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:22:08,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:22:08,807 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-14 00:22:08,817 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:22:08,817 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:22:08,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:22:09,130 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-14 00:22:09,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:22:09,130 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431305359] [2025-04-14 00:22:09,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431305359] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:22:09,131 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484811098] [2025-04-14 00:22:09,131 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:22:09,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:22:09,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:22:09,133 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:22:09,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2025-04-14 00:22:09,257 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-14 00:22:09,278 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:22:09,278 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:22:09,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:22:09,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-14 00:22:09,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:22:09,409 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-14 00:22:09,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:22:09,480 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-14 00:22:09,480 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-14 00:22:09,544 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-14 00:22:09,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484811098] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:22:09,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:22:09,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 23 [2025-04-14 00:22:09,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633066168] [2025-04-14 00:22:09,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:22:09,544 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-14 00:22:09,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:22:09,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-14 00:22:09,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2025-04-14 00:22:09,545 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:22:09,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 713 transitions, 13903 flow. Second operand has 24 states, 24 states have (on average 6.291666666666667) internal successors, (151), 24 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:22:09,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:22:09,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:22:09,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:22:11,436 INFO L116 PetriNetUnfolderBase]: 2382/4632 cut-off events. [2025-04-14 00:22:11,436 INFO L117 PetriNetUnfolderBase]: For 531363/531363 co-relation queries the response was YES. [2025-04-14 00:22:11,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61664 conditions, 4632 events. 2382/4632 cut-off events. For 531363/531363 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 34746 event pairs, 63 based on Foata normal form. 14/4645 useless extension candidates. Maximal degree in co-relation 61505. Up to 2097 conditions per place. [2025-04-14 00:22:11,483 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 740 selfloop transitions, 141 changer transitions 32/915 dead transitions. [2025-04-14 00:22:11,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 915 transitions, 19809 flow [2025-04-14 00:22:11,483 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-14 00:22:11,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-14 00:22:11,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 189 transitions. [2025-04-14 00:22:11,484 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-04-14 00:22:11,484 INFO L175 Difference]: Start difference. First operand has 375 places, 713 transitions, 13903 flow. Second operand 22 states and 189 transitions. [2025-04-14 00:22:11,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 915 transitions, 19809 flow [2025-04-14 00:22:13,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 915 transitions, 19594 flow, removed 58 selfloop flow, removed 22 redundant places. [2025-04-14 00:22:13,118 INFO L231 Difference]: Finished difference. Result has 378 places, 714 transitions, 14506 flow [2025-04-14 00:22:13,118 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=13648, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=711, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=14506, PETRI_PLACES=378, PETRI_TRANSITIONS=714} [2025-04-14 00:22:13,119 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 357 predicate places. [2025-04-14 00:22:13,119 INFO L485 AbstractCegarLoop]: Abstraction has has 378 places, 714 transitions, 14506 flow [2025-04-14 00:22:13,119 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 6.291666666666667) internal successors, (151), 24 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:22:13,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:22:13,119 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:22:13,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2025-04-14 00:22:13,319 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:22:13,320 INFO L403 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:22:13,320 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:22:13,320 INFO L85 PathProgramCache]: Analyzing trace with hash -82795778, now seen corresponding path program 59 times [2025-04-14 00:22:13,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:22:13,321 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698204752] [2025-04-14 00:22:13,321 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:22:13,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:22:13,329 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-14 00:22:13,336 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:22:13,337 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:22:13,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:22:13,606 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-14 00:22:13,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:22:13,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698204752] [2025-04-14 00:22:13,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698204752] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:22:13,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409322567] [2025-04-14 00:22:13,607 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:22:13,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:22:13,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:22:13,610 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:22:13,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2025-04-14 00:22:13,744 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-14 00:22:13,772 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:22:13,773 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:22:13,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:22:13,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-14 00:22:13,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:22:13,899 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-14 00:22:13,899 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:22:13,946 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-14 00:22:13,946 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-14 00:22:14,016 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-14 00:22:14,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409322567] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:22:14,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:22:14,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 21 [2025-04-14 00:22:14,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075730832] [2025-04-14 00:22:14,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:22:14,017 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-14 00:22:14,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:22:14,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-14 00:22:14,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2025-04-14 00:22:14,018 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:22:14,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 714 transitions, 14506 flow. Second operand has 22 states, 22 states have (on average 6.454545454545454) internal successors, (142), 22 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:22:14,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:22:14,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:22:14,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:22:16,290 INFO L116 PetriNetUnfolderBase]: 2532/4910 cut-off events. [2025-04-14 00:22:16,290 INFO L117 PetriNetUnfolderBase]: For 654768/654768 co-relation queries the response was YES. [2025-04-14 00:22:16,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67895 conditions, 4910 events. 2532/4910 cut-off events. For 654768/654768 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 36881 event pairs, 197 based on Foata normal form. 68/4977 useless extension candidates. Maximal degree in co-relation 67734. Up to 3905 conditions per place. [2025-04-14 00:22:16,369 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 684 selfloop transitions, 202 changer transitions 2/890 dead transitions. [2025-04-14 00:22:16,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 890 transitions, 22041 flow [2025-04-14 00:22:16,370 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-14 00:22:16,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-04-14 00:22:16,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 320 transitions. [2025-04-14 00:22:16,370 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46176046176046176 [2025-04-14 00:22:16,371 INFO L175 Difference]: Start difference. First operand has 378 places, 714 transitions, 14506 flow. Second operand 33 states and 320 transitions. [2025-04-14 00:22:16,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 890 transitions, 22041 flow [2025-04-14 00:22:18,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 890 transitions, 21343 flow, removed 281 selfloop flow, removed 10 redundant places. [2025-04-14 00:22:18,740 INFO L231 Difference]: Finished difference. Result has 413 places, 774 transitions, 15946 flow [2025-04-14 00:22:18,740 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=13902, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=714, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=15946, PETRI_PLACES=413, PETRI_TRANSITIONS=774} [2025-04-14 00:22:18,740 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 392 predicate places. [2025-04-14 00:22:18,740 INFO L485 AbstractCegarLoop]: Abstraction has has 413 places, 774 transitions, 15946 flow [2025-04-14 00:22:18,741 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.454545454545454) internal successors, (142), 22 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:22:18,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:22:18,741 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:22:18,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2025-04-14 00:22:18,941 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2025-04-14 00:22:18,941 INFO L403 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:22:18,942 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:22:18,942 INFO L85 PathProgramCache]: Analyzing trace with hash 759187498, now seen corresponding path program 60 times [2025-04-14 00:22:18,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:22:18,942 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914553866] [2025-04-14 00:22:18,942 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:22:18,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:22:18,950 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 3 equivalence classes. [2025-04-14 00:22:18,967 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:22:18,967 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:22:18,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:22:19,442 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:22:19,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:22:19,442 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914553866] [2025-04-14 00:22:19,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914553866] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:22:19,442 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213714924] [2025-04-14 00:22:19,442 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:22:19,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:22:19,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:22:19,444 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:22:19,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2025-04-14 00:22:19,558 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 3 equivalence classes. [2025-04-14 00:22:19,580 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:22:19,580 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:22:19,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:22:19,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-14 00:22:19,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:22:20,097 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:22:20,097 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:22:20,205 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-14 00:22:20,205 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-14 00:22:20,672 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:22:20,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213714924] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:22:20,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:22:20,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 18] total 51 [2025-04-14 00:22:20,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597624062] [2025-04-14 00:22:20,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:22:20,672 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-04-14 00:22:20,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:22:20,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-04-14 00:22:20,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=2371, Unknown=0, NotChecked=0, Total=2652 [2025-04-14 00:22:20,673 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:22:20,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 774 transitions, 15946 flow. Second operand has 52 states, 52 states have (on average 5.326923076923077) internal successors, (277), 52 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:22:20,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:22:20,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:22:20,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:22:22,873 INFO L116 PetriNetUnfolderBase]: 2535/4923 cut-off events. [2025-04-14 00:22:22,873 INFO L117 PetriNetUnfolderBase]: For 828657/828657 co-relation queries the response was YES. [2025-04-14 00:22:22,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72939 conditions, 4923 events. 2535/4923 cut-off events. For 828657/828657 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 37098 event pairs, 214 based on Foata normal form. 3/4925 useless extension candidates. Maximal degree in co-relation 72763. Up to 4859 conditions per place. [2025-04-14 00:22:22,931 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 761 selfloop transitions, 25 changer transitions 11/799 dead transitions. [2025-04-14 00:22:22,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 799 transitions, 17757 flow [2025-04-14 00:22:22,932 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-14 00:22:22,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-14 00:22:22,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 151 transitions. [2025-04-14 00:22:22,932 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3268398268398268 [2025-04-14 00:22:22,932 INFO L175 Difference]: Start difference. First operand has 413 places, 774 transitions, 15946 flow. Second operand 22 states and 151 transitions. [2025-04-14 00:22:22,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 799 transitions, 17757 flow [2025-04-14 00:22:25,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 799 transitions, 16853 flow, removed 267 selfloop flow, removed 13 redundant places. [2025-04-14 00:22:25,982 INFO L231 Difference]: Finished difference. Result has 424 places, 775 transitions, 15118 flow [2025-04-14 00:22:25,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=15042, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=774, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=749, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=15118, PETRI_PLACES=424, PETRI_TRANSITIONS=775} [2025-04-14 00:22:25,983 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 403 predicate places. [2025-04-14 00:22:25,983 INFO L485 AbstractCegarLoop]: Abstraction has has 424 places, 775 transitions, 15118 flow [2025-04-14 00:22:25,983 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 5.326923076923077) internal successors, (277), 52 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:22:25,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:22:25,983 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:22:25,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Ended with exit code 0 [2025-04-14 00:22:26,183 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2025-04-14 00:22:26,184 INFO L403 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:22:26,184 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:22:26,184 INFO L85 PathProgramCache]: Analyzing trace with hash -19630789, now seen corresponding path program 61 times [2025-04-14 00:22:26,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:22:26,184 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687522778] [2025-04-14 00:22:26,185 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:22:26,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:22:26,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 00:22:26,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:22:26,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:22:26,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:22:26,786 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:22:26,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:22:26,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687522778] [2025-04-14 00:22:26,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687522778] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:22:26,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036299821] [2025-04-14 00:22:26,787 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:22:26,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:22:26,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:22:26,788 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:22:26,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2025-04-14 00:22:26,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 00:22:26,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:22:26,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:22:26,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:22:26,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-14 00:22:26,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:22:27,306 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:22:27,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:22:27,368 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-14 00:22:27,368 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-14 00:22:27,863 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:22:27,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036299821] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:22:27,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:22:27,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 53 [2025-04-14 00:22:27,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352406894] [2025-04-14 00:22:27,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:22:27,864 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-04-14 00:22:27,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:22:27,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-04-14 00:22:27,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=2547, Unknown=0, NotChecked=0, Total=2862 [2025-04-14 00:22:27,865 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:22:27,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 775 transitions, 15118 flow. Second operand has 54 states, 54 states have (on average 5.351851851851852) internal successors, (289), 54 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:22:27,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:22:27,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:22:27,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:22:30,041 INFO L116 PetriNetUnfolderBase]: 2537/4924 cut-off events. [2025-04-14 00:22:30,042 INFO L117 PetriNetUnfolderBase]: For 851855/851855 co-relation queries the response was YES. [2025-04-14 00:22:30,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72418 conditions, 4924 events. 2537/4924 cut-off events. For 851855/851855 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 36946 event pairs, 198 based on Foata normal form. 5/4928 useless extension candidates. Maximal degree in co-relation 72238. Up to 4744 conditions per place. [2025-04-14 00:22:30,096 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 759 selfloop transitions, 45 changer transitions 3/809 dead transitions. [2025-04-14 00:22:30,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 809 transitions, 17737 flow [2025-04-14 00:22:30,097 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-14 00:22:30,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-04-14 00:22:30,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 165 transitions. [2025-04-14 00:22:30,098 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3416149068322981 [2025-04-14 00:22:30,098 INFO L175 Difference]: Start difference. First operand has 424 places, 775 transitions, 15118 flow. Second operand 23 states and 165 transitions. [2025-04-14 00:22:30,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 809 transitions, 17737 flow [2025-04-14 00:22:33,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 809 transitions, 17678 flow, removed 6 selfloop flow, removed 19 redundant places. [2025-04-14 00:22:33,180 INFO L231 Difference]: Finished difference. Result has 425 places, 776 transitions, 15202 flow [2025-04-14 00:22:33,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=15059, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=775, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=730, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=15202, PETRI_PLACES=425, PETRI_TRANSITIONS=776} [2025-04-14 00:22:33,181 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 404 predicate places. [2025-04-14 00:22:33,181 INFO L485 AbstractCegarLoop]: Abstraction has has 425 places, 776 transitions, 15202 flow [2025-04-14 00:22:33,181 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.351851851851852) internal successors, (289), 54 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:22:33,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:22:33,181 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:22:33,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Ended with exit code 0 [2025-04-14 00:22:33,382 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:22:33,382 INFO L403 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:22:33,383 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:22:33,383 INFO L85 PathProgramCache]: Analyzing trace with hash -2121542213, now seen corresponding path program 62 times [2025-04-14 00:22:33,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:22:33,383 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803516108] [2025-04-14 00:22:33,383 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:22:33,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:22:33,391 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-14 00:22:33,400 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:22:33,401 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:22:33,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:22:33,823 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:22:33,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:22:33,823 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803516108] [2025-04-14 00:22:33,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803516108] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:22:33,823 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583342387] [2025-04-14 00:22:33,823 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:22:33,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:22:33,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:22:33,825 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:22:33,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2025-04-14 00:22:33,940 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-14 00:22:33,961 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:22:33,961 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:22:33,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:22:33,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-14 00:22:33,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:22:34,427 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:22:34,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:22:34,530 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-14 00:22:34,530 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-14 00:22:35,122 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:22:35,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583342387] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:22:35,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:22:35,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 18] total 50 [2025-04-14 00:22:35,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288721116] [2025-04-14 00:22:35,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:22:35,123 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-04-14 00:22:35,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:22:35,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-04-14 00:22:35,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=2267, Unknown=0, NotChecked=0, Total=2550 [2025-04-14 00:22:35,124 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:22:35,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 776 transitions, 15202 flow. Second operand has 51 states, 51 states have (on average 5.372549019607843) internal successors, (274), 51 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:22:35,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:22:35,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:22:35,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:22:37,400 INFO L116 PetriNetUnfolderBase]: 2544/4936 cut-off events. [2025-04-14 00:22:37,400 INFO L117 PetriNetUnfolderBase]: For 871274/871274 co-relation queries the response was YES. [2025-04-14 00:22:37,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73198 conditions, 4936 events. 2544/4936 cut-off events. For 871274/871274 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 37039 event pairs, 177 based on Foata normal form. 5/4940 useless extension candidates. Maximal degree in co-relation 73019. Up to 4739 conditions per place. [2025-04-14 00:22:37,567 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 763 selfloop transitions, 48 changer transitions 2/815 dead transitions. [2025-04-14 00:22:37,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 815 transitions, 17610 flow [2025-04-14 00:22:37,568 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-14 00:22:37,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-14 00:22:37,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 171 transitions. [2025-04-14 00:22:37,568 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3392857142857143 [2025-04-14 00:22:37,568 INFO L175 Difference]: Start difference. First operand has 425 places, 776 transitions, 15202 flow. Second operand 24 states and 171 transitions. [2025-04-14 00:22:37,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 815 transitions, 17610 flow [2025-04-14 00:22:40,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 815 transitions, 17509 flow, removed 9 selfloop flow, removed 20 redundant places. [2025-04-14 00:22:40,746 INFO L231 Difference]: Finished difference. Result has 430 places, 778 transitions, 15279 flow [2025-04-14 00:22:40,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=15101, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=776, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=728, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=15279, PETRI_PLACES=430, PETRI_TRANSITIONS=778} [2025-04-14 00:22:40,747 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 409 predicate places. [2025-04-14 00:22:40,747 INFO L485 AbstractCegarLoop]: Abstraction has has 430 places, 778 transitions, 15279 flow [2025-04-14 00:22:40,747 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 5.372549019607843) internal successors, (274), 51 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:22:40,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:22:40,747 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:22:40,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2025-04-14 00:22:40,947 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2025-04-14 00:22:40,948 INFO L403 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:22:40,948 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:22:40,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1738368540, now seen corresponding path program 63 times [2025-04-14 00:22:40,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:22:40,948 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911775161] [2025-04-14 00:22:40,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:22:40,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:22:40,956 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 3 equivalence classes. [2025-04-14 00:22:40,964 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:22:40,965 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 00:22:40,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:22:41,165 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-14 00:22:41,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:22:41,165 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911775161] [2025-04-14 00:22:41,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911775161] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:22:41,166 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286429247] [2025-04-14 00:22:41,166 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:22:41,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:22:41,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:22:41,168 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:22:41,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2025-04-14 00:22:41,284 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 3 equivalence classes. [2025-04-14 00:22:41,305 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:22:41,306 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 00:22:41,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:22:41,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-14 00:22:41,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:22:41,608 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:22:41,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:22:41,689 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-14 00:22:41,689 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-14 00:22:41,927 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:22:41,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286429247] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:22:41,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:22:41,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 13] total 36 [2025-04-14 00:22:41,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583124352] [2025-04-14 00:22:41,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:22:41,928 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-14 00:22:41,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:22:41,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-14 00:22:41,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1188, Unknown=0, NotChecked=0, Total=1332 [2025-04-14 00:22:41,929 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:22:41,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 778 transitions, 15279 flow. Second operand has 37 states, 37 states have (on average 5.702702702702703) internal successors, (211), 37 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:22:41,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:22:41,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:22:41,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:22:44,285 INFO L116 PetriNetUnfolderBase]: 2638/5140 cut-off events. [2025-04-14 00:22:44,285 INFO L117 PetriNetUnfolderBase]: For 936117/936117 co-relation queries the response was YES. [2025-04-14 00:22:44,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77240 conditions, 5140 events. 2638/5140 cut-off events. For 936117/936117 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 39195 event pairs, 204 based on Foata normal form. 13/5152 useless extension candidates. Maximal degree in co-relation 77059. Up to 4340 conditions per place. [2025-04-14 00:22:44,358 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 683 selfloop transitions, 151 changer transitions 23/859 dead transitions. [2025-04-14 00:22:44,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 859 transitions, 18979 flow [2025-04-14 00:22:44,359 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-14 00:22:44,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-14 00:22:44,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 193 transitions. [2025-04-14 00:22:44,359 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38293650793650796 [2025-04-14 00:22:44,359 INFO L175 Difference]: Start difference. First operand has 430 places, 778 transitions, 15279 flow. Second operand 24 states and 193 transitions. [2025-04-14 00:22:44,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 859 transitions, 18979 flow [2025-04-14 00:22:47,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 859 transitions, 18837 flow, removed 24 selfloop flow, removed 21 redundant places. [2025-04-14 00:22:47,806 INFO L231 Difference]: Finished difference. Result has 439 places, 798 transitions, 16245 flow [2025-04-14 00:22:47,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=15139, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=778, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=627, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=16245, PETRI_PLACES=439, PETRI_TRANSITIONS=798} [2025-04-14 00:22:47,807 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 418 predicate places. [2025-04-14 00:22:47,807 INFO L485 AbstractCegarLoop]: Abstraction has has 439 places, 798 transitions, 16245 flow [2025-04-14 00:22:47,807 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 5.702702702702703) internal successors, (211), 37 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:22:47,807 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:22:47,807 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:22:47,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Ended with exit code 0 [2025-04-14 00:22:48,008 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:22:48,008 INFO L403 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:22:48,009 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:22:48,009 INFO L85 PathProgramCache]: Analyzing trace with hash 592632190, now seen corresponding path program 64 times [2025-04-14 00:22:48,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:22:48,009 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417575963] [2025-04-14 00:22:48,009 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:22:48,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:22:48,016 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-14 00:22:48,022 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:22:48,023 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:22:48,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:22:48,257 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-14 00:22:48,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:22:48,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417575963] [2025-04-14 00:22:48,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417575963] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:22:48,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187913583] [2025-04-14 00:22:48,257 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:22:48,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:22:48,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:22:48,259 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:22:48,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2025-04-14 00:22:48,394 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-14 00:22:48,420 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:22:48,420 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:22:48,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:22:48,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-14 00:22:48,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:22:48,669 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-14 00:22:48,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:22:48,719 INFO L325 Elim1Store]: treesize reduction 24, result has 68.8 percent of original size [2025-04-14 00:22:48,719 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 71 [2025-04-14 00:22:48,793 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-14 00:22:48,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187913583] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:22:48,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:22:48,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 6] total 22 [2025-04-14 00:22:48,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279377367] [2025-04-14 00:22:48,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:22:48,794 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-14 00:22:48,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:22:48,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-14 00:22:48,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2025-04-14 00:22:48,795 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:22:48,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 798 transitions, 16245 flow. Second operand has 23 states, 23 states have (on average 6.391304347826087) internal successors, (147), 23 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:22:48,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:22:48,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:22:48,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:22:50,943 INFO L116 PetriNetUnfolderBase]: 2644/5144 cut-off events. [2025-04-14 00:22:50,943 INFO L117 PetriNetUnfolderBase]: For 1011924/1011924 co-relation queries the response was YES. [2025-04-14 00:22:50,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79621 conditions, 5144 events. 2644/5144 cut-off events. For 1011924/1011924 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 39186 event pairs, 229 based on Foata normal form. 24/5167 useless extension candidates. Maximal degree in co-relation 79433. Up to 4555 conditions per place. [2025-04-14 00:22:51,004 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 675 selfloop transitions, 177 changer transitions 4/858 dead transitions. [2025-04-14 00:22:51,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 858 transitions, 19321 flow [2025-04-14 00:22:51,004 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-14 00:22:51,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-14 00:22:51,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 179 transitions. [2025-04-14 00:22:51,005 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4261904761904762 [2025-04-14 00:22:51,005 INFO L175 Difference]: Start difference. First operand has 439 places, 798 transitions, 16245 flow. Second operand 20 states and 179 transitions. [2025-04-14 00:22:51,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 858 transitions, 19321 flow [2025-04-14 00:22:54,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 858 transitions, 19087 flow, removed 77 selfloop flow, removed 17 redundant places. [2025-04-14 00:22:54,385 INFO L231 Difference]: Finished difference. Result has 444 places, 814 transitions, 17008 flow [2025-04-14 00:22:54,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=16011, PETRI_DIFFERENCE_MINUEND_PLACES=419, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=798, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=635, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=17008, PETRI_PLACES=444, PETRI_TRANSITIONS=814} [2025-04-14 00:22:54,386 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 423 predicate places. [2025-04-14 00:22:54,386 INFO L485 AbstractCegarLoop]: Abstraction has has 444 places, 814 transitions, 17008 flow [2025-04-14 00:22:54,386 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.391304347826087) internal successors, (147), 23 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:22:54,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:22:54,386 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:22:54,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2025-04-14 00:22:54,586 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:22:54,587 INFO L403 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:22:54,587 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:22:54,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1192072488, now seen corresponding path program 65 times [2025-04-14 00:22:54,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:22:54,587 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966533534] [2025-04-14 00:22:54,587 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:22:54,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:22:54,594 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 3 equivalence classes. [2025-04-14 00:22:54,600 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:22:54,600 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 00:22:54,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:22:54,795 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-14 00:22:54,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:22:54,796 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966533534] [2025-04-14 00:22:54,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966533534] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:22:54,796 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621270022] [2025-04-14 00:22:54,796 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:22:54,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:22:54,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:22:54,798 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:22:54,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2025-04-14 00:22:54,935 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 3 equivalence classes. [2025-04-14 00:22:54,968 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:22:54,968 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 00:22:54,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:22:54,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-14 00:22:54,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:22:55,218 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-14 00:22:55,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:22:55,270 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-14 00:22:55,270 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-14 00:22:55,346 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-14 00:22:55,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621270022] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:22:55,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:22:55,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 27 [2025-04-14 00:22:55,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096183730] [2025-04-14 00:22:55,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:22:55,347 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-14 00:22:55,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:22:55,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-14 00:22:55,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2025-04-14 00:22:55,347 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:22:55,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 814 transitions, 17008 flow. Second operand has 28 states, 28 states have (on average 5.964285714285714) internal successors, (167), 28 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:22:55,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:22:55,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:22:55,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:22:57,899 INFO L116 PetriNetUnfolderBase]: 2690/5204 cut-off events. [2025-04-14 00:22:57,900 INFO L117 PetriNetUnfolderBase]: For 1079667/1079667 co-relation queries the response was YES. [2025-04-14 00:22:57,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80854 conditions, 5204 events. 2690/5204 cut-off events. For 1079667/1079667 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 39493 event pairs, 212 based on Foata normal form. 56/5259 useless extension candidates. Maximal degree in co-relation 80664. Up to 4080 conditions per place. [2025-04-14 00:22:57,967 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 656 selfloop transitions, 243 changer transitions 2/903 dead transitions. [2025-04-14 00:22:57,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 465 places, 903 transitions, 21991 flow [2025-04-14 00:22:57,968 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-14 00:22:57,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-14 00:22:57,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 196 transitions. [2025-04-14 00:22:57,969 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2025-04-14 00:22:57,969 INFO L175 Difference]: Start difference. First operand has 444 places, 814 transitions, 17008 flow. Second operand 22 states and 196 transitions. [2025-04-14 00:22:57,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 465 places, 903 transitions, 21991 flow [2025-04-14 00:23:01,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 903 transitions, 21513 flow, removed 171 selfloop flow, removed 11 redundant places. [2025-04-14 00:23:01,675 INFO L231 Difference]: Finished difference. Result has 462 places, 844 transitions, 18380 flow [2025-04-14 00:23:01,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=16534, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=814, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=215, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=18380, PETRI_PLACES=462, PETRI_TRANSITIONS=844} [2025-04-14 00:23:01,676 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 441 predicate places. [2025-04-14 00:23:01,676 INFO L485 AbstractCegarLoop]: Abstraction has has 462 places, 844 transitions, 18380 flow [2025-04-14 00:23:01,676 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.964285714285714) internal successors, (167), 28 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:23:01,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:23:01,677 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:23:01,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Ended with exit code 0 [2025-04-14 00:23:01,877 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable72 [2025-04-14 00:23:01,890 INFO L403 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:23:01,891 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:23:01,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1211193165, now seen corresponding path program 66 times [2025-04-14 00:23:01,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:23:01,892 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526494348] [2025-04-14 00:23:01,892 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:23:01,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:23:01,903 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-14 00:23:01,920 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:23:01,920 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-14 00:23:01,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:23:02,352 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:23:02,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:23:02,353 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526494348] [2025-04-14 00:23:02,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526494348] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:23:02,353 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021968914] [2025-04-14 00:23:02,353 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:23:02,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:23:02,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:23:02,355 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:23:02,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2025-04-14 00:23:02,498 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-14 00:23:02,576 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:23:02,576 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-14 00:23:02,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:23:02,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-04-14 00:23:02,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:23:02,842 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 00:23:03,180 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:23:03,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:23:04,264 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:23:04,264 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 83 [2025-04-14 00:23:04,285 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2025-04-14 00:23:04,295 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:23:04,295 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 83 [2025-04-14 00:23:04,319 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:23:04,320 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 27 [2025-04-14 00:23:04,335 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:23:04,336 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 159 [2025-04-14 00:23:04,347 INFO L325 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-04-14 00:23:04,348 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 40 [2025-04-14 00:23:04,414 INFO L325 Elim1Store]: treesize reduction 15, result has 78.9 percent of original size [2025-04-14 00:23:04,415 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 187 treesize of output 190 [2025-04-14 00:23:05,172 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:23:05,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021968914] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:23:05,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:23:05,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 19] total 51 [2025-04-14 00:23:05,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745340909] [2025-04-14 00:23:05,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:23:05,172 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-04-14 00:23:05,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:23:05,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-04-14 00:23:05,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=2335, Unknown=0, NotChecked=0, Total=2652 [2025-04-14 00:23:05,173 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:23:05,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 844 transitions, 18380 flow. Second operand has 52 states, 52 states have (on average 5.346153846153846) internal successors, (278), 52 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:23:05,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:23:05,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:23:05,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:23:17,406 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 00:23:22,055 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 00:23:24,262 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 00:23:36,569 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 00:23:41,529 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 00:23:46,500 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 00:23:49,338 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 00:23:51,636 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 00:23:53,126 INFO L116 PetriNetUnfolderBase]: 13554/26870 cut-off events. [2025-04-14 00:23:53,126 INFO L117 PetriNetUnfolderBase]: For 6978890/6978890 co-relation queries the response was YES. [2025-04-14 00:23:53,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464377 conditions, 26870 events. 13554/26870 cut-off events. For 6978890/6978890 co-relation queries the response was YES. Maximal size of possible extension queue 1472. Compared 261035 event pairs, 1397 based on Foata normal form. 282/27151 useless extension candidates. Maximal degree in co-relation 462531. Up to 8370 conditions per place. [2025-04-14 00:23:53,538 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 1405 selfloop transitions, 2931 changer transitions 93/4431 dead transitions. [2025-04-14 00:23:53,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 4431 transitions, 110165 flow [2025-04-14 00:23:53,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2025-04-14 00:23:53,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2025-04-14 00:23:53,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 734 transitions. [2025-04-14 00:23:53,540 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42111302352266206 [2025-04-14 00:23:53,540 INFO L175 Difference]: Start difference. First operand has 462 places, 844 transitions, 18380 flow. Second operand 83 states and 734 transitions. [2025-04-14 00:23:53,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 4431 transitions, 110165 flow [2025-04-14 00:24:30,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 520 places, 4431 transitions, 106282 flow, removed 1106 selfloop flow, removed 24 redundant places. [2025-04-14 00:24:30,413 INFO L231 Difference]: Finished difference. Result has 583 places, 3876 transitions, 96773 flow [2025-04-14 00:24:30,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=17610, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=844, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=503, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=83, PETRI_FLOW=96773, PETRI_PLACES=583, PETRI_TRANSITIONS=3876} [2025-04-14 00:24:30,415 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 562 predicate places. [2025-04-14 00:24:30,415 INFO L485 AbstractCegarLoop]: Abstraction has has 583 places, 3876 transitions, 96773 flow [2025-04-14 00:24:30,415 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 5.346153846153846) internal successors, (278), 52 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:24:30,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:24:30,415 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:24:30,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Ended with exit code 0 [2025-04-14 00:24:30,615 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:24:30,616 INFO L403 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:24:30,616 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:24:30,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1220915165, now seen corresponding path program 67 times [2025-04-14 00:24:30,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:24:30,617 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331022332] [2025-04-14 00:24:30,617 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:24:30,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:24:30,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 00:24:30,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:24:30,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:24:30,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:24:31,100 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:24:31,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:24:31,101 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331022332] [2025-04-14 00:24:31,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331022332] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:24:31,101 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057221936] [2025-04-14 00:24:31,101 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:24:31,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:24:31,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:24:31,103 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:24:31,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2025-04-14 00:24:31,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 00:24:31,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:24:31,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:24:31,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:24:31,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-14 00:24:31,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:24:31,653 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:24:31,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:24:31,758 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-14 00:24:31,758 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-14 00:24:32,232 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 23 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:24:32,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057221936] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:24:32,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:24:32,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 53 [2025-04-14 00:24:32,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716812782] [2025-04-14 00:24:32,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:24:32,232 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-04-14 00:24:32,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:24:32,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-04-14 00:24:32,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=2556, Unknown=0, NotChecked=0, Total=2862 [2025-04-14 00:24:32,233 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:24:32,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 583 places, 3876 transitions, 96773 flow. Second operand has 54 states, 54 states have (on average 5.351851851851852) internal successors, (289), 54 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:24:32,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:24:32,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:24:32,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:25:00,763 INFO L116 PetriNetUnfolderBase]: 13346/26377 cut-off events. [2025-04-14 00:25:00,763 INFO L117 PetriNetUnfolderBase]: For 7882858/7882858 co-relation queries the response was YES. [2025-04-14 00:25:01,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496084 conditions, 26377 events. 13346/26377 cut-off events. For 7882858/7882858 co-relation queries the response was YES. Maximal size of possible extension queue 1430. Compared 255183 event pairs, 1063 based on Foata normal form. 4/26379 useless extension candidates. Maximal degree in co-relation 495777. Up to 26286 conditions per place. [2025-04-14 00:25:01,375 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 3841 selfloop transitions, 39 changer transitions 11/3893 dead transitions. [2025-04-14 00:25:01,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 599 places, 3893 transitions, 104958 flow [2025-04-14 00:25:01,376 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-14 00:25:01,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-14 00:25:01,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 132 transitions. [2025-04-14 00:25:01,376 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3142857142857143 [2025-04-14 00:25:01,376 INFO L175 Difference]: Start difference. First operand has 583 places, 3876 transitions, 96773 flow. Second operand 20 states and 132 transitions. [2025-04-14 00:25:01,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 599 places, 3893 transitions, 104958 flow [2025-04-14 00:26:05,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 591 places, 3893 transitions, 99595 flow, removed 2641 selfloop flow, removed 8 redundant places. [2025-04-14 00:26:05,546 INFO L231 Difference]: Finished difference. Result has 594 places, 3874 transitions, 91458 flow [2025-04-14 00:26:05,549 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=91410, PETRI_DIFFERENCE_MINUEND_PLACES=572, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3876, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3837, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=91458, PETRI_PLACES=594, PETRI_TRANSITIONS=3874} [2025-04-14 00:26:05,549 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 573 predicate places. [2025-04-14 00:26:05,549 INFO L485 AbstractCegarLoop]: Abstraction has has 594 places, 3874 transitions, 91458 flow [2025-04-14 00:26:05,549 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.351851851851852) internal successors, (289), 54 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:26:05,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:26:05,549 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:26:05,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Ended with exit code 0 [2025-04-14 00:26:05,750 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:26:05,750 INFO L403 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:26:05,751 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:26:05,751 INFO L85 PathProgramCache]: Analyzing trace with hash 2094655845, now seen corresponding path program 68 times [2025-04-14 00:26:05,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:26:05,751 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899980266] [2025-04-14 00:26:05,751 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:26:05,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:26:05,760 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-14 00:26:05,769 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:26:05,769 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:26:05,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:26:06,308 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:26:06,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:26:06,308 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899980266] [2025-04-14 00:26:06,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899980266] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:26:06,308 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743115347] [2025-04-14 00:26:06,308 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:26:06,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:26:06,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:26:06,310 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:26:06,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2025-04-14 00:26:06,431 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-14 00:26:06,450 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:26:06,450 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:26:06,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:26:06,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-14 00:26:06,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:26:07,018 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:26:07,019 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:26:07,121 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-14 00:26:07,121 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-14 00:26:07,723 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:26:07,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743115347] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:26:07,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:26:07,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 18] total 54 [2025-04-14 00:26:07,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104752961] [2025-04-14 00:26:07,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:26:07,723 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-04-14 00:26:07,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:26:07,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-04-14 00:26:07,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=2678, Unknown=0, NotChecked=0, Total=2970 [2025-04-14 00:26:07,724 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:26:07,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 594 places, 3874 transitions, 91458 flow. Second operand has 55 states, 55 states have (on average 5.327272727272727) internal successors, (293), 55 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:26:07,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:26:07,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:26:07,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:26:39,089 INFO L116 PetriNetUnfolderBase]: 13396/26471 cut-off events. [2025-04-14 00:26:39,089 INFO L117 PetriNetUnfolderBase]: For 7468305/7468305 co-relation queries the response was YES. [2025-04-14 00:26:39,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476370 conditions, 26471 events. 13396/26471 cut-off events. For 7468305/7468305 co-relation queries the response was YES. Maximal size of possible extension queue 1428. Compared 255866 event pairs, 1065 based on Foata normal form. 4/26473 useless extension candidates. Maximal degree in co-relation 476118. Up to 26290 conditions per place. [2025-04-14 00:26:39,732 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 3843 selfloop transitions, 76 changer transitions 12/3933 dead transitions. [2025-04-14 00:26:39,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 619 places, 3933 transitions, 100756 flow [2025-04-14 00:26:39,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-14 00:26:39,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-04-14 00:26:39,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 199 transitions. [2025-04-14 00:26:39,733 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32676518883415434 [2025-04-14 00:26:39,733 INFO L175 Difference]: Start difference. First operand has 594 places, 3874 transitions, 91458 flow. Second operand 29 states and 199 transitions. [2025-04-14 00:26:39,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 619 places, 3933 transitions, 100756 flow [2025-04-14 00:27:31,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 3933 transitions, 100562 flow, removed 34 selfloop flow, removed 18 redundant places. [2025-04-14 00:27:31,976 INFO L231 Difference]: Finished difference. Result has 605 places, 3901 transitions, 92198 flow [2025-04-14 00:27:31,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=91344, PETRI_DIFFERENCE_MINUEND_PLACES=573, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3874, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3826, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=92198, PETRI_PLACES=605, PETRI_TRANSITIONS=3901} [2025-04-14 00:27:31,979 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 584 predicate places. [2025-04-14 00:27:31,979 INFO L485 AbstractCegarLoop]: Abstraction has has 605 places, 3901 transitions, 92198 flow [2025-04-14 00:27:31,979 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 5.327272727272727) internal successors, (293), 55 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:27:31,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:27:31,979 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:27:31,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Ended with exit code 0 [2025-04-14 00:27:32,180 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:27:32,180 INFO L403 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:27:32,181 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:27:32,181 INFO L85 PathProgramCache]: Analyzing trace with hash 801562065, now seen corresponding path program 69 times [2025-04-14 00:27:32,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:27:32,181 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952807831] [2025-04-14 00:27:32,181 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:27:32,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:27:32,188 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 3 equivalence classes. [2025-04-14 00:27:32,196 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:27:32,196 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 00:27:32,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:27:32,626 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:27:32,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:27:32,626 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952807831] [2025-04-14 00:27:32,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952807831] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:27:32,626 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163657294] [2025-04-14 00:27:32,626 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:27:32,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:27:32,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:27:32,628 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:27:32,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2025-04-14 00:27:32,763 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 3 equivalence classes. [2025-04-14 00:27:32,786 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:27:32,786 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 00:27:32,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:27:32,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-14 00:27:32,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:27:33,163 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:27:33,163 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:27:33,326 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-14 00:27:33,327 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-14 00:27:33,578 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:27:33,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163657294] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:27:33,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:27:33,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 13] total 45 [2025-04-14 00:27:33,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885784901] [2025-04-14 00:27:33,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:27:33,579 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-14 00:27:33,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:27:33,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-14 00:27:33,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1848, Unknown=0, NotChecked=0, Total=2070 [2025-04-14 00:27:33,580 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:27:33,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 605 places, 3901 transitions, 92198 flow. Second operand has 46 states, 46 states have (on average 5.456521739130435) internal successors, (251), 46 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:27:33,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:27:33,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:27:33,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:28:03,234 INFO L116 PetriNetUnfolderBase]: 13381/26433 cut-off events. [2025-04-14 00:28:03,234 INFO L117 PetriNetUnfolderBase]: For 7562767/7562767 co-relation queries the response was YES. [2025-04-14 00:28:03,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477703 conditions, 26433 events. 13381/26433 cut-off events. For 7562767/7562767 co-relation queries the response was YES. Maximal size of possible extension queue 1426. Compared 255350 event pairs, 1065 based on Foata normal form. 4/26433 useless extension candidates. Maximal degree in co-relation 477449. Up to 26298 conditions per place. [2025-04-14 00:28:03,783 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 3850 selfloop transitions, 51 changer transitions 20/3923 dead transitions. [2025-04-14 00:28:03,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 621 places, 3923 transitions, 100477 flow [2025-04-14 00:28:03,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-14 00:28:03,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-14 00:28:03,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 130 transitions. [2025-04-14 00:28:03,784 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30952380952380953 [2025-04-14 00:28:03,785 INFO L175 Difference]: Start difference. First operand has 605 places, 3901 transitions, 92198 flow. Second operand 20 states and 130 transitions. [2025-04-14 00:28:03,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 621 places, 3923 transitions, 100477 flow [2025-04-14 00:28:52,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 600 places, 3923 transitions, 100189 flow, removed 47 selfloop flow, removed 21 redundant places. [2025-04-14 00:28:52,464 INFO L231 Difference]: Finished difference. Result has 604 places, 3897 transitions, 91902 flow [2025-04-14 00:28:52,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=91934, PETRI_DIFFERENCE_MINUEND_PLACES=581, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3901, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3850, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=91902, PETRI_PLACES=604, PETRI_TRANSITIONS=3897} [2025-04-14 00:28:52,466 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 583 predicate places. [2025-04-14 00:28:52,466 INFO L485 AbstractCegarLoop]: Abstraction has has 604 places, 3897 transitions, 91902 flow [2025-04-14 00:28:52,466 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 5.456521739130435) internal successors, (251), 46 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:28:52,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:28:52,466 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:28:52,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Ended with exit code 0 [2025-04-14 00:28:52,667 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable76 [2025-04-14 00:28:52,667 INFO L403 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:28:52,668 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:28:52,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1129170561, now seen corresponding path program 70 times [2025-04-14 00:28:52,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:28:52,668 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282023845] [2025-04-14 00:28:52,668 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:28:52,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:28:52,675 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-14 00:28:52,681 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-14 00:28:52,681 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:28:52,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:28:52,973 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:28:52,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:28:52,973 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282023845] [2025-04-14 00:28:52,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282023845] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:28:52,973 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723512835] [2025-04-14 00:28:52,973 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:28:52,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:28:52,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:28:52,975 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:28:52,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2025-04-14 00:28:53,098 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-14 00:28:53,129 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-14 00:28:53,129 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:28:53,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:28:53,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-14 00:28:53,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:28:53,505 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:28:53,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:28:53,565 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-14 00:28:53,565 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-14 00:28:53,865 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:28:53,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723512835] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:28:53,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:28:53,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 14] total 44 [2025-04-14 00:28:53,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208553690] [2025-04-14 00:28:53,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:28:53,865 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-04-14 00:28:53,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:28:53,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-04-14 00:28:53,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=1731, Unknown=0, NotChecked=0, Total=1980 [2025-04-14 00:28:53,866 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:28:53,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 3897 transitions, 91902 flow. Second operand has 45 states, 45 states have (on average 5.488888888888889) internal successors, (247), 45 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 00:28:53,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:28:53,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:28:53,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:29:27,003 INFO L116 PetriNetUnfolderBase]: 13429/26505 cut-off events. [2025-04-14 00:29:27,003 INFO L117 PetriNetUnfolderBase]: For 7630746/7630746 co-relation queries the response was YES. [2025-04-14 00:29:27,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479676 conditions, 26505 events. 13429/26505 cut-off events. For 7630746/7630746 co-relation queries the response was YES. Maximal size of possible extension queue 1428. Compared 255891 event pairs, 1067 based on Foata normal form. 10/26513 useless extension candidates. Maximal degree in co-relation 479419. Up to 26144 conditions per place. [2025-04-14 00:29:27,806 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 3826 selfloop transitions, 141 changer transitions 14/3983 dead transitions. [2025-04-14 00:29:27,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 629 places, 3983 transitions, 102194 flow [2025-04-14 00:29:27,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-14 00:29:27,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-14 00:29:27,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 227 transitions. [2025-04-14 00:29:27,808 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3603174603174603 [2025-04-14 00:29:27,808 INFO L175 Difference]: Start difference. First operand has 604 places, 3897 transitions, 91902 flow. Second operand 30 states and 227 transitions. [2025-04-14 00:29:27,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 629 places, 3983 transitions, 102194 flow [2025-04-14 00:30:14,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 611 places, 3983 transitions, 101986 flow, removed 53 selfloop flow, removed 18 redundant places. [2025-04-14 00:30:14,127 INFO L231 Difference]: Finished difference. Result has 619 places, 3940 transitions, 93154 flow [2025-04-14 00:30:14,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=91677, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3896, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3764, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=93154, PETRI_PLACES=619, PETRI_TRANSITIONS=3940} [2025-04-14 00:30:14,130 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 598 predicate places. [2025-04-14 00:30:14,130 INFO L485 AbstractCegarLoop]: Abstraction has has 619 places, 3940 transitions, 93154 flow [2025-04-14 00:30:14,130 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 5.488888888888889) internal successors, (247), 45 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 00:30:14,130 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:30:14,130 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:30:14,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Ended with exit code 0 [2025-04-14 00:30:14,331 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:30:14,331 INFO L403 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:30:14,332 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:30:14,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1534328677, now seen corresponding path program 71 times [2025-04-14 00:30:14,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:30:14,332 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550112526] [2025-04-14 00:30:14,332 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:30:14,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:30:14,343 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 3 equivalence classes. [2025-04-14 00:30:14,350 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-04-14 00:30:14,350 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 00:30:14,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:30:14,422 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-14 00:30:14,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:30:14,422 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550112526] [2025-04-14 00:30:14,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550112526] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:30:14,423 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585749245] [2025-04-14 00:30:14,423 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:30:14,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:30:14,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:30:14,424 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:30:14,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2025-04-14 00:30:14,553 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 3 equivalence classes. [2025-04-14 00:30:14,619 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-04-14 00:30:14,619 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 00:30:14,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:30:14,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-14 00:30:14,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:30:14,719 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-14 00:30:14,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:30:14,740 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-14 00:30:14,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585749245] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:30:14,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:30:14,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 5] total 14 [2025-04-14 00:30:14,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550409645] [2025-04-14 00:30:14,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:30:14,740 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 00:30:14,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:30:14,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 00:30:14,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-04-14 00:30:14,741 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:30:14,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 619 places, 3940 transitions, 93154 flow. Second operand has 16 states, 16 states have (on average 6.75) internal successors, (108), 16 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:30:14,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:30:14,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:30:14,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:30:51,213 INFO L116 PetriNetUnfolderBase]: 15997/31545 cut-off events. [2025-04-14 00:30:51,213 INFO L117 PetriNetUnfolderBase]: For 9988204/9988204 co-relation queries the response was YES. [2025-04-14 00:30:51,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 592311 conditions, 31545 events. 15997/31545 cut-off events. For 9988204/9988204 co-relation queries the response was YES. Maximal size of possible extension queue 1666. Compared 313295 event pairs, 865 based on Foata normal form. 8/31549 useless extension candidates. Maximal degree in co-relation 592049. Up to 16958 conditions per place. [2025-04-14 00:30:52,034 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 2695 selfloop transitions, 1962 changer transitions 6/4665 dead transitions. [2025-04-14 00:30:52,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 632 places, 4665 transitions, 122554 flow [2025-04-14 00:30:52,035 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 00:30:52,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-14 00:30:52,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 170 transitions. [2025-04-14 00:30:52,035 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5059523809523809 [2025-04-14 00:30:52,035 INFO L175 Difference]: Start difference. First operand has 619 places, 3940 transitions, 93154 flow. Second operand 16 states and 170 transitions. [2025-04-14 00:30:52,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 632 places, 4665 transitions, 122554 flow [2025-04-14 00:31:47,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 611 places, 4665 transitions, 122250 flow, removed 100 selfloop flow, removed 21 redundant places. [2025-04-14 00:31:47,443 INFO L231 Difference]: Finished difference. Result has 620 places, 4543 transitions, 115844 flow [2025-04-14 00:31:47,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=92858, PETRI_DIFFERENCE_MINUEND_PLACES=596, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3940, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1478, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=115844, PETRI_PLACES=620, PETRI_TRANSITIONS=4543} [2025-04-14 00:31:47,447 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 599 predicate places. [2025-04-14 00:31:47,447 INFO L485 AbstractCegarLoop]: Abstraction has has 620 places, 4543 transitions, 115844 flow [2025-04-14 00:31:47,447 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.75) internal successors, (108), 16 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:31:47,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:31:47,447 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:31:47,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Forceful destruction successful, exit code 0 [2025-04-14 00:31:47,647 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:31:47,648 INFO L403 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:31:47,648 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:31:47,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1844533525, now seen corresponding path program 72 times [2025-04-14 00:31:47,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:31:47,649 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16267320] [2025-04-14 00:31:47,649 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:31:47,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:31:47,657 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-14 00:31:47,665 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-14 00:31:47,665 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-14 00:31:47,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:31:47,918 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:31:47,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:31:47,919 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16267320] [2025-04-14 00:31:47,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16267320] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:31:47,919 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438255408] [2025-04-14 00:31:47,919 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:31:47,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:31:47,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:31:47,921 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:31:47,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2025-04-14 00:31:48,059 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-14 00:31:48,084 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-14 00:31:48,084 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-14 00:31:48,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:31:48,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-14 00:31:48,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:31:48,215 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-14 00:31:48,215 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:31:48,286 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-14 00:31:48,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438255408] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:31:48,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:31:48,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 5] total 27 [2025-04-14 00:31:48,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151432228] [2025-04-14 00:31:48,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:31:48,287 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-14 00:31:48,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:31:48,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-14 00:31:48,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2025-04-14 00:31:48,287 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-14 00:31:48,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 620 places, 4543 transitions, 115844 flow. Second operand has 29 states, 29 states have (on average 6.137931034482759) internal successors, (178), 29 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:31:48,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:31:48,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-14 00:31:48,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2025-04-14 00:32:21,427 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 00:32:21,429 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 00:32:22,093 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-14 00:32:22,094 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-14 00:32:22,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Ended with exit code 0 [2025-04-14 00:32:22,294 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2025-04-14 00:32:22,295 WARN L610 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (29states, 4/21 universal loopers) in iteration 80,while PetriNetUnfolder was constructing finite prefix that currently has 488051 conditions, 24922 events (13249/24921 cut-off events. For 8879494/8879494 co-relation queries the response was YES. Maximal size of possible extension queue 2056. Compared 250167 event pairs, 530 based on Foata normal form. 515/27236 useless extension candidates. Maximal degree in co-relation 487792. Up to 11058 conditions per place.). [2025-04-14 00:32:22,296 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-14 00:32:22,296 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 00:32:22,297 INFO L422 BasicCegarLoop]: Path program histogram: [72, 2, 1, 1, 1, 1, 1, 1] [2025-04-14 00:32:22,299 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:32:22,299 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:32:22,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:32:22 BasicIcfg [2025-04-14 00:32:22,302 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:32:22,303 INFO L158 Benchmark]: Toolchain (without parser) took 785451.88ms. Allocated memory was 142.6MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 100.0MB in the beginning and 1.0GB in the end (delta: -929.7MB). Peak memory consumption was 3.3GB. Max. memory is 8.0GB. [2025-04-14 00:32:22,303 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 155.2MB. Free memory is still 83.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:32:22,303 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.32ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 85.0MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 00:32:22,303 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.80ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 82.6MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:32:22,303 INFO L158 Benchmark]: Boogie Preprocessor took 45.10ms. Allocated memory is still 142.6MB. Free memory was 82.6MB in the beginning and 80.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:32:22,303 INFO L158 Benchmark]: IcfgBuilder took 582.98ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 32.3MB in the end (delta: 48.6MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. [2025-04-14 00:32:22,303 INFO L158 Benchmark]: TraceAbstraction took 784504.51ms. Allocated memory was 142.6MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 31.5MB in the beginning and 1.0GB in the end (delta: -998.2MB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. [2025-04-14 00:32:22,304 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.28ms. Allocated memory is still 155.2MB. Free memory is still 83.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 285.32ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 85.0MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.80ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 82.6MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.10ms. Allocated memory is still 142.6MB. Free memory was 82.6MB in the beginning and 80.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 582.98ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 32.3MB in the end (delta: 48.6MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. * TraceAbstraction took 784504.51ms. Allocated memory was 142.6MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 31.5MB in the beginning and 1.0GB in the end (delta: -998.2MB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (29states, 4/21 universal loopers) in iteration 80,while PetriNetUnfolder was constructing finite prefix that currently has 488051 conditions, 24922 events (13249/24921 cut-off events. For 8879494/8879494 co-relation queries the response was YES. Maximal size of possible extension queue 2056. Compared 250167 event pairs, 530 based on Foata normal form. 515/27236 useless extension candidates. Maximal degree in co-relation 487792. Up to 11058 conditions per place.). - TimeoutResultAtElement [Line: 79]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (29states, 4/21 universal loopers) in iteration 80,while PetriNetUnfolder was constructing finite prefix that currently has 488051 conditions, 24922 events (13249/24921 cut-off events. For 8879494/8879494 co-relation queries the response was YES. Maximal size of possible extension queue 2056. Compared 250167 event pairs, 530 based on Foata normal form. 515/27236 useless extension candidates. Maximal degree in co-relation 487792. Up to 11058 conditions per place.). - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (29states, 4/21 universal loopers) in iteration 80,while PetriNetUnfolder was constructing finite prefix that currently has 488051 conditions, 24922 events (13249/24921 cut-off events. For 8879494/8879494 co-relation queries the response was YES. Maximal size of possible extension queue 2056. Compared 250167 event pairs, 530 based on Foata normal form. 515/27236 useless extension candidates. Maximal degree in co-relation 487792. Up to 11058 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 26 locations, 31 edges, 3 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: 784.4s, OverallIterations: 80, TraceHistogramMax: 5, PathProgramHistogramMax: 72, EmptinessCheckTime: 0.0s, AutomataDifference: 694.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 30 mSolverCounterUnknown, 5107 SdHoareTripleChecker+Valid, 45.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5107 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 42.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 813 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 699 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 58214 IncrementalHoareTripleChecker+Invalid, 59756 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 699 mSolverCounterUnsat, 0 mSDtfsCounter, 58214 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5286 GetRequests, 2484 SyntacticMatches, 18 SemanticMatches, 2784 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 28933 ImplicationChecksByTransitivity, 55.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115844occurred in iteration=79, InterpolantAutomatonStates: 1448, 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.8s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 64.3s InterpolantComputationTime, 3892 NumberOfCodeBlocks, 3892 NumberOfCodeBlocksAsserted, 349 NumberOfCheckSat, 5570 ConstructedInterpolants, 64 QuantifiedInterpolants, 73361 SizeOfPredicates, 568 NumberOfNonLiveVariables, 17241 ConjunctsInSsa, 2133 ConjunctsInUnsatCore, 230 InterpolantComputations, 6 PerfectInterpolantSequences, 2569/5421 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 could not prove your program: Timeout Completed graceful shutdown