/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:41:31,370 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:41:31,406 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 20:41:31,413 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:41:31,413 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:41:31,430 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:41:31,430 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:41:31,430 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:41:31,431 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:41:31,431 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:41:31,431 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:41:31,431 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:41:31,432 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:41:31,432 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:41:31,432 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:41:31,432 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:41:31,432 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:41:31,432 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:41:31,432 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:41:31,432 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:41:31,432 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:41:31,432 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:41:31,432 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:41:31,432 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:41:31,432 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:41:31,432 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:41:31,432 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:41:31,432 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:41:31,433 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:41:31,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:41:31,433 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:41:31,433 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:41:31,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:41:31,433 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:41:31,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:41:31,433 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:41:31,433 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:41:31,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:41:31,433 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:41:31,433 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:41:31,434 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:41:31,434 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:41:31,434 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:41:31,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:41:31,434 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:41:31,434 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:41:31,434 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:41:31,434 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 20:41:31,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:41:31,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:41:31,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:41:31,623 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:41:31,623 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:41:31,623 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c [2025-04-13 20:41:32,880 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/192cfa37e/d1bae78365b144b9bd577ad649b042c9/FLAG4d4566aaf [2025-04-13 20:41:33,062 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:41:33,063 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c [2025-04-13 20:41:33,069 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/192cfa37e/d1bae78365b144b9bd577ad649b042c9/FLAG4d4566aaf [2025-04-13 20:41:34,981 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/192cfa37e/d1bae78365b144b9bd577ad649b042c9 [2025-04-13 20:41:34,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:41:34,984 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:41:34,988 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:41:34,988 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:41:34,991 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:41:34,991 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:41:34" (1/1) ... [2025-04-13 20:41:34,992 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a1eac4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:41:34, skipping insertion in model container [2025-04-13 20:41:34,992 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:41:34" (1/1) ... [2025-04-13 20:41:35,005 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:41:35,159 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/popl20-more-mts.wvr.c[2572,2585] [2025-04-13 20:41:35,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:41:35,177 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:41:35,206 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/popl20-more-mts.wvr.c[2572,2585] [2025-04-13 20:41:35,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:41:35,223 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:41:35,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:41:35 WrapperNode [2025-04-13 20:41:35,223 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:41:35,224 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:41:35,224 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:41:35,224 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:41:35,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:41:35" (1/1) ... [2025-04-13 20:41:35,235 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:41:35" (1/1) ... [2025-04-13 20:41:35,251 INFO L138 Inliner]: procedures = 24, calls = 31, calls flagged for inlining = 13, calls inlined = 19, statements flattened = 204 [2025-04-13 20:41:35,251 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:41:35,252 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:41:35,252 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:41:35,252 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:41:35,257 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:41:35" (1/1) ... [2025-04-13 20:41:35,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:41:35" (1/1) ... [2025-04-13 20:41:35,260 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:41:35" (1/1) ... [2025-04-13 20:41:35,270 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-13 20:41:35,270 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:41:35" (1/1) ... [2025-04-13 20:41:35,270 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:41:35" (1/1) ... [2025-04-13 20:41:35,275 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:41:35" (1/1) ... [2025-04-13 20:41:35,279 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:41:35" (1/1) ... [2025-04-13 20:41:35,281 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:41:35" (1/1) ... [2025-04-13 20:41:35,285 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:41:35" (1/1) ... [2025-04-13 20:41:35,285 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:41:35" (1/1) ... [2025-04-13 20:41:35,293 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:41:35,293 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:41:35,293 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:41:35,293 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:41:35,294 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:41:35" (1/1) ... [2025-04-13 20:41:35,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:41:35,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:41:35,324 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 20:41:35,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 20:41:35,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:41:35,343 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:41:35,344 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:41:35,344 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:41:35,344 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:41:35,344 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:41:35,344 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:41:35,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:41:35,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 20:41:35,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 20:41:35,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 20:41:35,344 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 20:41:35,344 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 20:41:35,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 20:41:35,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:41:35,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:41:35,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 20:41:35,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 20:41:35,345 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 20:41:35,425 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:41:35,426 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:41:35,708 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:41:35,709 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:41:35,709 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:41:35,983 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:41:35,986 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:41:35,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:41:35 BoogieIcfgContainer [2025-04-13 20:41:35,987 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:41:35,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:41:35,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:41:35,991 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:41:35,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:41:34" (1/3) ... [2025-04-13 20:41:35,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c365162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:41:35, skipping insertion in model container [2025-04-13 20:41:35,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:41:35" (2/3) ... [2025-04-13 20:41:35,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c365162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:41:35, skipping insertion in model container [2025-04-13 20:41:35,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:41:35" (3/3) ... [2025-04-13 20:41:35,992 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-mts.wvr.c [2025-04-13 20:41:36,002 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:41:36,004 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-mts.wvr.c that has 4 procedures, 24 locations, 25 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-13 20:41:36,004 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:41:36,046 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 20:41:36,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 28 transitions, 77 flow [2025-04-13 20:41:36,090 INFO L116 PetriNetUnfolderBase]: 5/25 cut-off events. [2025-04-13 20:41:36,092 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:41:36,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 25 events. 5/25 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 20. Up to 2 conditions per place. [2025-04-13 20:41:36,094 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 28 transitions, 77 flow [2025-04-13 20:41:36,096 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 24 transitions, 66 flow [2025-04-13 20:41:36,101 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:41:36,111 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;@59f548a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:41:36,111 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 20:41:36,121 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:41:36,121 INFO L116 PetriNetUnfolderBase]: 5/23 cut-off events. [2025-04-13 20:41:36,121 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:41:36,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:41:36,122 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:41:36,122 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:41:36,127 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:41:36,127 INFO L85 PathProgramCache]: Analyzing trace with hash -362470564, now seen corresponding path program 1 times [2025-04-13 20:41:36,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:41:36,133 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075063728] [2025-04-13 20:41:36,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:41:36,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:41:36,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 20:41:36,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:41:36,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:41:36,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:36,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:41:36,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:41:36,373 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075063728] [2025-04-13 20:41:36,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075063728] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:41:36,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:41:36,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:41:36,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206755842] [2025-04-13 20:41:36,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:41:36,380 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:41:36,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:41:36,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:41:36,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:41:36,400 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:41:36,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 24 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:36,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:41:36,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:41:36,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:41:36,517 INFO L116 PetriNetUnfolderBase]: 252/368 cut-off events. [2025-04-13 20:41:36,517 INFO L117 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-04-13 20:41:36,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 784 conditions, 368 events. 252/368 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 911 event pairs, 163 based on Foata normal form. 0/279 useless extension candidates. Maximal degree in co-relation 660. Up to 366 conditions per place. [2025-04-13 20:41:36,524 INFO L140 encePairwiseOnDemand]: 26/28 looper letters, 22 selfloop transitions, 1 changer transitions 0/23 dead transitions. [2025-04-13 20:41:36,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 23 transitions, 110 flow [2025-04-13 20:41:36,525 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:41:36,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:41:36,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2025-04-13 20:41:36,533 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2025-04-13 20:41:36,534 INFO L175 Difference]: Start difference. First operand has 29 places, 24 transitions, 66 flow. Second operand 3 states and 33 transitions. [2025-04-13 20:41:36,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 23 transitions, 110 flow [2025-04-13 20:41:36,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 23 transitions, 98 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-13 20:41:36,540 INFO L231 Difference]: Finished difference. Result has 25 places, 23 transitions, 54 flow [2025-04-13 20:41:36,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=25, PETRI_TRANSITIONS=23} [2025-04-13 20:41:36,544 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, -4 predicate places. [2025-04-13 20:41:36,544 INFO L485 AbstractCegarLoop]: Abstraction has has 25 places, 23 transitions, 54 flow [2025-04-13 20:41:36,544 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:36,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:41:36,545 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:41:36,545 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:41:36,545 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:41:36,545 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:41:36,545 INFO L85 PathProgramCache]: Analyzing trace with hash 22086679, now seen corresponding path program 1 times [2025-04-13 20:41:36,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:41:36,546 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164750981] [2025-04-13 20:41:36,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:41:36,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:41:36,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 20:41:36,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 20:41:36,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:41:36,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:36,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:41:36,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:41:36,684 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164750981] [2025-04-13 20:41:36,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164750981] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:41:36,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:41:36,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:41:36,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325506032] [2025-04-13 20:41:36,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:41:36,685 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:41:36,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:41:36,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:41:36,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:41:36,685 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:41:36,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 23 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:36,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:41:36,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:41:36,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:41:36,779 INFO L116 PetriNetUnfolderBase]: 252/369 cut-off events. [2025-04-13 20:41:36,779 INFO L117 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-04-13 20:41:36,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 755 conditions, 369 events. 252/369 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 911 event pairs, 163 based on Foata normal form. 1/282 useless extension candidates. Maximal degree in co-relation 743. Up to 369 conditions per place. [2025-04-13 20:41:36,782 INFO L140 encePairwiseOnDemand]: 25/28 looper letters, 22 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2025-04-13 20:41:36,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 24 transitions, 104 flow [2025-04-13 20:41:36,783 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:41:36,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:41:36,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2025-04-13 20:41:36,784 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2025-04-13 20:41:36,784 INFO L175 Difference]: Start difference. First operand has 25 places, 23 transitions, 54 flow. Second operand 3 states and 34 transitions. [2025-04-13 20:41:36,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 24 transitions, 104 flow [2025-04-13 20:41:36,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 24 transitions, 103 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:41:36,786 INFO L231 Difference]: Finished difference. Result has 27 places, 24 transitions, 65 flow [2025-04-13 20:41:36,786 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=53, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=27, PETRI_TRANSITIONS=24} [2025-04-13 20:41:36,786 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, -2 predicate places. [2025-04-13 20:41:36,786 INFO L485 AbstractCegarLoop]: Abstraction has has 27 places, 24 transitions, 65 flow [2025-04-13 20:41:36,786 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:36,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:41:36,786 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:41:36,787 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:41:36,787 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:41:36,787 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:41:36,787 INFO L85 PathProgramCache]: Analyzing trace with hash -20885979, now seen corresponding path program 1 times [2025-04-13 20:41:36,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:41:36,787 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8659772] [2025-04-13 20:41:36,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:41:36,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:41:36,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:41:36,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:41:36,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:41:36,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:36,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:41:36,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:41:36,924 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8659772] [2025-04-13 20:41:36,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8659772] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:41:36,924 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411970125] [2025-04-13 20:41:36,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:41:36,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:41:36,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:41:36,927 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:41:36,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 20:41:36,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:41:37,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:41:37,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:41:37,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:37,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 20:41:37,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:41:37,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:41:37,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:41:37,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:41:37,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411970125] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:41:37,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:41:37,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-04-13 20:41:37,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459933909] [2025-04-13 20:41:37,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:41:37,092 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:41:37,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:41:37,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:41:37,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:41:37,092 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:41:37,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 24 transitions, 65 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:37,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:41:37,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:41:37,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:41:37,206 INFO L116 PetriNetUnfolderBase]: 326/475 cut-off events. [2025-04-13 20:41:37,206 INFO L117 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-04-13 20:41:37,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 977 conditions, 475 events. 326/475 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1345 event pairs, 163 based on Foata normal form. 0/370 useless extension candidates. Maximal degree in co-relation 966. Up to 368 conditions per place. [2025-04-13 20:41:37,211 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 33 selfloop transitions, 4 changer transitions 0/37 dead transitions. [2025-04-13 20:41:37,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 37 transitions, 167 flow [2025-04-13 20:41:37,212 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:41:37,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:41:37,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2025-04-13 20:41:37,212 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37857142857142856 [2025-04-13 20:41:37,212 INFO L175 Difference]: Start difference. First operand has 27 places, 24 transitions, 65 flow. Second operand 5 states and 53 transitions. [2025-04-13 20:41:37,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 37 transitions, 167 flow [2025-04-13 20:41:37,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 37 transitions, 163 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 20:41:37,213 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 77 flow [2025-04-13 20:41:37,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=61, 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=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=77, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2025-04-13 20:41:37,214 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2025-04-13 20:41:37,214 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 77 flow [2025-04-13 20:41:37,214 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:37,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:41:37,214 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:41:37,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 20:41:37,414 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:41:37,415 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:41:37,415 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:41:37,415 INFO L85 PathProgramCache]: Analyzing trace with hash -115238841, now seen corresponding path program 1 times [2025-04-13 20:41:37,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:41:37,416 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079462809] [2025-04-13 20:41:37,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:41:37,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:41:37,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 20:41:37,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:41:37,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:41:37,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:38,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:41:38,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:41:38,669 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079462809] [2025-04-13 20:41:38,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079462809] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:41:38,669 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490032151] [2025-04-13 20:41:38,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:41:38,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:41:38,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:41:38,672 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:41:38,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 20:41:38,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 20:41:38,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:41:38,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:41:38,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:38,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 20:41:38,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:41:38,836 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-13 20:41:39,223 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:41:39,224 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 82 treesize of output 46 [2025-04-13 20:41:39,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:41:39,348 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:41:40,114 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 142 treesize of output 128 [2025-04-13 20:41:40,124 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:41:40,124 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 229 treesize of output 194 [2025-04-13 20:41:40,473 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 69 treesize of output 61 [2025-04-13 20:41:40,476 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 92 treesize of output 84 [2025-04-13 20:41:40,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:41:40,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490032151] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:41:40,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:41:40,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 23 [2025-04-13 20:41:40,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466876280] [2025-04-13 20:41:40,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:41:40,524 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 20:41:40,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:41:40,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 20:41:40,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2025-04-13 20:41:40,525 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:41:40,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 77 flow. Second operand has 25 states, 25 states have (on average 5.52) internal successors, (138), 25 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:40,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:41:40,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:41:40,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:41:41,679 INFO L116 PetriNetUnfolderBase]: 805/1170 cut-off events. [2025-04-13 20:41:41,679 INFO L117 PetriNetUnfolderBase]: For 314/314 co-relation queries the response was YES. [2025-04-13 20:41:41,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2766 conditions, 1170 events. 805/1170 cut-off events. For 314/314 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4218 event pairs, 71 based on Foata normal form. 2/910 useless extension candidates. Maximal degree in co-relation 2065. Up to 637 conditions per place. [2025-04-13 20:41:41,693 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 98 selfloop transitions, 40 changer transitions 4/142 dead transitions. [2025-04-13 20:41:41,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 142 transitions, 671 flow [2025-04-13 20:41:41,694 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 20:41:41,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 20:41:41,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 191 transitions. [2025-04-13 20:41:41,695 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4263392857142857 [2025-04-13 20:41:41,695 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 77 flow. Second operand 16 states and 191 transitions. [2025-04-13 20:41:41,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 142 transitions, 671 flow [2025-04-13 20:41:41,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 142 transitions, 651 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-04-13 20:41:41,697 INFO L231 Difference]: Finished difference. Result has 49 places, 64 transitions, 300 flow [2025-04-13 20:41:41,697 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=300, PETRI_PLACES=49, PETRI_TRANSITIONS=64} [2025-04-13 20:41:41,698 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 20 predicate places. [2025-04-13 20:41:41,698 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 64 transitions, 300 flow [2025-04-13 20:41:41,698 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.52) internal successors, (138), 25 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:41,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:41:41,698 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:41:41,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 20:41:41,904 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-13 20:41:41,904 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:41:41,904 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:41:41,905 INFO L85 PathProgramCache]: Analyzing trace with hash -747576653, now seen corresponding path program 2 times [2025-04-13 20:41:41,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:41:41,905 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433643988] [2025-04-13 20:41:41,905 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:41:41,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:41:41,913 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:41:41,934 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:41:41,934 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:41:41,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:42,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:41:42,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:41:42,405 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433643988] [2025-04-13 20:41:42,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433643988] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:41:42,405 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223069021] [2025-04-13 20:41:42,405 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:41:42,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:41:42,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:41:42,407 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:41:42,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 20:41:42,449 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:41:42,466 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:41:42,466 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:41:42,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:42,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-13 20:41:42,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:41:42,523 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-13 20:41:42,743 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:41:42,743 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 74 treesize of output 46 [2025-04-13 20:41:42,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:41:42,877 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:41:43,856 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 185 treesize of output 167 [2025-04-13 20:41:43,863 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:41:43,863 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 322 treesize of output 269 [2025-04-13 20:41:44,314 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 110 treesize of output 98 [2025-04-13 20:41:44,320 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 146 treesize of output 134 [2025-04-13 20:41:44,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:41:44,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223069021] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:41:44,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:41:44,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2025-04-13 20:41:44,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596111356] [2025-04-13 20:41:44,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:41:44,385 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 20:41:44,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:41:44,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 20:41:44,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=521, Unknown=0, NotChecked=0, Total=650 [2025-04-13 20:41:44,386 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:41:44,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 64 transitions, 300 flow. Second operand has 26 states, 26 states have (on average 5.423076923076923) internal successors, (141), 26 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-13 20:41:44,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:41:44,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:41:44,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:41:46,623 INFO L116 PetriNetUnfolderBase]: 1393/2017 cut-off events. [2025-04-13 20:41:46,623 INFO L117 PetriNetUnfolderBase]: For 1034/1034 co-relation queries the response was YES. [2025-04-13 20:41:46,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5767 conditions, 2017 events. 1393/2017 cut-off events. For 1034/1034 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8147 event pairs, 82 based on Foata normal form. 23/2039 useless extension candidates. Maximal degree in co-relation 5590. Up to 1097 conditions per place. [2025-04-13 20:41:46,634 INFO L140 encePairwiseOnDemand]: 13/28 looper letters, 159 selfloop transitions, 142 changer transitions 7/308 dead transitions. [2025-04-13 20:41:46,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 308 transitions, 1733 flow [2025-04-13 20:41:46,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 20:41:46,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2025-04-13 20:41:46,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 408 transitions. [2025-04-13 20:41:46,637 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3554006968641115 [2025-04-13 20:41:46,637 INFO L175 Difference]: Start difference. First operand has 49 places, 64 transitions, 300 flow. Second operand 41 states and 408 transitions. [2025-04-13 20:41:46,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 308 transitions, 1733 flow [2025-04-13 20:41:46,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 308 transitions, 1725 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-13 20:41:46,650 INFO L231 Difference]: Finished difference. Result has 110 places, 189 transitions, 1355 flow [2025-04-13 20:41:46,650 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=1355, PETRI_PLACES=110, PETRI_TRANSITIONS=189} [2025-04-13 20:41:46,651 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 81 predicate places. [2025-04-13 20:41:46,651 INFO L485 AbstractCegarLoop]: Abstraction has has 110 places, 189 transitions, 1355 flow [2025-04-13 20:41:46,651 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.423076923076923) internal successors, (141), 26 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-13 20:41:46,651 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:41:46,651 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:41:46,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 20:41:46,851 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:41:46,852 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:41:46,852 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:41:46,852 INFO L85 PathProgramCache]: Analyzing trace with hash 380558017, now seen corresponding path program 3 times [2025-04-13 20:41:46,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:41:46,852 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949052510] [2025-04-13 20:41:46,852 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:41:46,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:41:46,859 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:41:46,871 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:41:46,875 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:41:46,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:47,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:41:47,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:41:47,285 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949052510] [2025-04-13 20:41:47,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949052510] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:41:47,285 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919485762] [2025-04-13 20:41:47,285 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:41:47,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:41:47,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:41:47,291 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:41:47,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 20:41:47,343 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:41:47,366 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:41:47,366 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:41:47,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:47,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 20:41:47,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:41:47,403 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-13 20:41:47,644 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 66 treesize of output 38 [2025-04-13 20:41:47,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:41:47,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:41:48,434 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 172 treesize of output 154 [2025-04-13 20:41:48,440 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:41:48,440 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 309 treesize of output 256 [2025-04-13 20:41:48,727 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 69 treesize of output 61 [2025-04-13 20:41:48,730 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 92 treesize of output 84 [2025-04-13 20:41:48,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:41:48,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919485762] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:41:48,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:41:48,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2025-04-13 20:41:48,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51512147] [2025-04-13 20:41:48,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:41:48,761 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 20:41:48,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:41:48,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 20:41:48,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2025-04-13 20:41:48,762 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:41:48,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 189 transitions, 1355 flow. Second operand has 27 states, 27 states have (on average 5.333333333333333) internal successors, (144), 27 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:48,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:41:48,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:41:48,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:41:50,561 INFO L116 PetriNetUnfolderBase]: 1736/2538 cut-off events. [2025-04-13 20:41:50,561 INFO L117 PetriNetUnfolderBase]: For 10732/10732 co-relation queries the response was YES. [2025-04-13 20:41:50,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11965 conditions, 2538 events. 1736/2538 cut-off events. For 10732/10732 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 10900 event pairs, 102 based on Foata normal form. 4/2542 useless extension candidates. Maximal degree in co-relation 11827. Up to 1552 conditions per place. [2025-04-13 20:41:50,574 INFO L140 encePairwiseOnDemand]: 13/28 looper letters, 184 selfloop transitions, 136 changer transitions 3/323 dead transitions. [2025-04-13 20:41:50,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 323 transitions, 2822 flow [2025-04-13 20:41:50,575 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 20:41:50,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-04-13 20:41:50,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 307 transitions. [2025-04-13 20:41:50,577 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35368663594470046 [2025-04-13 20:41:50,577 INFO L175 Difference]: Start difference. First operand has 110 places, 189 transitions, 1355 flow. Second operand 31 states and 307 transitions. [2025-04-13 20:41:50,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 323 transitions, 2822 flow [2025-04-13 20:41:50,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 323 transitions, 2502 flow, removed 141 selfloop flow, removed 7 redundant places. [2025-04-13 20:41:50,601 INFO L231 Difference]: Finished difference. Result has 140 places, 225 transitions, 1733 flow [2025-04-13 20:41:50,601 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=1733, PETRI_PLACES=140, PETRI_TRANSITIONS=225} [2025-04-13 20:41:50,602 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 111 predicate places. [2025-04-13 20:41:50,602 INFO L485 AbstractCegarLoop]: Abstraction has has 140 places, 225 transitions, 1733 flow [2025-04-13 20:41:50,602 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.333333333333333) internal successors, (144), 27 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:50,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:41:50,604 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:41:50,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 20:41:50,805 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:41:50,805 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:41:50,805 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:41:50,806 INFO L85 PathProgramCache]: Analyzing trace with hash 783916041, now seen corresponding path program 4 times [2025-04-13 20:41:50,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:41:50,806 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606445063] [2025-04-13 20:41:50,806 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:41:50,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:41:50,811 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:41:50,821 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:41:50,822 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:41:50,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:51,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:41:51,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:41:51,446 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606445063] [2025-04-13 20:41:51,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606445063] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:41:51,446 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429721511] [2025-04-13 20:41:51,446 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:41:51,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:41:51,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:41:51,447 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:41:51,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 20:41:51,498 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:41:51,515 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:41:51,516 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:41:51,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:51,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-04-13 20:41:51,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:41:51,549 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-13 20:41:51,756 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:41:51,756 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 82 treesize of output 46 [2025-04-13 20:41:51,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:41:51,899 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:41:52,867 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 155 treesize of output 139 [2025-04-13 20:41:52,873 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:41:52,873 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 248 treesize of output 211 [2025-04-13 20:41:53,153 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 109 treesize of output 99 [2025-04-13 20:41:53,157 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 138 treesize of output 128 [2025-04-13 20:41:53,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:41:53,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429721511] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:41:53,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:41:53,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2025-04-13 20:41:53,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10285265] [2025-04-13 20:41:53,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:41:53,265 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 20:41:53,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:41:53,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 20:41:53,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2025-04-13 20:41:53,266 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:41:53,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 225 transitions, 1733 flow. Second operand has 26 states, 26 states have (on average 5.423076923076923) internal successors, (141), 26 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-13 20:41:53,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:41:53,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:41:53,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:41:54,560 INFO L116 PetriNetUnfolderBase]: 2052/3001 cut-off events. [2025-04-13 20:41:54,560 INFO L117 PetriNetUnfolderBase]: For 13709/13709 co-relation queries the response was YES. [2025-04-13 20:41:54,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14657 conditions, 3001 events. 2052/3001 cut-off events. For 13709/13709 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 13343 event pairs, 221 based on Foata normal form. 19/3006 useless extension candidates. Maximal degree in co-relation 14397. Up to 2398 conditions per place. [2025-04-13 20:41:54,578 INFO L140 encePairwiseOnDemand]: 14/28 looper letters, 240 selfloop transitions, 84 changer transitions 2/326 dead transitions. [2025-04-13 20:41:54,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 326 transitions, 3109 flow [2025-04-13 20:41:54,578 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 20:41:54,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-13 20:41:54,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 213 transitions. [2025-04-13 20:41:54,579 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38035714285714284 [2025-04-13 20:41:54,579 INFO L175 Difference]: Start difference. First operand has 140 places, 225 transitions, 1733 flow. Second operand 20 states and 213 transitions. [2025-04-13 20:41:54,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 326 transitions, 3109 flow [2025-04-13 20:41:54,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 326 transitions, 2986 flow, removed 15 selfloop flow, removed 19 redundant places. [2025-04-13 20:41:54,602 INFO L231 Difference]: Finished difference. Result has 147 places, 260 transitions, 2142 flow [2025-04-13 20:41:54,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1606, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2142, PETRI_PLACES=147, PETRI_TRANSITIONS=260} [2025-04-13 20:41:54,603 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 118 predicate places. [2025-04-13 20:41:54,603 INFO L485 AbstractCegarLoop]: Abstraction has has 147 places, 260 transitions, 2142 flow [2025-04-13 20:41:54,603 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.423076923076923) internal successors, (141), 26 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-13 20:41:54,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:41:54,603 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:41:54,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 20:41:54,807 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:41:54,807 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:41:54,807 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:41:54,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1456269173, now seen corresponding path program 5 times [2025-04-13 20:41:54,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:41:54,808 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546555251] [2025-04-13 20:41:54,808 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:41:54,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:41:54,815 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:41:54,826 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:41:54,827 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:41:54,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:55,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:41:55,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:41:55,337 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546555251] [2025-04-13 20:41:55,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546555251] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:41:55,337 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694053596] [2025-04-13 20:41:55,337 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:41:55,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:41:55,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:41:55,339 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:41:55,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 20:41:55,382 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:41:55,399 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:41:55,400 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:41:55,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:55,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-13 20:41:55,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:41:55,438 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-13 20:41:55,650 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 66 treesize of output 38 [2025-04-13 20:41:55,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:41:55,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:41:57,440 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 118 treesize of output 108 [2025-04-13 20:41:57,453 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:41:57,453 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 143 [2025-04-13 20:41:57,667 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 183 treesize of output 165 [2025-04-13 20:41:57,685 INFO L325 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-04-13 20:41:57,686 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 291 treesize of output 253 [2025-04-13 20:41:57,998 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 60 treesize of output 54 [2025-04-13 20:41:58,005 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:41:58,005 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 78 treesize of output 68 [2025-04-13 20:41:58,072 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 251 treesize of output 227 [2025-04-13 20:41:58,100 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:41:58,100 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 423 treesize of output 387 [2025-04-13 20:41:59,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:41:59,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694053596] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:41:59,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:41:59,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 24 [2025-04-13 20:41:59,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183553836] [2025-04-13 20:41:59,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:41:59,155 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 20:41:59,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:41:59,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 20:41:59,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2025-04-13 20:41:59,156 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:41:59,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 260 transitions, 2142 flow. Second operand has 26 states, 26 states have (on average 5.423076923076923) internal successors, (141), 26 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-13 20:41:59,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:41:59,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:41:59,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:42:00,353 INFO L116 PetriNetUnfolderBase]: 2216/3264 cut-off events. [2025-04-13 20:42:00,353 INFO L117 PetriNetUnfolderBase]: For 16193/16193 co-relation queries the response was YES. [2025-04-13 20:42:00,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16876 conditions, 3264 events. 2216/3264 cut-off events. For 16193/16193 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 15069 event pairs, 189 based on Foata normal form. 2/3258 useless extension candidates. Maximal degree in co-relation 16612. Up to 2791 conditions per place. [2025-04-13 20:42:00,373 INFO L140 encePairwiseOnDemand]: 15/28 looper letters, 255 selfloop transitions, 80 changer transitions 1/336 dead transitions. [2025-04-13 20:42:00,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 336 transitions, 3300 flow [2025-04-13 20:42:00,374 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 20:42:00,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-13 20:42:00,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 200 transitions. [2025-04-13 20:42:00,375 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3246753246753247 [2025-04-13 20:42:00,375 INFO L175 Difference]: Start difference. First operand has 147 places, 260 transitions, 2142 flow. Second operand 22 states and 200 transitions. [2025-04-13 20:42:00,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 336 transitions, 3300 flow [2025-04-13 20:42:00,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 336 transitions, 3082 flow, removed 78 selfloop flow, removed 7 redundant places. [2025-04-13 20:42:00,408 INFO L231 Difference]: Finished difference. Result has 165 places, 281 transitions, 2331 flow [2025-04-13 20:42:00,408 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1928, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2331, PETRI_PLACES=165, PETRI_TRANSITIONS=281} [2025-04-13 20:42:00,409 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 136 predicate places. [2025-04-13 20:42:00,409 INFO L485 AbstractCegarLoop]: Abstraction has has 165 places, 281 transitions, 2331 flow [2025-04-13 20:42:00,409 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.423076923076923) internal successors, (141), 26 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-13 20:42:00,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:42:00,409 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:42:00,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 20:42:00,613 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:42:00,613 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:42:00,613 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:42:00,613 INFO L85 PathProgramCache]: Analyzing trace with hash -722539693, now seen corresponding path program 6 times [2025-04-13 20:42:00,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:42:00,614 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688120293] [2025-04-13 20:42:00,614 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:42:00,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:42:00,619 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:42:00,630 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:42:00,630 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:42:00,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:01,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:42:01,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:42:01,027 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688120293] [2025-04-13 20:42:01,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688120293] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:42:01,027 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129782282] [2025-04-13 20:42:01,027 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:42:01,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:42:01,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:42:01,029 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:42:01,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 20:42:01,074 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:42:01,091 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:42:01,091 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:42:01,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:01,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 20:42:01,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:42:01,126 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-13 20:42:01,352 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 66 treesize of output 38 [2025-04-13 20:42:01,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:42:01,386 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:42:02,126 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 172 treesize of output 154 [2025-04-13 20:42:02,132 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:42:02,132 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 301 treesize of output 248 [2025-04-13 20:42:02,427 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 69 treesize of output 61 [2025-04-13 20:42:02,430 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 92 treesize of output 84 [2025-04-13 20:42:02,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:42:02,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129782282] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:42:02,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:42:02,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2025-04-13 20:42:02,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019231850] [2025-04-13 20:42:02,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:42:02,467 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 20:42:02,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:42:02,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 20:42:02,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2025-04-13 20:42:02,468 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:42:02,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 281 transitions, 2331 flow. Second operand has 27 states, 27 states have (on average 5.333333333333333) internal successors, (144), 27 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:02,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:42:02,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:42:02,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:42:04,272 INFO L116 PetriNetUnfolderBase]: 2508/3707 cut-off events. [2025-04-13 20:42:04,272 INFO L117 PetriNetUnfolderBase]: For 19579/19579 co-relation queries the response was YES. [2025-04-13 20:42:04,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19643 conditions, 3707 events. 2508/3707 cut-off events. For 19579/19579 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 17577 event pairs, 202 based on Foata normal form. 3/3686 useless extension candidates. Maximal degree in co-relation 19373. Up to 2685 conditions per place. [2025-04-13 20:42:04,295 INFO L140 encePairwiseOnDemand]: 14/28 looper letters, 273 selfloop transitions, 148 changer transitions 3/424 dead transitions. [2025-04-13 20:42:04,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 424 transitions, 4308 flow [2025-04-13 20:42:04,296 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 20:42:04,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-04-13 20:42:04,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 311 transitions. [2025-04-13 20:42:04,297 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.358294930875576 [2025-04-13 20:42:04,297 INFO L175 Difference]: Start difference. First operand has 165 places, 281 transitions, 2331 flow. Second operand 31 states and 311 transitions. [2025-04-13 20:42:04,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 424 transitions, 4308 flow [2025-04-13 20:42:04,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 424 transitions, 4156 flow, removed 43 selfloop flow, removed 12 redundant places. [2025-04-13 20:42:04,342 INFO L231 Difference]: Finished difference. Result has 189 places, 324 transitions, 3061 flow [2025-04-13 20:42:04,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2190, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=3061, PETRI_PLACES=189, PETRI_TRANSITIONS=324} [2025-04-13 20:42:04,343 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 160 predicate places. [2025-04-13 20:42:04,343 INFO L485 AbstractCegarLoop]: Abstraction has has 189 places, 324 transitions, 3061 flow [2025-04-13 20:42:04,343 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.333333333333333) internal successors, (144), 27 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:04,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:42:04,343 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:42:04,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 20:42:04,544 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:42:04,544 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:42:04,544 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:42:04,545 INFO L85 PathProgramCache]: Analyzing trace with hash 713619355, now seen corresponding path program 7 times [2025-04-13 20:42:04,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:42:04,545 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838348983] [2025-04-13 20:42:04,545 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:42:04,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:42:04,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:42:04,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:42:04,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:42:04,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:04,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:42:04,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:42:04,602 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838348983] [2025-04-13 20:42:04,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838348983] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:42:04,602 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929224491] [2025-04-13 20:42:04,602 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:42:04,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:42:04,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:42:04,604 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-13 20:42:04,606 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-13 20:42:04,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:42:04,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:42:04,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:42:04,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:04,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:42:04,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:42:04,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:42:04,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:42:04,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:42:04,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929224491] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:42:04,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:42:04,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-04-13 20:42:04,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38392943] [2025-04-13 20:42:04,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:42:04,755 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 20:42:04,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:42:04,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 20:42:04,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-04-13 20:42:04,756 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:42:04,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 324 transitions, 3061 flow. Second operand has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:04,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:42:04,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:42:04,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:42:05,272 INFO L116 PetriNetUnfolderBase]: 2754/4063 cut-off events. [2025-04-13 20:42:05,272 INFO L117 PetriNetUnfolderBase]: For 29061/29061 co-relation queries the response was YES. [2025-04-13 20:42:05,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23373 conditions, 4063 events. 2754/4063 cut-off events. For 29061/29061 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 19610 event pairs, 699 based on Foata normal form. 70/4121 useless extension candidates. Maximal degree in co-relation 23169. Up to 2990 conditions per place. [2025-04-13 20:42:05,297 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 350 selfloop transitions, 40 changer transitions 1/391 dead transitions. [2025-04-13 20:42:05,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 391 transitions, 4479 flow [2025-04-13 20:42:05,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:42:05,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:42:05,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2025-04-13 20:42:05,298 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4330357142857143 [2025-04-13 20:42:05,298 INFO L175 Difference]: Start difference. First operand has 189 places, 324 transitions, 3061 flow. Second operand 8 states and 97 transitions. [2025-04-13 20:42:05,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 391 transitions, 4479 flow [2025-04-13 20:42:05,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 391 transitions, 4051 flow, removed 156 selfloop flow, removed 16 redundant places. [2025-04-13 20:42:05,361 INFO L231 Difference]: Finished difference. Result has 183 places, 326 transitions, 2898 flow [2025-04-13 20:42:05,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2664, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2898, PETRI_PLACES=183, PETRI_TRANSITIONS=326} [2025-04-13 20:42:05,363 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 154 predicate places. [2025-04-13 20:42:05,363 INFO L485 AbstractCegarLoop]: Abstraction has has 183 places, 326 transitions, 2898 flow [2025-04-13 20:42:05,363 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:05,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:42:05,363 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:42:05,369 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-13 20:42:05,563 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,SelfDestructingSolverStorable9 [2025-04-13 20:42:05,564 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:42:05,564 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:42:05,564 INFO L85 PathProgramCache]: Analyzing trace with hash -2028752685, now seen corresponding path program 8 times [2025-04-13 20:42:05,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:42:05,564 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133083323] [2025-04-13 20:42:05,564 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:42:05,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:42:05,573 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:42:05,577 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:42:05,577 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:42:05,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:05,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:42:05,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:42:05,632 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133083323] [2025-04-13 20:42:05,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133083323] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:42:05,632 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386792713] [2025-04-13 20:42:05,632 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:42:05,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:42:05,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:42:05,634 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-13 20:42:05,636 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-13 20:42:05,679 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:42:05,696 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:42:05,696 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:42:05,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:05,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 20:42:05,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:42:05,750 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:42:05,750 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:42:05,788 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:42:05,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386792713] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:42:05,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:42:05,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-04-13 20:42:05,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709908981] [2025-04-13 20:42:05,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:42:05,788 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 20:42:05,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:42:05,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 20:42:05,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 20:42:05,789 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:42:05,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 326 transitions, 2898 flow. Second operand has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:05,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:42:05,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:42:05,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:42:06,540 INFO L116 PetriNetUnfolderBase]: 3544/5342 cut-off events. [2025-04-13 20:42:06,540 INFO L117 PetriNetUnfolderBase]: For 39184/39184 co-relation queries the response was YES. [2025-04-13 20:42:06,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30595 conditions, 5342 events. 3544/5342 cut-off events. For 39184/39184 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 28557 event pairs, 533 based on Foata normal form. 12/5332 useless extension candidates. Maximal degree in co-relation 30355. Up to 2162 conditions per place. [2025-04-13 20:42:06,569 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 621 selfloop transitions, 167 changer transitions 22/810 dead transitions. [2025-04-13 20:42:06,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 810 transitions, 8593 flow [2025-04-13 20:42:06,570 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:42:06,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:42:06,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2025-04-13 20:42:06,571 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4607142857142857 [2025-04-13 20:42:06,571 INFO L175 Difference]: Start difference. First operand has 183 places, 326 transitions, 2898 flow. Second operand 10 states and 129 transitions. [2025-04-13 20:42:06,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 810 transitions, 8593 flow [2025-04-13 20:42:06,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 810 transitions, 8494 flow, removed 45 selfloop flow, removed 4 redundant places. [2025-04-13 20:42:06,665 INFO L231 Difference]: Finished difference. Result has 196 places, 395 transitions, 4246 flow [2025-04-13 20:42:06,665 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2859, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4246, PETRI_PLACES=196, PETRI_TRANSITIONS=395} [2025-04-13 20:42:06,665 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 167 predicate places. [2025-04-13 20:42:06,665 INFO L485 AbstractCegarLoop]: Abstraction has has 196 places, 395 transitions, 4246 flow [2025-04-13 20:42:06,665 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:06,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:42:06,666 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:42:06,671 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-13 20:42:06,866 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:42:06,866 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:42:06,866 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:42:06,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1747189643, now seen corresponding path program 9 times [2025-04-13 20:42:06,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:42:06,867 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198647135] [2025-04-13 20:42:06,867 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:42:06,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:42:06,871 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:42:06,876 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:42:06,876 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:42:06,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:06,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:42:06,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:42:06,931 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198647135] [2025-04-13 20:42:06,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198647135] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:42:06,931 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21290324] [2025-04-13 20:42:06,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:42:06,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:42:06,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:42:06,933 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-13 20:42:06,935 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-13 20:42:06,979 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:42:06,995 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:42:06,996 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:42:06,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:06,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 20:42:06,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:42:07,031 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:42:07,031 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:42:07,072 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:42:07,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21290324] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:42:07,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:42:07,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-04-13 20:42:07,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83182070] [2025-04-13 20:42:07,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:42:07,073 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 20:42:07,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:42:07,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 20:42:07,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-04-13 20:42:07,074 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:42:07,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 395 transitions, 4246 flow. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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-13 20:42:07,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:42:07,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:42:07,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:42:08,172 INFO L116 PetriNetUnfolderBase]: 4198/6340 cut-off events. [2025-04-13 20:42:08,173 INFO L117 PetriNetUnfolderBase]: For 65144/65144 co-relation queries the response was YES. [2025-04-13 20:42:08,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41873 conditions, 6340 events. 4198/6340 cut-off events. For 65144/65144 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 35183 event pairs, 316 based on Foata normal form. 10/6338 useless extension candidates. Maximal degree in co-relation 41601. Up to 2727 conditions per place. [2025-04-13 20:42:08,218 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 381 selfloop transitions, 189 changer transitions 0/570 dead transitions. [2025-04-13 20:42:08,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 570 transitions, 7312 flow [2025-04-13 20:42:08,218 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 20:42:08,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 20:42:08,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 155 transitions. [2025-04-13 20:42:08,219 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46130952380952384 [2025-04-13 20:42:08,219 INFO L175 Difference]: Start difference. First operand has 196 places, 395 transitions, 4246 flow. Second operand 12 states and 155 transitions. [2025-04-13 20:42:08,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 570 transitions, 7312 flow [2025-04-13 20:42:08,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 570 transitions, 6846 flow, removed 174 selfloop flow, removed 1 redundant places. [2025-04-13 20:42:08,456 INFO L231 Difference]: Finished difference. Result has 215 places, 412 transitions, 4917 flow [2025-04-13 20:42:08,457 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=3997, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=172, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4917, PETRI_PLACES=215, PETRI_TRANSITIONS=412} [2025-04-13 20:42:08,457 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 186 predicate places. [2025-04-13 20:42:08,457 INFO L485 AbstractCegarLoop]: Abstraction has has 215 places, 412 transitions, 4917 flow [2025-04-13 20:42:08,457 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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-13 20:42:08,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:42:08,457 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:42:08,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 20:42:08,658 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,SelfDestructingSolverStorable11 [2025-04-13 20:42:08,658 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:42:08,658 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:42:08,658 INFO L85 PathProgramCache]: Analyzing trace with hash -87415800, now seen corresponding path program 1 times [2025-04-13 20:42:08,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:42:08,658 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220044464] [2025-04-13 20:42:08,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:42:08,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:42:08,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:42:08,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:42:08,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:42:08,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:08,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:42:08,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:42:08,711 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220044464] [2025-04-13 20:42:08,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220044464] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:42:08,711 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753744580] [2025-04-13 20:42:08,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:42:08,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:42:08,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:42:08,713 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-13 20:42:08,715 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-13 20:42:08,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:42:08,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:42:08,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:42:08,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:08,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:42:08,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:42:08,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:42:08,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:42:08,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:42:08,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753744580] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:42:08,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:42:08,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-04-13 20:42:08,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749022071] [2025-04-13 20:42:08,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:42:08,869 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 20:42:08,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:42:08,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 20:42:08,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-04-13 20:42:08,869 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:42:08,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 412 transitions, 4917 flow. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:08,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:42:08,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:42:08,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:42:09,663 INFO L116 PetriNetUnfolderBase]: 3513/5488 cut-off events. [2025-04-13 20:42:09,663 INFO L117 PetriNetUnfolderBase]: For 82617/82617 co-relation queries the response was YES. [2025-04-13 20:42:09,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39283 conditions, 5488 events. 3513/5488 cut-off events. For 82617/82617 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 31234 event pairs, 1154 based on Foata normal form. 318/5794 useless extension candidates. Maximal degree in co-relation 38980. Up to 2605 conditions per place. [2025-04-13 20:42:09,698 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 495 selfloop transitions, 16 changer transitions 27/538 dead transitions. [2025-04-13 20:42:09,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 538 transitions, 7634 flow [2025-04-13 20:42:09,698 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:42:09,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:42:09,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2025-04-13 20:42:09,699 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2025-04-13 20:42:09,699 INFO L175 Difference]: Start difference. First operand has 215 places, 412 transitions, 4917 flow. Second operand 6 states and 75 transitions. [2025-04-13 20:42:09,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 538 transitions, 7634 flow [2025-04-13 20:42:09,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 538 transitions, 7082 flow, removed 121 selfloop flow, removed 9 redundant places. [2025-04-13 20:42:09,915 INFO L231 Difference]: Finished difference. Result has 213 places, 338 transitions, 3976 flow [2025-04-13 20:42:09,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=3986, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3976, PETRI_PLACES=213, PETRI_TRANSITIONS=338} [2025-04-13 20:42:09,915 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 184 predicate places. [2025-04-13 20:42:09,915 INFO L485 AbstractCegarLoop]: Abstraction has has 213 places, 338 transitions, 3976 flow [2025-04-13 20:42:09,915 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:09,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:42:09,916 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:42:09,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 20:42:10,116 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,SelfDestructingSolverStorable12 [2025-04-13 20:42:10,116 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:42:10,117 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:42:10,117 INFO L85 PathProgramCache]: Analyzing trace with hash 100702665, now seen corresponding path program 10 times [2025-04-13 20:42:10,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:42:10,117 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730371145] [2025-04-13 20:42:10,117 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:42:10,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:42:10,121 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:42:10,124 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:42:10,124 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:42:10,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:10,168 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:42:10,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:42:10,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730371145] [2025-04-13 20:42:10,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730371145] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:42:10,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285860822] [2025-04-13 20:42:10,169 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:42:10,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:42:10,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:42:10,170 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-13 20:42:10,172 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-13 20:42:10,217 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:42:10,231 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:42:10,232 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:42:10,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:10,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 20:42:10,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:42:10,281 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:42:10,281 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:42:10,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:42:10,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285860822] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:42:10,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:42:10,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-04-13 20:42:10,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839926397] [2025-04-13 20:42:10,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:42:10,311 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 20:42:10,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:42:10,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 20:42:10,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-04-13 20:42:10,312 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:42:10,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 338 transitions, 3976 flow. Second operand has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:10,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:42:10,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:42:10,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:42:11,351 INFO L116 PetriNetUnfolderBase]: 4996/7718 cut-off events. [2025-04-13 20:42:11,351 INFO L117 PetriNetUnfolderBase]: For 115689/115689 co-relation queries the response was YES. [2025-04-13 20:42:11,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55288 conditions, 7718 events. 4996/7718 cut-off events. For 115689/115689 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 46523 event pairs, 701 based on Foata normal form. 12/7716 useless extension candidates. Maximal degree in co-relation 54985. Up to 3400 conditions per place. [2025-04-13 20:42:11,406 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 613 selfloop transitions, 246 changer transitions 6/865 dead transitions. [2025-04-13 20:42:11,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 865 transitions, 11368 flow [2025-04-13 20:42:11,406 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:42:11,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:42:11,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2025-04-13 20:42:11,407 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45 [2025-04-13 20:42:11,407 INFO L175 Difference]: Start difference. First operand has 213 places, 338 transitions, 3976 flow. Second operand 10 states and 126 transitions. [2025-04-13 20:42:11,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 865 transitions, 11368 flow [2025-04-13 20:42:11,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 865 transitions, 11178 flow, removed 62 selfloop flow, removed 6 redundant places. [2025-04-13 20:42:11,910 INFO L231 Difference]: Finished difference. Result has 224 places, 524 transitions, 7398 flow [2025-04-13 20:42:11,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=3905, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7398, PETRI_PLACES=224, PETRI_TRANSITIONS=524} [2025-04-13 20:42:11,911 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 195 predicate places. [2025-04-13 20:42:11,911 INFO L485 AbstractCegarLoop]: Abstraction has has 224 places, 524 transitions, 7398 flow [2025-04-13 20:42:11,911 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:11,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:42:11,911 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:42:11,917 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-13 20:42:12,112 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,SelfDestructingSolverStorable13 [2025-04-13 20:42:12,112 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:42:12,112 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:42:12,112 INFO L85 PathProgramCache]: Analyzing trace with hash 317394333, now seen corresponding path program 11 times [2025-04-13 20:42:12,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:42:12,112 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090953003] [2025-04-13 20:42:12,113 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:42:12,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:42:12,117 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:42:12,120 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:42:12,120 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:42:12,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:12,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:42:12,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:42:12,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090953003] [2025-04-13 20:42:12,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090953003] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:42:12,159 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491993948] [2025-04-13 20:42:12,159 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:42:12,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:42:12,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:42:12,160 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-13 20:42:12,162 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-13 20:42:12,206 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:42:12,227 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:42:12,227 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:42:12,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:12,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:42:12,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:42:12,258 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:42:12,258 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:42:12,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:42:12,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491993948] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:42:12,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:42:12,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 20:42:12,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094780904] [2025-04-13 20:42:12,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:42:12,287 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 20:42:12,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:42:12,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 20:42:12,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-04-13 20:42:12,287 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:42:12,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 524 transitions, 7398 flow. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:12,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:42:12,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:42:12,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:42:13,013 INFO L116 PetriNetUnfolderBase]: 2767/4354 cut-off events. [2025-04-13 20:42:13,013 INFO L117 PetriNetUnfolderBase]: For 72106/72106 co-relation queries the response was YES. [2025-04-13 20:42:13,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32914 conditions, 4354 events. 2767/4354 cut-off events. For 72106/72106 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 23864 event pairs, 943 based on Foata normal form. 436/4776 useless extension candidates. Maximal degree in co-relation 32764. Up to 2338 conditions per place. [2025-04-13 20:42:13,046 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 250 selfloop transitions, 103 changer transitions 21/374 dead transitions. [2025-04-13 20:42:13,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 374 transitions, 5608 flow [2025-04-13 20:42:13,046 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:42:13,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:42:13,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 88 transitions. [2025-04-13 20:42:13,047 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4489795918367347 [2025-04-13 20:42:13,047 INFO L175 Difference]: Start difference. First operand has 224 places, 524 transitions, 7398 flow. Second operand 7 states and 88 transitions. [2025-04-13 20:42:13,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 374 transitions, 5608 flow [2025-04-13 20:42:13,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 374 transitions, 5151 flow, removed 121 selfloop flow, removed 12 redundant places. [2025-04-13 20:42:13,240 INFO L231 Difference]: Finished difference. Result has 214 places, 320 transitions, 4146 flow [2025-04-13 20:42:13,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=4149, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4146, PETRI_PLACES=214, PETRI_TRANSITIONS=320} [2025-04-13 20:42:13,241 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 185 predicate places. [2025-04-13 20:42:13,241 INFO L485 AbstractCegarLoop]: Abstraction has has 214 places, 320 transitions, 4146 flow [2025-04-13 20:42:13,241 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:13,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:42:13,241 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:42:13,246 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-13 20:42:13,441 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,SelfDestructingSolverStorable14 [2025-04-13 20:42:13,441 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:42:13,442 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:42:13,442 INFO L85 PathProgramCache]: Analyzing trace with hash 383343446, now seen corresponding path program 1 times [2025-04-13 20:42:13,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:42:13,442 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327535449] [2025-04-13 20:42:13,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:42:13,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:42:13,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 20:42:13,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:42:13,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:42:13,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:13,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:42:13,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:42:13,504 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327535449] [2025-04-13 20:42:13,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327535449] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:42:13,504 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713830861] [2025-04-13 20:42:13,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:42:13,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:42:13,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:42:13,507 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-13 20:42:13,508 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-13 20:42:13,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 20:42:13,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:42:13,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:42:13,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:13,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 20:42:13,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:42:13,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:42:13,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:42:13,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:42:13,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713830861] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:42:13,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:42:13,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 20:42:13,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079471068] [2025-04-13 20:42:13,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:42:13,696 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:42:13,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:42:13,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:42:13,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:42:13,696 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:42:13,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 320 transitions, 4146 flow. Second operand has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 12 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:13,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:42:13,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:42:13,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:42:14,236 INFO L116 PetriNetUnfolderBase]: 1985/3109 cut-off events. [2025-04-13 20:42:14,237 INFO L117 PetriNetUnfolderBase]: For 36659/36659 co-relation queries the response was YES. [2025-04-13 20:42:14,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22687 conditions, 3109 events. 1985/3109 cut-off events. For 36659/36659 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 15432 event pairs, 751 based on Foata normal form. 120/3213 useless extension candidates. Maximal degree in co-relation 22613. Up to 2338 conditions per place. [2025-04-13 20:42:14,261 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 162 selfloop transitions, 3 changer transitions 125/290 dead transitions. [2025-04-13 20:42:14,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 290 transitions, 4337 flow [2025-04-13 20:42:14,261 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:42:14,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:42:14,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2025-04-13 20:42:14,262 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2025-04-13 20:42:14,262 INFO L175 Difference]: Start difference. First operand has 214 places, 320 transitions, 4146 flow. Second operand 6 states and 68 transitions. [2025-04-13 20:42:14,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 290 transitions, 4337 flow [2025-04-13 20:42:14,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 290 transitions, 4049 flow, removed 14 selfloop flow, removed 15 redundant places. [2025-04-13 20:42:14,360 INFO L231 Difference]: Finished difference. Result has 191 places, 165 transitions, 2039 flow [2025-04-13 20:42:14,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=3295, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2039, PETRI_PLACES=191, PETRI_TRANSITIONS=165} [2025-04-13 20:42:14,360 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 162 predicate places. [2025-04-13 20:42:14,360 INFO L485 AbstractCegarLoop]: Abstraction has has 191 places, 165 transitions, 2039 flow [2025-04-13 20:42:14,361 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 12 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:14,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:42:14,361 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:42:14,366 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-13 20:42:14,561 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:42:14,561 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:42:14,561 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:42:14,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1138149229, now seen corresponding path program 12 times [2025-04-13 20:42:14,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:42:14,562 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305380725] [2025-04-13 20:42:14,562 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:42:14,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:42:14,567 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:42:14,571 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:42:14,571 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:42:14,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:14,638 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:42:14,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:42:14,639 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305380725] [2025-04-13 20:42:14,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305380725] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:42:14,639 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028520855] [2025-04-13 20:42:14,639 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:42:14,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:42:14,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:42:14,641 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-13 20:42:14,644 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-13 20:42:14,690 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:42:14,706 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:42:14,707 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:42:14,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:14,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 20:42:14,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:42:14,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:42:14,765 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:42:14,819 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:42:14,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028520855] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:42:14,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:42:14,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 16 [2025-04-13 20:42:14,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038889912] [2025-04-13 20:42:14,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:42:14,819 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:42:14,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:42:14,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:42:14,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2025-04-13 20:42:14,820 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:42:14,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 165 transitions, 2039 flow. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:14,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:42:14,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:42:14,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:42:15,273 INFO L116 PetriNetUnfolderBase]: 2537/3807 cut-off events. [2025-04-13 20:42:15,274 INFO L117 PetriNetUnfolderBase]: For 44488/44488 co-relation queries the response was YES. [2025-04-13 20:42:15,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28791 conditions, 3807 events. 2537/3807 cut-off events. For 44488/44488 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 18591 event pairs, 607 based on Foata normal form. 52/3843 useless extension candidates. Maximal degree in co-relation 28723. Up to 2190 conditions per place. [2025-04-13 20:42:15,296 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 241 selfloop transitions, 50 changer transitions 0/291 dead transitions. [2025-04-13 20:42:15,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 291 transitions, 4523 flow [2025-04-13 20:42:15,297 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:42:15,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:42:15,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2025-04-13 20:42:15,297 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-04-13 20:42:15,297 INFO L175 Difference]: Start difference. First operand has 191 places, 165 transitions, 2039 flow. Second operand 8 states and 84 transitions. [2025-04-13 20:42:15,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 291 transitions, 4523 flow [2025-04-13 20:42:15,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 291 transitions, 4066 flow, removed 144 selfloop flow, removed 13 redundant places. [2025-04-13 20:42:15,397 INFO L231 Difference]: Finished difference. Result has 153 places, 184 transitions, 2277 flow [2025-04-13 20:42:15,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1832, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2277, PETRI_PLACES=153, PETRI_TRANSITIONS=184} [2025-04-13 20:42:15,397 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 124 predicate places. [2025-04-13 20:42:15,397 INFO L485 AbstractCegarLoop]: Abstraction has has 153 places, 184 transitions, 2277 flow [2025-04-13 20:42:15,397 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:15,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:42:15,397 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:42:15,403 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-13 20:42:15,598 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-13 20:42:15,598 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:42:15,598 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:42:15,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1098936599, now seen corresponding path program 13 times [2025-04-13 20:42:15,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:42:15,599 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5952537] [2025-04-13 20:42:15,599 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:42:15,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:42:15,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 20:42:15,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:42:15,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:42:15,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:15,657 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:42:15,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:42:15,657 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5952537] [2025-04-13 20:42:15,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5952537] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:42:15,657 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815122525] [2025-04-13 20:42:15,657 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:42:15,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:42:15,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:42:15,659 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-13 20:42:15,661 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-13 20:42:15,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 20:42:15,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:42:15,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:42:15,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:15,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 20:42:15,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:42:15,782 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:42:15,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:42:15,822 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:42:15,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815122525] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:42:15,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:42:15,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 15 [2025-04-13 20:42:15,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281638561] [2025-04-13 20:42:15,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:42:15,823 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:42:15,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:42:15,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:42:15,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-04-13 20:42:15,823 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:42:15,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 184 transitions, 2277 flow. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:15,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:42:15,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:42:15,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:42:16,251 INFO L116 PetriNetUnfolderBase]: 2630/3945 cut-off events. [2025-04-13 20:42:16,252 INFO L117 PetriNetUnfolderBase]: For 38372/38372 co-relation queries the response was YES. [2025-04-13 20:42:16,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27453 conditions, 3945 events. 2630/3945 cut-off events. For 38372/38372 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 19622 event pairs, 563 based on Foata normal form. 70/4015 useless extension candidates. Maximal degree in co-relation 27389. Up to 2336 conditions per place. [2025-04-13 20:42:16,277 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 186 selfloop transitions, 55 changer transitions 0/241 dead transitions. [2025-04-13 20:42:16,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 241 transitions, 3570 flow [2025-04-13 20:42:16,277 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:42:16,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:42:16,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 85 transitions. [2025-04-13 20:42:16,277 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3794642857142857 [2025-04-13 20:42:16,277 INFO L175 Difference]: Start difference. First operand has 153 places, 184 transitions, 2277 flow. Second operand 8 states and 85 transitions. [2025-04-13 20:42:16,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 241 transitions, 3570 flow [2025-04-13 20:42:16,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 241 transitions, 3521 flow, removed 18 selfloop flow, removed 5 redundant places. [2025-04-13 20:42:16,365 INFO L231 Difference]: Finished difference. Result has 153 places, 177 transitions, 2420 flow [2025-04-13 20:42:16,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2146, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2420, PETRI_PLACES=153, PETRI_TRANSITIONS=177} [2025-04-13 20:42:16,366 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 124 predicate places. [2025-04-13 20:42:16,366 INFO L485 AbstractCegarLoop]: Abstraction has has 153 places, 177 transitions, 2420 flow [2025-04-13 20:42:16,366 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:16,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:42:16,366 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:42:16,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-13 20:42:16,566 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-13 20:42:16,567 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:42:16,567 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:42:16,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1715998649, now seen corresponding path program 14 times [2025-04-13 20:42:16,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:42:16,567 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497560089] [2025-04-13 20:42:16,567 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:42:16,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:42:16,571 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:42:16,575 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:42:16,575 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:42:16,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:16,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:42:16,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:42:16,621 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497560089] [2025-04-13 20:42:16,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497560089] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:42:16,621 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161526052] [2025-04-13 20:42:16,621 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:42:16,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:42:16,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:42:16,623 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-13 20:42:16,623 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-13 20:42:16,668 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:42:16,682 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:42:16,682 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:42:16,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:16,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 20:42:16,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:42:16,726 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:42:16,726 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:42:16,774 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:42:16,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161526052] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:42:16,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:42:16,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 15 [2025-04-13 20:42:16,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062230413] [2025-04-13 20:42:16,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:42:16,774 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:42:16,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:42:16,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:42:16,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-04-13 20:42:16,775 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:42:16,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 177 transitions, 2420 flow. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:16,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:42:16,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:42:16,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:42:17,212 INFO L116 PetriNetUnfolderBase]: 2657/3989 cut-off events. [2025-04-13 20:42:17,213 INFO L117 PetriNetUnfolderBase]: For 44199/44199 co-relation queries the response was YES. [2025-04-13 20:42:17,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28568 conditions, 3989 events. 2657/3989 cut-off events. For 44199/44199 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 19856 event pairs, 624 based on Foata normal form. 17/4006 useless extension candidates. Maximal degree in co-relation 28504. Up to 2369 conditions per place. [2025-04-13 20:42:17,235 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 218 selfloop transitions, 51 changer transitions 0/269 dead transitions. [2025-04-13 20:42:17,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 269 transitions, 4242 flow [2025-04-13 20:42:17,236 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:42:17,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:42:17,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2025-04-13 20:42:17,236 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35267857142857145 [2025-04-13 20:42:17,236 INFO L175 Difference]: Start difference. First operand has 153 places, 177 transitions, 2420 flow. Second operand 8 states and 79 transitions. [2025-04-13 20:42:17,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 269 transitions, 4242 flow [2025-04-13 20:42:17,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 269 transitions, 4156 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-13 20:42:17,314 INFO L231 Difference]: Finished difference. Result has 158 places, 182 transitions, 2629 flow [2025-04-13 20:42:17,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2366, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2629, PETRI_PLACES=158, PETRI_TRANSITIONS=182} [2025-04-13 20:42:17,315 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 129 predicate places. [2025-04-13 20:42:17,315 INFO L485 AbstractCegarLoop]: Abstraction has has 158 places, 182 transitions, 2629 flow [2025-04-13 20:42:17,315 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:17,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:42:17,315 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:42:17,321 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-13 20:42:17,515 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:42:17,516 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:42:17,516 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:42:17,516 INFO L85 PathProgramCache]: Analyzing trace with hash 820187933, now seen corresponding path program 15 times [2025-04-13 20:42:17,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:42:17,516 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047337177] [2025-04-13 20:42:17,516 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:42:17,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:42:17,521 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:42:17,524 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:42:17,524 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:42:17,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:17,579 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:42:17,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:42:17,580 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047337177] [2025-04-13 20:42:17,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047337177] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:42:17,580 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567591782] [2025-04-13 20:42:17,580 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:42:17,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:42:17,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:42:17,582 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-13 20:42:17,583 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-13 20:42:17,629 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:42:17,644 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:42:17,644 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:42:17,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:17,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 20:42:17,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:42:17,710 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:42:17,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:42:17,755 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:42:17,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567591782] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:42:17,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:42:17,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 16 [2025-04-13 20:42:17,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814498705] [2025-04-13 20:42:17,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:42:17,756 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:42:17,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:42:17,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:42:17,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-04-13 20:42:17,756 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:42:17,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 182 transitions, 2629 flow. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:17,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:42:17,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:42:17,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:42:18,198 INFO L116 PetriNetUnfolderBase]: 2603/3935 cut-off events. [2025-04-13 20:42:18,198 INFO L117 PetriNetUnfolderBase]: For 48514/48514 co-relation queries the response was YES. [2025-04-13 20:42:18,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28847 conditions, 3935 events. 2603/3935 cut-off events. For 48514/48514 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 19763 event pairs, 852 based on Foata normal form. 54/3989 useless extension candidates. Maximal degree in co-relation 28780. Up to 2842 conditions per place. [2025-04-13 20:42:18,225 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 216 selfloop transitions, 53 changer transitions 0/269 dead transitions. [2025-04-13 20:42:18,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 269 transitions, 4451 flow [2025-04-13 20:42:18,225 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:42:18,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:42:18,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2025-04-13 20:42:18,226 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3705357142857143 [2025-04-13 20:42:18,226 INFO L175 Difference]: Start difference. First operand has 158 places, 182 transitions, 2629 flow. Second operand 8 states and 83 transitions. [2025-04-13 20:42:18,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 269 transitions, 4451 flow [2025-04-13 20:42:18,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 269 transitions, 4382 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-04-13 20:42:18,326 INFO L231 Difference]: Finished difference. Result has 163 places, 200 transitions, 3060 flow [2025-04-13 20:42:18,326 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2572, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3060, PETRI_PLACES=163, PETRI_TRANSITIONS=200} [2025-04-13 20:42:18,327 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 134 predicate places. [2025-04-13 20:42:18,327 INFO L485 AbstractCegarLoop]: Abstraction has has 163 places, 200 transitions, 3060 flow [2025-04-13 20:42:18,327 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:18,327 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:42:18,327 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:42:18,333 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-13 20:42:18,527 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:42:18,527 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:42:18,528 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:42:18,528 INFO L85 PathProgramCache]: Analyzing trace with hash 462316923, now seen corresponding path program 16 times [2025-04-13 20:42:18,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:42:18,528 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560283657] [2025-04-13 20:42:18,528 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:42:18,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:42:18,532 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:42:18,535 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:42:18,535 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:42:18,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:18,581 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:42:18,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:42:18,582 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560283657] [2025-04-13 20:42:18,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560283657] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:42:18,582 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662132308] [2025-04-13 20:42:18,582 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:42:18,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:42:18,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:42:18,584 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-13 20:42:18,585 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-13 20:42:18,633 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:42:18,647 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:42:18,647 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:42:18,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:18,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 20:42:18,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:42:18,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:42:18,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:42:18,759 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:42:18,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662132308] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:42:18,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:42:18,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 16 [2025-04-13 20:42:18,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115143162] [2025-04-13 20:42:18,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:42:18,760 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:42:18,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:42:18,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:42:18,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2025-04-13 20:42:18,760 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:42:18,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 200 transitions, 3060 flow. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:18,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:42:18,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:42:18,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:42:19,209 INFO L116 PetriNetUnfolderBase]: 2554/3824 cut-off events. [2025-04-13 20:42:19,209 INFO L117 PetriNetUnfolderBase]: For 48244/48244 co-relation queries the response was YES. [2025-04-13 20:42:19,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28825 conditions, 3824 events. 2554/3824 cut-off events. For 48244/48244 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 18745 event pairs, 606 based on Foata normal form. 22/3846 useless extension candidates. Maximal degree in co-relation 28756. Up to 2269 conditions per place. [2025-04-13 20:42:19,233 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 217 selfloop transitions, 71 changer transitions 0/288 dead transitions. [2025-04-13 20:42:19,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 288 transitions, 4842 flow [2025-04-13 20:42:19,234 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:42:19,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:42:19,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2025-04-13 20:42:19,234 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36160714285714285 [2025-04-13 20:42:19,234 INFO L175 Difference]: Start difference. First operand has 163 places, 200 transitions, 3060 flow. Second operand 8 states and 81 transitions. [2025-04-13 20:42:19,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 288 transitions, 4842 flow [2025-04-13 20:42:19,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 288 transitions, 4749 flow, removed 23 selfloop flow, removed 4 redundant places. [2025-04-13 20:42:19,340 INFO L231 Difference]: Finished difference. Result has 168 places, 205 transitions, 3269 flow [2025-04-13 20:42:19,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2969, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3269, PETRI_PLACES=168, PETRI_TRANSITIONS=205} [2025-04-13 20:42:19,340 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 139 predicate places. [2025-04-13 20:42:19,341 INFO L485 AbstractCegarLoop]: Abstraction has has 168 places, 205 transitions, 3269 flow [2025-04-13 20:42:19,341 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:19,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:42:19,341 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:42:19,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-04-13 20:42:19,541 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:42:19,541 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:42:19,541 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:42:19,542 INFO L85 PathProgramCache]: Analyzing trace with hash 825319673, now seen corresponding path program 17 times [2025-04-13 20:42:19,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:42:19,542 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117181664] [2025-04-13 20:42:19,542 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:42:19,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:42:19,546 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:42:19,549 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:42:19,549 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:42:19,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:19,601 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:42:19,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:42:19,601 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117181664] [2025-04-13 20:42:19,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117181664] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:42:19,601 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216319121] [2025-04-13 20:42:19,601 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:42:19,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:42:19,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:42:19,603 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-13 20:42:19,605 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-13 20:42:19,651 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:42:19,665 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:42:19,665 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:42:19,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:19,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 20:42:19,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:42:19,707 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:42:19,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:42:19,747 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:42:19,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216319121] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:42:19,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:42:19,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 16 [2025-04-13 20:42:19,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984593010] [2025-04-13 20:42:19,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:42:19,747 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 20:42:19,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:42:19,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 20:42:19,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-04-13 20:42:19,748 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:42:19,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 205 transitions, 3269 flow. Second operand has 16 states, 16 states have (on average 5.6875) internal successors, (91), 16 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:19,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:42:19,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:42:19,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:42:20,467 INFO L116 PetriNetUnfolderBase]: 2500/3706 cut-off events. [2025-04-13 20:42:20,467 INFO L117 PetriNetUnfolderBase]: For 50403/50403 co-relation queries the response was YES. [2025-04-13 20:42:20,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28489 conditions, 3706 events. 2500/3706 cut-off events. For 50403/50403 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 18009 event pairs, 359 based on Foata normal form. 24/3730 useless extension candidates. Maximal degree in co-relation 28418. Up to 2219 conditions per place. [2025-04-13 20:42:20,494 INFO L140 encePairwiseOnDemand]: 16/28 looper letters, 197 selfloop transitions, 185 changer transitions 0/382 dead transitions. [2025-04-13 20:42:20,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 382 transitions, 6533 flow [2025-04-13 20:42:20,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 20:42:20,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-13 20:42:20,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 194 transitions. [2025-04-13 20:42:20,495 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3464285714285714 [2025-04-13 20:42:20,495 INFO L175 Difference]: Start difference. First operand has 168 places, 205 transitions, 3269 flow. Second operand 20 states and 194 transitions. [2025-04-13 20:42:20,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 382 transitions, 6533 flow [2025-04-13 20:42:20,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 382 transitions, 6315 flow, removed 31 selfloop flow, removed 5 redundant places. [2025-04-13 20:42:20,609 INFO L231 Difference]: Finished difference. Result has 185 places, 283 transitions, 4963 flow [2025-04-13 20:42:20,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=3081, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4963, PETRI_PLACES=185, PETRI_TRANSITIONS=283} [2025-04-13 20:42:20,609 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 156 predicate places. [2025-04-13 20:42:20,609 INFO L485 AbstractCegarLoop]: Abstraction has has 185 places, 283 transitions, 4963 flow [2025-04-13 20:42:20,609 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.6875) internal successors, (91), 16 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:20,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:42:20,609 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:42:20,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-04-13 20:42:20,809 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,SelfDestructingSolverStorable21 [2025-04-13 20:42:20,810 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:42:20,810 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:42:20,810 INFO L85 PathProgramCache]: Analyzing trace with hash 143259286, now seen corresponding path program 2 times [2025-04-13 20:42:20,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:42:20,810 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916096212] [2025-04-13 20:42:20,810 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:42:20,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:42:20,815 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:42:20,836 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:42:20,836 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:42:20,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:21,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:42:21,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:42:21,843 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916096212] [2025-04-13 20:42:21,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916096212] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:42:21,843 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362239328] [2025-04-13 20:42:21,843 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:42:21,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:42:21,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:42:21,845 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-13 20:42:21,845 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-13 20:42:21,892 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:42:21,909 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:42:21,909 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:42:21,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:21,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-04-13 20:42:21,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:42:21,979 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-13 20:42:22,382 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:42:22,382 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 104 [2025-04-13 20:42:22,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:42:22,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:42:26,921 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 791 treesize of output 707 [2025-04-13 20:42:26,941 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:42:26,942 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1557 treesize of output 1216 [2025-04-13 20:42:32,244 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 674 treesize of output 598 [2025-04-13 20:42:32,255 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:42:32,256 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 1122 treesize of output 952 [2025-04-13 20:42:33,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:42:33,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362239328] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:42:33,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:42:33,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2025-04-13 20:42:33,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19510175] [2025-04-13 20:42:33,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:42:33,556 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 20:42:33,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:42:33,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 20:42:33,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1186, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 20:42:33,558 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:42:33,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 283 transitions, 4963 flow. Second operand has 37 states, 37 states have (on average 4.8108108108108105) internal successors, (178), 37 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-13 20:42:33,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:42:33,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:42:33,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:42:38,227 INFO L116 PetriNetUnfolderBase]: 3191/4739 cut-off events. [2025-04-13 20:42:38,227 INFO L117 PetriNetUnfolderBase]: For 61801/61801 co-relation queries the response was YES. [2025-04-13 20:42:38,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37423 conditions, 4739 events. 3191/4739 cut-off events. For 61801/61801 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 23693 event pairs, 348 based on Foata normal form. 2/4741 useless extension candidates. Maximal degree in co-relation 37349. Up to 3850 conditions per place. [2025-04-13 20:42:38,274 INFO L140 encePairwiseOnDemand]: 15/28 looper letters, 383 selfloop transitions, 252 changer transitions 6/641 dead transitions. [2025-04-13 20:42:38,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 641 transitions, 10661 flow [2025-04-13 20:42:38,274 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 20:42:38,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-04-13 20:42:38,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 426 transitions. [2025-04-13 20:42:38,277 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3307453416149068 [2025-04-13 20:42:38,277 INFO L175 Difference]: Start difference. First operand has 185 places, 283 transitions, 4963 flow. Second operand 46 states and 426 transitions. [2025-04-13 20:42:38,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 641 transitions, 10661 flow [2025-04-13 20:42:38,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 641 transitions, 9816 flow, removed 224 selfloop flow, removed 9 redundant places. [2025-04-13 20:42:38,686 INFO L231 Difference]: Finished difference. Result has 236 places, 498 transitions, 8284 flow [2025-04-13 20:42:38,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=4438, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=8284, PETRI_PLACES=236, PETRI_TRANSITIONS=498} [2025-04-13 20:42:38,687 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 207 predicate places. [2025-04-13 20:42:38,687 INFO L485 AbstractCegarLoop]: Abstraction has has 236 places, 498 transitions, 8284 flow [2025-04-13 20:42:38,687 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 4.8108108108108105) internal successors, (178), 37 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-13 20:42:38,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:42:38,687 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:42:38,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-13 20:42:38,888 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,SelfDestructingSolverStorable22 [2025-04-13 20:42:38,888 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:42:38,889 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:42:38,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1512934234, now seen corresponding path program 3 times [2025-04-13 20:42:38,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:42:38,889 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841509199] [2025-04-13 20:42:38,889 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:42:38,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:42:38,904 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:42:39,057 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:42:39,057 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:42:39,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:41,272 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:42:41,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:42:41,272 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841509199] [2025-04-13 20:42:41,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841509199] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:42:41,272 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206278657] [2025-04-13 20:42:41,272 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:42:41,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:42:41,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:42:41,275 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-13 20:42:41,276 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-13 20:42:41,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:42:41,363 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:42:41,363 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:42:41,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:41,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-04-13 20:42:41,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:42:41,433 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-13 20:42:42,092 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:42:42,093 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 104 [2025-04-13 20:42:42,323 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:42:42,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:42:46,177 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 649 treesize of output 579 [2025-04-13 20:42:46,195 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:42:46,195 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1340 treesize of output 1046 [2025-04-13 20:42:51,098 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 739 treesize of output 657 [2025-04-13 20:42:51,115 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 20:42:51,116 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1784 treesize of output 1386 [2025-04-13 20:43:01,362 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:43:01,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206278657] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:43:01,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:43:01,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 37 [2025-04-13 20:43:01,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006998194] [2025-04-13 20:43:01,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:43:01,362 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 20:43:01,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:01,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 20:43:01,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1323, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 20:43:01,364 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:43:01,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 498 transitions, 8284 flow. Second operand has 39 states, 39 states have (on average 4.846153846153846) internal successors, (189), 39 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:43:01,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:01,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:43:01,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:06,645 INFO L116 PetriNetUnfolderBase]: 4612/6869 cut-off events. [2025-04-13 20:43:06,645 INFO L117 PetriNetUnfolderBase]: For 83042/83042 co-relation queries the response was YES. [2025-04-13 20:43:06,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54853 conditions, 6869 events. 4612/6869 cut-off events. For 83042/83042 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 37452 event pairs, 225 based on Foata normal form. 2/6871 useless extension candidates. Maximal degree in co-relation 54765. Up to 4793 conditions per place. [2025-04-13 20:43:06,706 INFO L140 encePairwiseOnDemand]: 15/28 looper letters, 583 selfloop transitions, 369 changer transitions 7/959 dead transitions. [2025-04-13 20:43:06,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 959 transitions, 15991 flow [2025-04-13 20:43:06,707 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-04-13 20:43:06,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2025-04-13 20:43:06,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 545 transitions. [2025-04-13 20:43:06,709 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3475765306122449 [2025-04-13 20:43:06,709 INFO L175 Difference]: Start difference. First operand has 236 places, 498 transitions, 8284 flow. Second operand 56 states and 545 transitions. [2025-04-13 20:43:06,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 959 transitions, 15991 flow [2025-04-13 20:43:07,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 959 transitions, 15194 flow, removed 395 selfloop flow, removed 3 redundant places. [2025-04-13 20:43:07,222 INFO L231 Difference]: Finished difference. Result has 303 places, 651 transitions, 11211 flow [2025-04-13 20:43:07,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=7505, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=238, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=11211, PETRI_PLACES=303, PETRI_TRANSITIONS=651} [2025-04-13 20:43:07,223 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 274 predicate places. [2025-04-13 20:43:07,223 INFO L485 AbstractCegarLoop]: Abstraction has has 303 places, 651 transitions, 11211 flow [2025-04-13 20:43:07,224 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.846153846153846) internal successors, (189), 39 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:43:07,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:07,224 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:43:07,230 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-13 20:43:07,428 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:43:07,428 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:43:07,429 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:07,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1533476, now seen corresponding path program 4 times [2025-04-13 20:43:07,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:07,429 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402410564] [2025-04-13 20:43:07,429 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:43:07,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:07,436 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:43:07,462 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:43:07,462 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:43:07,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:08,677 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:43:08,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:08,678 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402410564] [2025-04-13 20:43:08,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402410564] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:43:08,678 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931643351] [2025-04-13 20:43:08,678 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:43:08,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:43:08,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:43:08,680 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-13 20:43:08,680 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-13 20:43:08,742 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:43:08,763 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:43:08,763 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:43:08,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:08,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 20:43:08,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:43:09,337 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:43:09,338 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 180 treesize of output 104 [2025-04-13 20:43:09,561 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:43:09,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:43:10,488 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:43:10,489 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 489 treesize of output 255 [2025-04-13 20:43:14,386 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:43:14,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931643351] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:43:14,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:43:14,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 37 [2025-04-13 20:43:14,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812823757] [2025-04-13 20:43:14,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:43:14,387 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 20:43:14,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:14,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 20:43:14,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1317, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 20:43:14,388 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:43:14,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 651 transitions, 11211 flow. Second operand has 39 states, 39 states have (on average 4.846153846153846) internal successors, (189), 39 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:43:14,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:14,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:43:14,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:19,423 INFO L116 PetriNetUnfolderBase]: 5051/7547 cut-off events. [2025-04-13 20:43:19,423 INFO L117 PetriNetUnfolderBase]: For 110126/110126 co-relation queries the response was YES. [2025-04-13 20:43:19,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63469 conditions, 7547 events. 5051/7547 cut-off events. For 110126/110126 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 42001 event pairs, 267 based on Foata normal form. 2/7547 useless extension candidates. Maximal degree in co-relation 63365. Up to 5457 conditions per place. [2025-04-13 20:43:19,493 INFO L140 encePairwiseOnDemand]: 13/28 looper letters, 654 selfloop transitions, 364 changer transitions 7/1025 dead transitions. [2025-04-13 20:43:19,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 1025 transitions, 18217 flow [2025-04-13 20:43:19,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-13 20:43:19,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-04-13 20:43:19,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 454 transitions. [2025-04-13 20:43:19,495 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38605442176870747 [2025-04-13 20:43:19,495 INFO L175 Difference]: Start difference. First operand has 303 places, 651 transitions, 11211 flow. Second operand 42 states and 454 transitions. [2025-04-13 20:43:19,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 1025 transitions, 18217 flow [2025-04-13 20:43:20,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 1025 transitions, 16978 flow, removed 470 selfloop flow, removed 17 redundant places. [2025-04-13 20:43:20,164 INFO L231 Difference]: Finished difference. Result has 345 places, 755 transitions, 12843 flow [2025-04-13 20:43:20,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=10078, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=651, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=272, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=12843, PETRI_PLACES=345, PETRI_TRANSITIONS=755} [2025-04-13 20:43:20,165 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 316 predicate places. [2025-04-13 20:43:20,166 INFO L485 AbstractCegarLoop]: Abstraction has has 345 places, 755 transitions, 12843 flow [2025-04-13 20:43:20,166 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.846153846153846) internal successors, (189), 39 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:43:20,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:20,166 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:43:20,172 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-13 20:43:20,366 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:43:20,366 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:43:20,367 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:20,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1719877182, now seen corresponding path program 5 times [2025-04-13 20:43:20,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:20,367 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656905200] [2025-04-13 20:43:20,367 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:43:20,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:20,373 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:43:20,387 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:43:20,391 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:43:20,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:21,330 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:43:21,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:21,330 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656905200] [2025-04-13 20:43:21,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656905200] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:43:21,330 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620404291] [2025-04-13 20:43:21,331 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:43:21,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:43:21,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:43:21,332 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-13 20:43:21,333 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-13 20:43:21,429 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:43:21,447 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:43:21,447 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:43:21,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:21,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 20:43:21,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:43:21,978 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:43:21,978 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 180 treesize of output 104 [2025-04-13 20:43:22,177 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:43:22,178 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:43:23,143 INFO L325 Elim1Store]: treesize reduction 10, result has 78.7 percent of original size [2025-04-13 20:43:23,143 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 499 treesize of output 245 [2025-04-13 20:43:24,617 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:43:24,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620404291] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:43:24,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:43:24,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2025-04-13 20:43:24,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475847688] [2025-04-13 20:43:24,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:43:24,618 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 20:43:24,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:24,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 20:43:24,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1193, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 20:43:24,618 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:43:24,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 755 transitions, 12843 flow. Second operand has 37 states, 37 states have (on average 4.864864864864865) internal successors, (180), 37 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-13 20:43:24,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:24,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:43:24,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:32,226 INFO L116 PetriNetUnfolderBase]: 7368/10917 cut-off events. [2025-04-13 20:43:32,226 INFO L117 PetriNetUnfolderBase]: For 178581/178581 co-relation queries the response was YES. [2025-04-13 20:43:32,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95296 conditions, 10917 events. 7368/10917 cut-off events. For 178581/178581 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 63546 event pairs, 291 based on Foata normal form. 4/10919 useless extension candidates. Maximal degree in co-relation 95174. Up to 6493 conditions per place. [2025-04-13 20:43:32,341 INFO L140 encePairwiseOnDemand]: 13/28 looper letters, 793 selfloop transitions, 713 changer transitions 2/1508 dead transitions. [2025-04-13 20:43:32,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 1508 transitions, 27980 flow [2025-04-13 20:43:32,342 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-04-13 20:43:32,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2025-04-13 20:43:32,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 564 transitions. [2025-04-13 20:43:32,343 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3949579831932773 [2025-04-13 20:43:32,343 INFO L175 Difference]: Start difference. First operand has 345 places, 755 transitions, 12843 flow. Second operand 51 states and 564 transitions. [2025-04-13 20:43:32,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 1508 transitions, 27980 flow [2025-04-13 20:43:33,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 1508 transitions, 26877 flow, removed 393 selfloop flow, removed 16 redundant places. [2025-04-13 20:43:33,501 INFO L231 Difference]: Finished difference. Result has 411 places, 1184 transitions, 22077 flow [2025-04-13 20:43:33,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=11915, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=755, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=358, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=22077, PETRI_PLACES=411, PETRI_TRANSITIONS=1184} [2025-04-13 20:43:33,504 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 382 predicate places. [2025-04-13 20:43:33,504 INFO L485 AbstractCegarLoop]: Abstraction has has 411 places, 1184 transitions, 22077 flow [2025-04-13 20:43:33,504 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 4.864864864864865) internal successors, (180), 37 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-13 20:43:33,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:33,504 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:43:33,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-04-13 20:43:33,705 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,SelfDestructingSolverStorable25 [2025-04-13 20:43:33,705 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:43:33,706 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:33,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1378672632, now seen corresponding path program 6 times [2025-04-13 20:43:33,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:33,706 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472231600] [2025-04-13 20:43:33,706 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:43:33,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:33,711 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:43:33,726 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:43:33,727 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:43:33,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:34,792 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:43:34,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:34,792 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472231600] [2025-04-13 20:43:34,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472231600] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:43:34,792 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193612710] [2025-04-13 20:43:34,792 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:43:34,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:43:34,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:43:34,794 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-13 20:43:34,795 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-13 20:43:34,848 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:43:34,865 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:43:34,865 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:43:34,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:34,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-04-13 20:43:34,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:43:34,926 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-13 20:43:35,562 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:43:35,563 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 104 [2025-04-13 20:43:35,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:43:35,815 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:43:39,565 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 639 treesize of output 569 [2025-04-13 20:43:39,579 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:43:39,580 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1290 treesize of output 1006 [2025-04-13 20:43:51,984 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 729 treesize of output 647 [2025-04-13 20:43:52,005 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 20:43:52,005 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1766 treesize of output 1378 [2025-04-13 20:44:00,242 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:44:00,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193612710] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:44:00,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:44:00,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 37 [2025-04-13 20:44:00,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517462770] [2025-04-13 20:44:00,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:44:00,243 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 20:44:00,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:44:00,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 20:44:00,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1306, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 20:44:00,244 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:44:00,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 1184 transitions, 22077 flow. Second operand has 39 states, 39 states have (on average 4.846153846153846) internal successors, (189), 39 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:44:00,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:44:00,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:44:00,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:44:07,008 INFO L116 PetriNetUnfolderBase]: 8202/12149 cut-off events. [2025-04-13 20:44:07,008 INFO L117 PetriNetUnfolderBase]: For 285946/285946 co-relation queries the response was YES. [2025-04-13 20:44:07,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119413 conditions, 12149 events. 8202/12149 cut-off events. For 285946/285946 co-relation queries the response was YES. Maximal size of possible extension queue 695. Compared 71993 event pairs, 699 based on Foata normal form. 2/12151 useless extension candidates. Maximal degree in co-relation 119258. Up to 10441 conditions per place. [2025-04-13 20:44:07,136 INFO L140 encePairwiseOnDemand]: 14/28 looper letters, 1184 selfloop transitions, 414 changer transitions 6/1604 dead transitions. [2025-04-13 20:44:07,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 1604 transitions, 32653 flow [2025-04-13 20:44:07,136 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 20:44:07,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2025-04-13 20:44:07,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 430 transitions. [2025-04-13 20:44:07,137 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2025-04-13 20:44:07,137 INFO L175 Difference]: Start difference. First operand has 411 places, 1184 transitions, 22077 flow. Second operand 43 states and 430 transitions. [2025-04-13 20:44:07,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 1604 transitions, 32653 flow [2025-04-13 20:44:09,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 1604 transitions, 30584 flow, removed 940 selfloop flow, removed 9 redundant places. [2025-04-13 20:44:09,296 INFO L231 Difference]: Finished difference. Result has 459 places, 1384 transitions, 25331 flow [2025-04-13 20:44:09,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=20038, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=249, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=887, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=25331, PETRI_PLACES=459, PETRI_TRANSITIONS=1384} [2025-04-13 20:44:09,297 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 430 predicate places. [2025-04-13 20:44:09,297 INFO L485 AbstractCegarLoop]: Abstraction has has 459 places, 1384 transitions, 25331 flow [2025-04-13 20:44:09,297 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.846153846153846) internal successors, (189), 39 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:44:09,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:44:09,298 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:44:09,304 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-13 20:44:09,498 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-13 20:44:09,498 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:44:09,499 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:44:09,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1676725590, now seen corresponding path program 7 times [2025-04-13 20:44:09,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:44:09,499 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477041348] [2025-04-13 20:44:09,499 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:44:09,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:44:09,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:44:09,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:44:09,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:44:09,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:44:10,896 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:44:10,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:44:10,897 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477041348] [2025-04-13 20:44:10,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477041348] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:44:10,897 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857134655] [2025-04-13 20:44:10,897 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:44:10,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:44:10,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:44:10,901 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-13 20:44:10,902 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-13 20:44:10,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:44:10,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:44:10,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:44:10,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:44:10,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 20:44:10,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:44:11,647 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:44:11,647 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 180 treesize of output 104 [2025-04-13 20:44:11,863 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:44:11,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:44:12,821 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:44:12,822 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 606 treesize of output 282 [2025-04-13 20:44:15,254 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:44:15,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857134655] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:44:15,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:44:15,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2025-04-13 20:44:15,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325738527] [2025-04-13 20:44:15,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:44:15,255 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 20:44:15,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:44:15,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 20:44:15,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1195, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 20:44:15,256 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:44:15,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 1384 transitions, 25331 flow. Second operand has 37 states, 37 states have (on average 4.8108108108108105) internal successors, (178), 37 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-13 20:44:15,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:44:15,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:44:15,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:44:22,382 INFO L116 PetriNetUnfolderBase]: 8729/12986 cut-off events. [2025-04-13 20:44:22,382 INFO L117 PetriNetUnfolderBase]: For 319692/319692 co-relation queries the response was YES. [2025-04-13 20:44:22,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127744 conditions, 12986 events. 8729/12986 cut-off events. For 319692/319692 co-relation queries the response was YES. Maximal size of possible extension queue 764. Compared 78678 event pairs, 541 based on Foata normal form. 2/12988 useless extension candidates. Maximal degree in co-relation 127573. Up to 10361 conditions per place. [2025-04-13 20:44:22,548 INFO L140 encePairwiseOnDemand]: 13/28 looper letters, 1194 selfloop transitions, 562 changer transitions 5/1761 dead transitions. [2025-04-13 20:44:22,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 497 places, 1761 transitions, 35521 flow [2025-04-13 20:44:22,548 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 20:44:22,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-04-13 20:44:22,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 423 transitions. [2025-04-13 20:44:22,549 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3873626373626374 [2025-04-13 20:44:22,549 INFO L175 Difference]: Start difference. First operand has 459 places, 1384 transitions, 25331 flow. Second operand 39 states and 423 transitions. [2025-04-13 20:44:22,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 497 places, 1761 transitions, 35521 flow [2025-04-13 20:44:25,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 482 places, 1761 transitions, 34170 flow, removed 579 selfloop flow, removed 15 redundant places. [2025-04-13 20:44:25,336 INFO L231 Difference]: Finished difference. Result has 493 places, 1525 transitions, 28843 flow [2025-04-13 20:44:25,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=23990, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=451, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=890, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=28843, PETRI_PLACES=493, PETRI_TRANSITIONS=1525} [2025-04-13 20:44:25,337 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 464 predicate places. [2025-04-13 20:44:25,337 INFO L485 AbstractCegarLoop]: Abstraction has has 493 places, 1525 transitions, 28843 flow [2025-04-13 20:44:25,338 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 4.8108108108108105) internal successors, (178), 37 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-13 20:44:25,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:44:25,338 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:44:25,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-04-13 20:44:25,538 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,SelfDestructingSolverStorable27 [2025-04-13 20:44:25,538 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:44:25,539 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:44:25,540 INFO L85 PathProgramCache]: Analyzing trace with hash -340982620, now seen corresponding path program 8 times [2025-04-13 20:44:25,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:44:25,540 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891211797] [2025-04-13 20:44:25,540 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:44:25,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:44:25,545 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:44:25,556 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:44:25,556 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:44:25,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:44:26,567 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:44:26,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:44:26,568 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891211797] [2025-04-13 20:44:26,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891211797] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:44:26,568 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078725569] [2025-04-13 20:44:26,568 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:44:26,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:44:26,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:44:26,570 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-13 20:44:26,570 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-13 20:44:26,628 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:44:26,646 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:44:26,646 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:44:26,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:44:26,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 20:44:26,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:44:26,696 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-13 20:44:27,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:44:27,167 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:44:27,167 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 96 [2025-04-13 20:44:27,345 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:44:27,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:44:30,732 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 406 treesize of output 364 [2025-04-13 20:44:30,738 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:44:30,738 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 553 treesize of output 481 [2025-04-13 20:44:31,355 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 517 treesize of output 459 [2025-04-13 20:44:31,365 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:44:31,366 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 845 treesize of output 723 [2025-04-13 20:44:32,437 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:44:32,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078725569] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:44:32,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:44:32,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 36 [2025-04-13 20:44:32,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695155193] [2025-04-13 20:44:32,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:44:32,438 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 20:44:32,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:44:32,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 20:44:32,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1199, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 20:44:32,439 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:44:32,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 493 places, 1525 transitions, 28843 flow. Second operand has 38 states, 38 states have (on average 4.894736842105263) internal successors, (186), 38 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:44:32,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:44:32,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:44:32,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:44:38,522 INFO L116 PetriNetUnfolderBase]: 8861/13186 cut-off events. [2025-04-13 20:44:38,522 INFO L117 PetriNetUnfolderBase]: For 330560/330560 co-relation queries the response was YES. [2025-04-13 20:44:38,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131678 conditions, 13186 events. 8861/13186 cut-off events. For 330560/330560 co-relation queries the response was YES. Maximal size of possible extension queue 780. Compared 79996 event pairs, 563 based on Foata normal form. 1/13187 useless extension candidates. Maximal degree in co-relation 131496. Up to 11100 conditions per place. [2025-04-13 20:44:38,695 INFO L140 encePairwiseOnDemand]: 16/28 looper letters, 1267 selfloop transitions, 435 changer transitions 3/1705 dead transitions. [2025-04-13 20:44:38,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 511 places, 1705 transitions, 35434 flow [2025-04-13 20:44:38,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 20:44:38,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-13 20:44:38,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 194 transitions. [2025-04-13 20:44:38,696 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36466165413533835 [2025-04-13 20:44:38,696 INFO L175 Difference]: Start difference. First operand has 493 places, 1525 transitions, 28843 flow. Second operand 19 states and 194 transitions. [2025-04-13 20:44:38,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 511 places, 1705 transitions, 35434 flow [2025-04-13 20:44:41,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 494 places, 1705 transitions, 34122 flow, removed 490 selfloop flow, removed 17 redundant places. [2025-04-13 20:44:41,663 INFO L231 Difference]: Finished difference. Result has 502 places, 1589 transitions, 30116 flow [2025-04-13 20:44:41,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=27547, PETRI_DIFFERENCE_MINUEND_PLACES=476, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=373, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=30116, PETRI_PLACES=502, PETRI_TRANSITIONS=1589} [2025-04-13 20:44:41,664 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 473 predicate places. [2025-04-13 20:44:41,665 INFO L485 AbstractCegarLoop]: Abstraction has has 502 places, 1589 transitions, 30116 flow [2025-04-13 20:44:41,665 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 4.894736842105263) internal successors, (186), 38 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:44:41,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:44:41,665 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:44:41,719 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-13 20:44:41,865 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-13 20:44:41,866 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:44:41,866 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:44:41,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1933869822, now seen corresponding path program 9 times [2025-04-13 20:44:41,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:44:41,867 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65754140] [2025-04-13 20:44:41,867 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:44:41,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:44:41,872 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:44:41,884 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:44:41,884 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:44:41,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:44:43,628 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:44:43,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:44:43,628 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65754140] [2025-04-13 20:44:43,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65754140] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:44:43,628 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568974808] [2025-04-13 20:44:43,628 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:44:43,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:44:43,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:44:43,630 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-13 20:44:43,631 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-13 20:44:43,706 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:44:43,724 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:44:43,724 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:44:43,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:44:43,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-04-13 20:44:43,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:44:43,783 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-13 20:44:44,422 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:44:44,423 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 88 [2025-04-13 20:44:44,501 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:44:44,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:44:48,175 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 639 treesize of output 569 [2025-04-13 20:44:48,191 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:44:48,192 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1298 treesize of output 1014 [2025-04-13 20:44:54,500 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 513 treesize of output 455 [2025-04-13 20:44:54,510 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:44:54,510 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 841 treesize of output 723 [2025-04-13 20:44:55,362 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:44:55,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568974808] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:44:55,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:44:55,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 37 [2025-04-13 20:44:55,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146376686] [2025-04-13 20:44:55,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:44:55,363 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 20:44:55,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:44:55,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 20:44:55,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1335, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 20:44:55,364 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:44:55,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 502 places, 1589 transitions, 30116 flow. Second operand has 39 states, 39 states have (on average 4.846153846153846) internal successors, (189), 39 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:44:55,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:44:55,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:44:55,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:03,407 INFO L116 PetriNetUnfolderBase]: 9081/13536 cut-off events. [2025-04-13 20:45:03,407 INFO L117 PetriNetUnfolderBase]: For 351653/351653 co-relation queries the response was YES. [2025-04-13 20:45:03,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137492 conditions, 13536 events. 9081/13536 cut-off events. For 351653/351653 co-relation queries the response was YES. Maximal size of possible extension queue 818. Compared 82963 event pairs, 565 based on Foata normal form. 3/13539 useless extension candidates. Maximal degree in co-relation 137301. Up to 10992 conditions per place. [2025-04-13 20:45:03,568 INFO L140 encePairwiseOnDemand]: 14/28 looper letters, 1287 selfloop transitions, 580 changer transitions 6/1873 dead transitions. [2025-04-13 20:45:03,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 538 places, 1873 transitions, 38626 flow [2025-04-13 20:45:03,568 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 20:45:03,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-04-13 20:45:03,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 394 transitions. [2025-04-13 20:45:03,569 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3803088803088803 [2025-04-13 20:45:03,569 INFO L175 Difference]: Start difference. First operand has 502 places, 1589 transitions, 30116 flow. Second operand 37 states and 394 transitions. [2025-04-13 20:45:03,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 538 places, 1873 transitions, 38626 flow [2025-04-13 20:45:06,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 531 places, 1873 transitions, 38096 flow, removed 134 selfloop flow, removed 7 redundant places. [2025-04-13 20:45:06,808 INFO L231 Difference]: Finished difference. Result has 539 places, 1655 transitions, 32658 flow [2025-04-13 20:45:06,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=29586, PETRI_DIFFERENCE_MINUEND_PLACES=495, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1589, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=525, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1026, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=32658, PETRI_PLACES=539, PETRI_TRANSITIONS=1655} [2025-04-13 20:45:06,809 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 510 predicate places. [2025-04-13 20:45:06,809 INFO L485 AbstractCegarLoop]: Abstraction has has 539 places, 1655 transitions, 32658 flow [2025-04-13 20:45:06,810 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.846153846153846) internal successors, (189), 39 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:06,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:06,810 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:06,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-04-13 20:45:07,010 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:07,010 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:07,011 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:07,012 INFO L85 PathProgramCache]: Analyzing trace with hash -2059326326, now seen corresponding path program 10 times [2025-04-13 20:45:07,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:07,012 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674172680] [2025-04-13 20:45:07,012 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:45:07,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:07,024 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:45:07,041 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:45:07,042 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:45:07,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:07,859 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:45:07,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:07,859 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674172680] [2025-04-13 20:45:07,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674172680] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:07,859 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108142092] [2025-04-13 20:45:07,859 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:45:07,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:07,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:07,861 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-13 20:45:07,862 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-13 20:45:07,922 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:45:07,941 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:45:07,942 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:45:07,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:07,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 20:45:07,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:45:08,500 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:45:08,500 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 180 treesize of output 104 [2025-04-13 20:45:08,689 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:45:08,689 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:45:09,632 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:45:09,632 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 489 treesize of output 255 [2025-04-13 20:45:13,882 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:45:13,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108142092] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:45:13,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:45:13,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 37 [2025-04-13 20:45:13,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32593258] [2025-04-13 20:45:13,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:45:13,883 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 20:45:13,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:13,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 20:45:13,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1299, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 20:45:13,884 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:45:13,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 1655 transitions, 32658 flow. Second operand has 39 states, 39 states have (on average 4.846153846153846) internal successors, (189), 39 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:13,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:13,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:45:13,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:21,653 INFO L116 PetriNetUnfolderBase]: 9227/13757 cut-off events. [2025-04-13 20:45:21,653 INFO L117 PetriNetUnfolderBase]: For 377737/377737 co-relation queries the response was YES. [2025-04-13 20:45:21,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142985 conditions, 13757 events. 9227/13757 cut-off events. For 377737/377737 co-relation queries the response was YES. Maximal size of possible extension queue 828. Compared 84510 event pairs, 583 based on Foata normal form. 2/13759 useless extension candidates. Maximal degree in co-relation 142785. Up to 11539 conditions per place. [2025-04-13 20:45:21,838 INFO L140 encePairwiseOnDemand]: 15/28 looper letters, 1358 selfloop transitions, 521 changer transitions 7/1886 dead transitions. [2025-04-13 20:45:21,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 1886 transitions, 40127 flow [2025-04-13 20:45:21,838 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-13 20:45:21,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2025-04-13 20:45:21,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 418 transitions. [2025-04-13 20:45:21,839 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3732142857142857 [2025-04-13 20:45:21,839 INFO L175 Difference]: Start difference. First operand has 539 places, 1655 transitions, 32658 flow. Second operand 40 states and 418 transitions. [2025-04-13 20:45:21,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 1886 transitions, 40127 flow [2025-04-13 20:45:25,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 1886 transitions, 38747 flow, removed 327 selfloop flow, removed 25 redundant places. [2025-04-13 20:45:25,166 INFO L231 Difference]: Finished difference. Result has 564 places, 1697 transitions, 33721 flow [2025-04-13 20:45:25,167 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=31292, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1655, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=483, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=33721, PETRI_PLACES=564, PETRI_TRANSITIONS=1697} [2025-04-13 20:45:25,167 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 535 predicate places. [2025-04-13 20:45:25,167 INFO L485 AbstractCegarLoop]: Abstraction has has 564 places, 1697 transitions, 33721 flow [2025-04-13 20:45:25,168 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.846153846153846) internal successors, (189), 39 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:25,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:25,168 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:25,174 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-13 20:45:25,368 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:25,368 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:25,369 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:25,369 INFO L85 PathProgramCache]: Analyzing trace with hash -216715408, now seen corresponding path program 11 times [2025-04-13 20:45:25,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:25,369 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565577683] [2025-04-13 20:45:25,369 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:45:25,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:25,375 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:45:25,385 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:45:25,385 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:45:25,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:26,529 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:45:26,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:26,530 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565577683] [2025-04-13 20:45:26,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565577683] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:26,530 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532293845] [2025-04-13 20:45:26,530 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:45:26,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:26,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:26,532 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-13 20:45:26,533 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-13 20:45:26,592 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:45:26,610 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:45:26,610 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:45:26,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:26,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 20:45:26,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:45:26,663 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 19 treesize of output 1 [2025-04-13 20:45:27,227 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:45:27,227 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 172 treesize of output 88 [2025-04-13 20:45:27,301 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:45:27,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:45:31,172 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 639 treesize of output 569 [2025-04-13 20:45:31,186 INFO L325 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2025-04-13 20:45:31,187 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1322 treesize of output 1030 [2025-04-13 20:45:34,737 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 513 treesize of output 455 [2025-04-13 20:45:34,747 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:45:34,747 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 841 treesize of output 723 [2025-04-13 20:45:35,677 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:45:35,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532293845] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:45:35,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:45:35,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2025-04-13 20:45:35,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003790248] [2025-04-13 20:45:35,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:45:35,678 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 20:45:35,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:35,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 20:45:35,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1173, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 20:45:35,679 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:45:35,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 1697 transitions, 33721 flow. Second operand has 37 states, 37 states have (on average 4.864864864864865) internal successors, (180), 37 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-13 20:45:35,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:35,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:45:35,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:46,230 INFO L116 PetriNetUnfolderBase]: 11395/16928 cut-off events. [2025-04-13 20:45:46,230 INFO L117 PetriNetUnfolderBase]: For 496904/496904 co-relation queries the response was YES. [2025-04-13 20:45:46,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179349 conditions, 16928 events. 11395/16928 cut-off events. For 496904/496904 co-relation queries the response was YES. Maximal size of possible extension queue 986. Compared 106444 event pairs, 506 based on Foata normal form. 5/16933 useless extension candidates. Maximal degree in co-relation 179139. Up to 10715 conditions per place. [2025-04-13 20:45:46,474 INFO L140 encePairwiseOnDemand]: 14/28 looper letters, 1412 selfloop transitions, 1109 changer transitions 7/2528 dead transitions. [2025-04-13 20:45:46,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 603 places, 2528 transitions, 55581 flow [2025-04-13 20:45:46,475 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 20:45:46,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2025-04-13 20:45:46,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 499 transitions. [2025-04-13 20:45:46,476 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4346689895470383 [2025-04-13 20:45:46,476 INFO L175 Difference]: Start difference. First operand has 564 places, 1697 transitions, 33721 flow. Second operand 41 states and 499 transitions. [2025-04-13 20:45:46,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 603 places, 2528 transitions, 55581 flow [2025-04-13 20:45:51,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 582 places, 2528 transitions, 54306 flow, removed 334 selfloop flow, removed 21 redundant places. [2025-04-13 20:45:51,404 INFO L231 Difference]: Finished difference. Result has 602 places, 2069 transitions, 44521 flow [2025-04-13 20:45:51,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=32435, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1696, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=805, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=768, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=44521, PETRI_PLACES=602, PETRI_TRANSITIONS=2069} [2025-04-13 20:45:51,405 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 573 predicate places. [2025-04-13 20:45:51,405 INFO L485 AbstractCegarLoop]: Abstraction has has 602 places, 2069 transitions, 44521 flow [2025-04-13 20:45:51,405 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 4.864864864864865) internal successors, (180), 37 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-13 20:45:51,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:51,405 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:51,411 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-13 20:45:51,606 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,SelfDestructingSolverStorable31 [2025-04-13 20:45:51,606 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:51,607 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:51,607 INFO L85 PathProgramCache]: Analyzing trace with hash -932912926, now seen corresponding path program 12 times [2025-04-13 20:45:51,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:51,607 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660427919] [2025-04-13 20:45:51,607 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:45:51,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:51,612 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:45:51,623 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:45:51,623 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:45:51,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:52,707 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:45:52,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:52,707 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660427919] [2025-04-13 20:45:52,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660427919] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:52,707 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229319661] [2025-04-13 20:45:52,708 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:45:52,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:52,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:52,709 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-13 20:45:52,711 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-13 20:45:52,768 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:45:52,785 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:45:52,785 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:45:52,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:52,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-04-13 20:45:52,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:45:52,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-13 20:45:53,467 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:45:53,467 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 88 [2025-04-13 20:45:53,549 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:45:53,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:45:57,266 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 639 treesize of output 569 [2025-04-13 20:45:57,283 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:45:57,283 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1322 treesize of output 1038 [2025-04-13 20:46:10,736 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 513 treesize of output 455 [2025-04-13 20:46:10,746 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:46:10,746 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 841 treesize of output 723 [2025-04-13 20:46:11,656 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:46:11,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229319661] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:46:11,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:46:11,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 36 [2025-04-13 20:46:11,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52690775] [2025-04-13 20:46:11,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:46:11,656 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 20:46:11,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:11,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 20:46:11,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 20:46:11,657 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:46:11,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 602 places, 2069 transitions, 44521 flow. Second operand has 38 states, 38 states have (on average 4.815789473684211) internal successors, (183), 38 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:11,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:11,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:46:11,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:21,415 INFO L116 PetriNetUnfolderBase]: 11764/17448 cut-off events. [2025-04-13 20:46:21,416 INFO L117 PetriNetUnfolderBase]: For 570552/570552 co-relation queries the response was YES. [2025-04-13 20:46:21,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196437 conditions, 17448 events. 11764/17448 cut-off events. For 570552/570552 co-relation queries the response was YES. Maximal size of possible extension queue 1016. Compared 109711 event pairs, 823 based on Foata normal form. 3/17451 useless extension candidates. Maximal degree in co-relation 196206. Up to 14907 conditions per place. [2025-04-13 20:46:21,677 INFO L140 encePairwiseOnDemand]: 15/28 looper letters, 1723 selfloop transitions, 553 changer transitions 4/2280 dead transitions. [2025-04-13 20:46:21,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 629 places, 2280 transitions, 52772 flow [2025-04-13 20:46:21,678 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 20:46:21,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-04-13 20:46:21,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 320 transitions. [2025-04-13 20:46:21,682 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40816326530612246 [2025-04-13 20:46:21,682 INFO L175 Difference]: Start difference. First operand has 602 places, 2069 transitions, 44521 flow. Second operand 28 states and 320 transitions. [2025-04-13 20:46:21,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 629 places, 2280 transitions, 52772 flow [2025-04-13 20:46:28,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 2280 transitions, 49693 flow, removed 1240 selfloop flow, removed 21 redundant places. [2025-04-13 20:46:28,182 INFO L231 Difference]: Finished difference. Result has 617 places, 2132 transitions, 44465 flow [2025-04-13 20:46:28,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=41493, PETRI_DIFFERENCE_MINUEND_PLACES=581, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2069, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=494, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=44465, PETRI_PLACES=617, PETRI_TRANSITIONS=2132} [2025-04-13 20:46:28,185 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 588 predicate places. [2025-04-13 20:46:28,186 INFO L485 AbstractCegarLoop]: Abstraction has has 617 places, 2132 transitions, 44465 flow [2025-04-13 20:46:28,186 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 4.815789473684211) internal successors, (183), 38 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:28,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:28,186 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:46:28,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-04-13 20:46:28,386 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:28,386 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:46:28,387 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:28,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1839050146, now seen corresponding path program 13 times [2025-04-13 20:46:28,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:28,387 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531855442] [2025-04-13 20:46:28,387 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:46:28,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:28,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:46:28,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:46:28,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:46:28,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:29,507 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:46:29,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:29,507 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531855442] [2025-04-13 20:46:29,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531855442] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:46:29,507 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413603724] [2025-04-13 20:46:29,507 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:46:29,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:29,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:46:29,509 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-13 20:46:29,510 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-13 20:46:29,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:46:29,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:46:29,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:46:29,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:29,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 20:46:29,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:46:30,216 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:46:30,216 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 172 treesize of output 88 [2025-04-13 20:46:30,304 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:46:30,304 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:46:31,309 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:46:31,309 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 489 treesize of output 255 [2025-04-13 20:46:34,206 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:46:34,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413603724] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:46:34,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:46:34,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2025-04-13 20:46:34,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170878295] [2025-04-13 20:46:34,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:46:34,207 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 20:46:34,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:34,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 20:46:34,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1209, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 20:46:34,208 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:46:34,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 617 places, 2132 transitions, 44465 flow. Second operand has 37 states, 37 states have (on average 4.837837837837838) internal successors, (179), 37 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:34,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:34,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:46:34,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:47,353 INFO L116 PetriNetUnfolderBase]: 13456/20013 cut-off events. [2025-04-13 20:46:47,354 INFO L117 PetriNetUnfolderBase]: For 627377/627377 co-relation queries the response was YES. [2025-04-13 20:46:47,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223699 conditions, 20013 events. 13456/20013 cut-off events. For 627377/627377 co-relation queries the response was YES. Maximal size of possible extension queue 1170. Compared 129042 event pairs, 1057 based on Foata normal form. 2/20015 useless extension candidates. Maximal degree in co-relation 223463. Up to 16866 conditions per place. [2025-04-13 20:46:47,721 INFO L140 encePairwiseOnDemand]: 13/28 looper letters, 2088 selfloop transitions, 684 changer transitions 2/2774 dead transitions. [2025-04-13 20:46:47,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 657 places, 2774 transitions, 62839 flow [2025-04-13 20:46:47,722 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 20:46:47,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2025-04-13 20:46:47,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 440 transitions. [2025-04-13 20:46:47,722 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3832752613240418 [2025-04-13 20:46:47,722 INFO L175 Difference]: Start difference. First operand has 617 places, 2132 transitions, 44465 flow. Second operand 41 states and 440 transitions. [2025-04-13 20:46:47,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 657 places, 2774 transitions, 62839 flow [2025-04-13 20:46:55,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 643 places, 2774 transitions, 61618 flow, removed 243 selfloop flow, removed 14 redundant places. [2025-04-13 20:46:55,959 INFO L231 Difference]: Finished difference. Result has 658 places, 2480 transitions, 53984 flow [2025-04-13 20:46:55,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=43535, PETRI_DIFFERENCE_MINUEND_PLACES=603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=343, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1509, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=53984, PETRI_PLACES=658, PETRI_TRANSITIONS=2480} [2025-04-13 20:46:55,961 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 629 predicate places. [2025-04-13 20:46:55,961 INFO L485 AbstractCegarLoop]: Abstraction has has 658 places, 2480 transitions, 53984 flow [2025-04-13 20:46:55,961 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 4.837837837837838) internal successors, (179), 37 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:55,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:55,961 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:46:55,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-04-13 20:46:56,162 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:56,165 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:46:56,165 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:56,165 INFO L85 PathProgramCache]: Analyzing trace with hash -451805140, now seen corresponding path program 14 times [2025-04-13 20:46:56,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:56,165 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371125791] [2025-04-13 20:46:56,165 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:46:56,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:56,172 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:46:56,188 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:46:56,189 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:46:56,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:57,747 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:46:57,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:57,747 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371125791] [2025-04-13 20:46:57,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371125791] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:46:57,747 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750885209] [2025-04-13 20:46:57,747 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:46:57,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:57,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:46:57,749 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-13 20:46:57,750 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-13 20:46:57,809 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:46:57,826 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:46:57,827 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:46:57,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:57,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 20:46:57,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:46:57,871 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-13 20:46:58,429 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:46:58,429 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 88 [2025-04-13 20:46:58,516 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:46:58,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:47:01,988 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 406 treesize of output 364 [2025-04-13 20:47:01,994 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:47:01,995 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 553 treesize of output 481 [2025-04-13 20:47:02,537 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 517 treesize of output 459 [2025-04-13 20:47:02,545 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:47:02,545 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 845 treesize of output 723 [2025-04-13 20:47:03,543 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:47:03,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750885209] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:47:03,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:47:03,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 35 [2025-04-13 20:47:03,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676623241] [2025-04-13 20:47:03,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:47:03,544 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 20:47:03,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:47:03,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 20:47:03,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1153, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 20:47:03,544 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:47:03,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 2480 transitions, 53984 flow. Second operand has 37 states, 37 states have (on average 4.945945945945946) internal successors, (183), 37 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:47:03,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:47:03,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:47:03,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:47:15,421 INFO L116 PetriNetUnfolderBase]: 13588/20227 cut-off events. [2025-04-13 20:47:15,422 INFO L117 PetriNetUnfolderBase]: For 642801/642801 co-relation queries the response was YES. [2025-04-13 20:47:15,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231334 conditions, 20227 events. 13588/20227 cut-off events. For 642801/642801 co-relation queries the response was YES. Maximal size of possible extension queue 1157. Compared 130676 event pairs, 855 based on Foata normal form. 1/20228 useless extension candidates. Maximal degree in co-relation 231082. Up to 16879 conditions per place. [2025-04-13 20:47:15,830 INFO L140 encePairwiseOnDemand]: 15/28 looper letters, 1944 selfloop transitions, 693 changer transitions 4/2641 dead transitions. [2025-04-13 20:47:15,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 684 places, 2641 transitions, 61793 flow [2025-04-13 20:47:15,831 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 20:47:15,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-04-13 20:47:15,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 310 transitions. [2025-04-13 20:47:15,832 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39540816326530615 [2025-04-13 20:47:15,832 INFO L175 Difference]: Start difference. First operand has 658 places, 2480 transitions, 53984 flow. Second operand 28 states and 310 transitions. [2025-04-13 20:47:15,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 684 places, 2641 transitions, 61793 flow [2025-04-13 20:47:24,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 669 places, 2641 transitions, 61227 flow, removed 128 selfloop flow, removed 15 redundant places. [2025-04-13 20:47:24,652 INFO L231 Difference]: Finished difference. Result has 675 places, 2500 transitions, 55361 flow [2025-04-13 20:47:24,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=53411, PETRI_DIFFERENCE_MINUEND_PLACES=642, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=672, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1788, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=55361, PETRI_PLACES=675, PETRI_TRANSITIONS=2500} [2025-04-13 20:47:24,654 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 646 predicate places. [2025-04-13 20:47:24,654 INFO L485 AbstractCegarLoop]: Abstraction has has 675 places, 2500 transitions, 55361 flow [2025-04-13 20:47:24,654 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 4.945945945945946) internal successors, (183), 37 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:47:24,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:47:24,654 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:47:24,661 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-13 20:47:24,855 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,SelfDestructingSolverStorable34 [2025-04-13 20:47:24,855 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:47:24,856 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:47:24,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1179516932, now seen corresponding path program 15 times [2025-04-13 20:47:24,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:47:24,856 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157167408] [2025-04-13 20:47:24,856 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:47:24,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:47:24,861 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:47:24,873 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:47:24,874 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:47:24,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:47:25,523 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:47:25,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:47:25,524 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157167408] [2025-04-13 20:47:25,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157167408] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:47:25,524 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521111909] [2025-04-13 20:47:25,524 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:47:25,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:47:25,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:47:25,526 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-13 20:47:25,528 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-13 20:47:25,592 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:47:25,614 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:47:25,614 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:47:25,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:47:25,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 20:47:25,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:47:25,665 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-13 20:47:26,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:47:26,128 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:47:26,128 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 96 [2025-04-13 20:47:26,280 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:47:26,280 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:47:29,772 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 406 treesize of output 364 [2025-04-13 20:47:29,778 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:47:29,778 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 553 treesize of output 481 [2025-04-13 20:47:30,567 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 517 treesize of output 459 [2025-04-13 20:47:30,579 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:47:30,580 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 845 treesize of output 723 [2025-04-13 20:47:32,229 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:47:32,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521111909] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:47:32,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:47:32,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 33 [2025-04-13 20:47:32,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150178308] [2025-04-13 20:47:32,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:47:32,229 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 20:47:32,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:47:32,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 20:47:32,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1026, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 20:47:32,230 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:47:32,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 675 places, 2500 transitions, 55361 flow. Second operand has 35 states, 35 states have (on average 5.0285714285714285) internal successors, (176), 35 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:47:32,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:47:32,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:47:32,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:47:44,262 INFO L116 PetriNetUnfolderBase]: 13939/20763 cut-off events. [2025-04-13 20:47:44,262 INFO L117 PetriNetUnfolderBase]: For 679224/679224 co-relation queries the response was YES. [2025-04-13 20:47:44,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241555 conditions, 20763 events. 13939/20763 cut-off events. For 679224/679224 co-relation queries the response was YES. Maximal size of possible extension queue 1185. Compared 134730 event pairs, 1213 based on Foata normal form. 1/20764 useless extension candidates. Maximal degree in co-relation 241296. Up to 19111 conditions per place. [2025-04-13 20:47:44,658 INFO L140 encePairwiseOnDemand]: 16/28 looper letters, 2229 selfloop transitions, 462 changer transitions 1/2692 dead transitions. [2025-04-13 20:47:44,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 693 places, 2692 transitions, 64861 flow [2025-04-13 20:47:44,658 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 20:47:44,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-13 20:47:44,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 191 transitions. [2025-04-13 20:47:44,659 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35902255639097747 [2025-04-13 20:47:44,659 INFO L175 Difference]: Start difference. First operand has 675 places, 2500 transitions, 55361 flow. Second operand 19 states and 191 transitions. [2025-04-13 20:47:44,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 693 places, 2692 transitions, 64861 flow [2025-04-13 20:47:54,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 675 places, 2692 transitions, 63507 flow, removed 44 selfloop flow, removed 18 redundant places. [2025-04-13 20:47:54,372 INFO L231 Difference]: Finished difference. Result has 684 places, 2583 transitions, 57415 flow [2025-04-13 20:47:54,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=54083, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2500, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=382, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2057, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=57415, PETRI_PLACES=684, PETRI_TRANSITIONS=2583} [2025-04-13 20:47:54,374 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 655 predicate places. [2025-04-13 20:47:54,374 INFO L485 AbstractCegarLoop]: Abstraction has has 684 places, 2583 transitions, 57415 flow [2025-04-13 20:47:54,374 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 5.0285714285714285) internal successors, (176), 35 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:47:54,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:47:54,374 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:47:54,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2025-04-13 20:47:54,575 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,SelfDestructingSolverStorable35 [2025-04-13 20:47:54,575 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:47:54,576 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:47:54,576 INFO L85 PathProgramCache]: Analyzing trace with hash -457731216, now seen corresponding path program 16 times [2025-04-13 20:47:54,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:47:54,576 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143880434] [2025-04-13 20:47:54,576 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:47:54,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:47:54,582 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:47:54,594 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:47:54,595 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:47:54,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:47:55,272 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:47:55,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:47:55,272 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143880434] [2025-04-13 20:47:55,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143880434] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:47:55,272 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564337464] [2025-04-13 20:47:55,272 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:47:55,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:47:55,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:47:55,274 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-13 20:47:55,275 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-13 20:47:55,338 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:47:55,357 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:47:55,357 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:47:55,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:47:55,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 20:47:55,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:47:55,844 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:47:55,845 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 117 treesize of output 57 [2025-04-13 20:47:55,945 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:47:55,945 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:47:56,920 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:47:56,920 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 648 treesize of output 324 [2025-04-13 20:48:01,536 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:48:01,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564337464] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:48:01,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:48:01,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 34 [2025-04-13 20:48:01,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123539533] [2025-04-13 20:48:01,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:48:01,537 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 20:48:01,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:48:01,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 20:48:01,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1104, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 20:48:01,538 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:48:01,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 684 places, 2583 transitions, 57415 flow. Second operand has 36 states, 36 states have (on average 4.861111111111111) internal successors, (175), 36 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:48:01,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:48:01,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:48:01,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:48:15,038 INFO L116 PetriNetUnfolderBase]: 15024/22389 cut-off events. [2025-04-13 20:48:15,038 INFO L117 PetriNetUnfolderBase]: For 777595/777595 co-relation queries the response was YES. [2025-04-13 20:48:15,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262342 conditions, 22389 events. 15024/22389 cut-off events. For 777595/777595 co-relation queries the response was YES. Maximal size of possible extension queue 1304. Compared 147498 event pairs, 1092 based on Foata normal form. 2/22391 useless extension candidates. Maximal degree in co-relation 262074. Up to 18914 conditions per place. [2025-04-13 20:48:15,486 INFO L140 encePairwiseOnDemand]: 14/28 looper letters, 2112 selfloop transitions, 899 changer transitions 3/3014 dead transitions. [2025-04-13 20:48:15,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 716 places, 3014 transitions, 72579 flow [2025-04-13 20:48:15,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 20:48:15,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-04-13 20:48:15,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 359 transitions. [2025-04-13 20:48:15,487 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38852813852813856 [2025-04-13 20:48:15,487 INFO L175 Difference]: Start difference. First operand has 684 places, 2583 transitions, 57415 flow. Second operand 33 states and 359 transitions. [2025-04-13 20:48:15,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 716 places, 3014 transitions, 72579 flow [2025-04-13 20:48:26,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 711 places, 3014 transitions, 71946 flow, removed 203 selfloop flow, removed 5 redundant places. [2025-04-13 20:48:26,703 INFO L231 Difference]: Finished difference. Result has 720 places, 2822 transitions, 65014 flow [2025-04-13 20:48:26,705 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=56830, PETRI_DIFFERENCE_MINUEND_PLACES=679, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=682, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1791, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=65014, PETRI_PLACES=720, PETRI_TRANSITIONS=2822} [2025-04-13 20:48:26,705 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 691 predicate places. [2025-04-13 20:48:26,705 INFO L485 AbstractCegarLoop]: Abstraction has has 720 places, 2822 transitions, 65014 flow [2025-04-13 20:48:26,705 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.861111111111111) internal successors, (175), 36 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:48:26,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:48:26,706 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:48:26,712 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-13 20:48:26,906 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,SelfDestructingSolverStorable36 [2025-04-13 20:48:26,906 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:48:26,907 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:48:26,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1397106658, now seen corresponding path program 17 times [2025-04-13 20:48:26,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:48:26,907 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918886427] [2025-04-13 20:48:26,907 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:48:26,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:48:26,913 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:48:26,922 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:48:26,922 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:48:26,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:48:28,096 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:48:28,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:48:28,097 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918886427] [2025-04-13 20:48:28,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918886427] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:48:28,097 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279272075] [2025-04-13 20:48:28,097 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:48:28,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:48:28,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:48:28,099 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-13 20:48:28,101 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-13 20:48:28,194 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:48:28,215 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:48:28,215 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:48:28,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:48:28,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-04-13 20:48:28,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:48:28,258 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-13 20:48:28,289 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 19 treesize of output 1 [2025-04-13 20:48:28,873 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:48:28,874 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 180 treesize of output 104 [2025-04-13 20:48:29,126 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:48:29,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:48:34,731 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 184 treesize of output 170 [2025-04-13 20:48:34,748 INFO L325 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2025-04-13 20:48:34,748 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1047 treesize of output 931 [2025-04-13 20:48:35,781 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 81 treesize of output 75 [2025-04-13 20:48:35,793 INFO L325 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2025-04-13 20:48:35,794 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 338 treesize of output 324 [2025-04-13 20:48:36,012 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 169 treesize of output 155 [2025-04-13 20:48:36,024 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:48:36,025 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 1410 treesize of output 1302 [2025-04-13 20:48:36,283 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 173 treesize of output 159 [2025-04-13 20:48:36,293 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:48:36,293 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 1097 treesize of output 1029 [2025-04-13 20:48:36,647 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 126 treesize of output 116 [2025-04-13 20:48:36,654 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:48:36,655 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 274 treesize of output 258 [2025-04-13 20:48:36,738 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 98 treesize of output 90 [2025-04-13 20:48:36,748 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:48:36,748 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 832 treesize of output 1 [2025-04-13 20:48:36,753 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 101 treesize of output 93 [2025-04-13 20:48:36,761 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:48:36,761 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 295 treesize of output 1 [2025-04-13 20:48:36,766 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 170 treesize of output 156 [2025-04-13 20:48:36,776 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:48:36,776 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 1767 treesize of output 1647 [2025-04-13 20:48:37,120 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 150 treesize of output 138 [2025-04-13 20:48:37,128 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:48:37,129 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 333 treesize of output 1 [2025-04-13 20:48:37,135 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 124 treesize of output 114 [2025-04-13 20:48:37,145 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:48:37,145 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 464 treesize of output 430 [2025-04-13 20:48:37,488 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 101 treesize of output 93 [2025-04-13 20:48:37,496 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:48:37,496 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 225 treesize of output 213 [2025-04-13 20:48:37,575 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 119 treesize of output 109 [2025-04-13 20:48:37,586 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:48:37,586 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 1370 treesize of output 1 [2025-04-13 20:48:37,595 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 193 treesize of output 177 [2025-04-13 20:48:37,606 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:48:37,607 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 803 treesize of output 1 [2025-04-13 20:48:37,612 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 75 treesize of output 69 [2025-04-13 20:48:37,620 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:48:37,621 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 228 treesize of output 216 [2025-04-13 20:48:37,666 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 152 treesize of output 140 [2025-04-13 20:48:37,676 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:48:37,676 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 475 treesize of output 1 [2025-04-13 20:48:37,682 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 99 treesize of output 91 [2025-04-13 20:48:37,694 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:48:37,694 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 1456 treesize of output 1 [2025-04-13 20:48:37,700 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 146 treesize of output 134 [2025-04-13 20:48:37,711 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:48:37,711 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 1008 treesize of output 1 [2025-04-13 20:48:37,720 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 101 treesize of output 93 [2025-04-13 20:48:37,732 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:48:37,732 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 485 treesize of output 461 [2025-04-13 20:48:37,810 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 125 treesize of output 115 [2025-04-13 20:48:37,820 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:48:37,820 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 284 treesize of output 1 [2025-04-13 20:48:37,826 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 104 treesize of output 96 [2025-04-13 20:48:37,836 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:48:37,837 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 223 treesize of output 1 [2025-04-13 20:48:37,843 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 173 treesize of output 159 [2025-04-13 20:48:37,855 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:48:37,856 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 991 treesize of output 1 [2025-04-13 20:48:37,862 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 120 treesize of output 110 [2025-04-13 20:48:37,874 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:48:37,874 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 1525 treesize of output 1 [2025-04-13 20:48:37,883 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 121 treesize of output 111 [2025-04-13 20:48:37,895 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:48:37,895 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 753 treesize of output 1 [2025-04-13 20:48:37,995 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:48:37,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279272075] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:48:37,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:48:37,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 34 [2025-04-13 20:48:37,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634406694] [2025-04-13 20:48:37,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:48:37,996 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 20:48:37,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:48:37,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 20:48:37,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1109, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 20:48:37,997 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:48:37,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 720 places, 2822 transitions, 65014 flow. Second operand has 36 states, 36 states have (on average 4.916666666666667) internal successors, (177), 36 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:48:37,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:48:37,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:48:37,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:49:01,485 INFO L116 PetriNetUnfolderBase]: 16804/24978 cut-off events. [2025-04-13 20:49:01,485 INFO L117 PetriNetUnfolderBase]: For 953486/953486 co-relation queries the response was YES. [2025-04-13 20:49:01,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302155 conditions, 24978 events. 16804/24978 cut-off events. For 953486/953486 co-relation queries the response was YES. Maximal size of possible extension queue 1440. Compared 166162 event pairs, 1188 based on Foata normal form. 4/24982 useless extension candidates. Maximal degree in co-relation 301877. Up to 20160 conditions per place. [2025-04-13 20:49:01,961 INFO L140 encePairwiseOnDemand]: 13/28 looper letters, 2377 selfloop transitions, 1262 changer transitions 2/3641 dead transitions. [2025-04-13 20:49:01,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 774 places, 3641 transitions, 90339 flow [2025-04-13 20:49:01,961 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-04-13 20:49:01,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2025-04-13 20:49:01,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 595 transitions. [2025-04-13 20:49:01,962 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2025-04-13 20:49:01,962 INFO L175 Difference]: Start difference. First operand has 720 places, 2822 transitions, 65014 flow. Second operand 55 states and 595 transitions. [2025-04-13 20:49:01,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 774 places, 3641 transitions, 90339 flow [2025-04-13 20:49:17,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 756 places, 3641 transitions, 88888 flow, removed 448 selfloop flow, removed 18 redundant places. [2025-04-13 20:49:17,154 INFO L231 Difference]: Finished difference. Result has 783 places, 3293 transitions, 78988 flow [2025-04-13 20:49:17,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=63587, PETRI_DIFFERENCE_MINUEND_PLACES=702, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2822, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=833, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1840, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=78988, PETRI_PLACES=783, PETRI_TRANSITIONS=3293} [2025-04-13 20:49:17,156 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 754 predicate places. [2025-04-13 20:49:17,157 INFO L485 AbstractCegarLoop]: Abstraction has has 783 places, 3293 transitions, 78988 flow [2025-04-13 20:49:17,157 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.916666666666667) internal successors, (177), 36 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:49:17,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:49:17,157 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:49:17,163 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-13 20:49:17,357 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:49:17,357 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:49:17,359 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:49:17,359 INFO L85 PathProgramCache]: Analyzing trace with hash 313693118, now seen corresponding path program 18 times [2025-04-13 20:49:17,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:49:17,359 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908649626] [2025-04-13 20:49:17,359 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:49:17,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:49:17,365 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:49:17,376 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:49:17,377 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:49:17,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:49:18,789 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:49:18,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:49:18,789 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908649626] [2025-04-13 20:49:18,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908649626] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:49:18,789 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783811246] [2025-04-13 20:49:18,789 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:49:18,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:49:18,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:49:18,792 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-13 20:49:18,792 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-13 20:49:18,854 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:49:18,872 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:49:18,872 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:49:18,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:49:18,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-04-13 20:49:18,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:49:18,911 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-13 20:49:19,430 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:49:19,431 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 104 [2025-04-13 20:49:19,675 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:49:19,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:49:23,415 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 649 treesize of output 579 [2025-04-13 20:49:23,433 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:49:23,433 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1292 treesize of output 998 [2025-04-13 20:49:34,462 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 517 treesize of output 459 [2025-04-13 20:49:34,474 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:49:34,474 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 845 treesize of output 723 [2025-04-13 20:49:35,652 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:49:35,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783811246] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:49:35,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:49:35,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 34 [2025-04-13 20:49:35,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838124480] [2025-04-13 20:49:35,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:49:35,653 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 20:49:35,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:49:35,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 20:49:35,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1130, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 20:49:35,653 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:49:35,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 783 places, 3293 transitions, 78988 flow. Second operand has 36 states, 36 states have (on average 4.861111111111111) internal successors, (175), 36 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:49:35,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:49:35,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:49:35,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:49:59,260 INFO L116 PetriNetUnfolderBase]: 17838/26510 cut-off events. [2025-04-13 20:49:59,260 INFO L117 PetriNetUnfolderBase]: For 1200844/1200844 co-relation queries the response was YES. [2025-04-13 20:49:59,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 338839 conditions, 26510 events. 17838/26510 cut-off events. For 1200844/1200844 co-relation queries the response was YES. Maximal size of possible extension queue 1547. Compared 178101 event pairs, 1391 based on Foata normal form. 2/26512 useless extension candidates. Maximal degree in co-relation 338536. Up to 23946 conditions per place. [2025-04-13 20:49:59,943 INFO L140 encePairwiseOnDemand]: 15/28 looper letters, 2926 selfloop transitions, 879 changer transitions 7/3812 dead transitions. [2025-04-13 20:49:59,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 839 places, 3812 transitions, 98502 flow [2025-04-13 20:49:59,944 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-04-13 20:49:59,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2025-04-13 20:49:59,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 551 transitions. [2025-04-13 20:49:59,944 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34523809523809523 [2025-04-13 20:49:59,945 INFO L175 Difference]: Start difference. First operand has 783 places, 3293 transitions, 78988 flow. Second operand 57 states and 551 transitions. [2025-04-13 20:49:59,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 839 places, 3812 transitions, 98502 flow [2025-04-13 20:50:19,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 824 places, 3812 transitions, 94936 flow, removed 1364 selfloop flow, removed 15 redundant places. [2025-04-13 20:50:19,428 INFO L231 Difference]: Finished difference. Result has 835 places, 3582 transitions, 86741 flow [2025-04-13 20:50:19,430 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=75589, PETRI_DIFFERENCE_MINUEND_PLACES=768, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=634, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=86741, PETRI_PLACES=835, PETRI_TRANSITIONS=3582} [2025-04-13 20:50:19,430 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 806 predicate places. [2025-04-13 20:50:19,431 INFO L485 AbstractCegarLoop]: Abstraction has has 835 places, 3582 transitions, 86741 flow [2025-04-13 20:50:19,431 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.861111111111111) internal successors, (175), 36 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:50:19,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:50:19,431 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:50:19,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2025-04-13 20:50:19,631 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-04-13 20:50:19,631 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:50:19,632 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:50:19,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1317143224, now seen corresponding path program 19 times [2025-04-13 20:50:19,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:50:19,632 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571154522] [2025-04-13 20:50:19,632 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:50:19,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:50:19,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:50:19,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:50:19,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:50:19,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:50:20,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:50:20,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:50:20,702 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571154522] [2025-04-13 20:50:20,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571154522] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:50:20,702 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428503687] [2025-04-13 20:50:20,702 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:50:20,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:50:20,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:50:20,704 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-13 20:50:20,705 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-13 20:50:20,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:50:20,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:50:20,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:50:20,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:50:20,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 20:50:20,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:50:21,394 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:50:21,394 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 73 [2025-04-13 20:50:21,681 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:50:21,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:50:22,956 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:50:22,956 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 783 treesize of output 341 [2025-04-13 20:50:28,526 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:50:28,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428503687] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:50:28,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:50:28,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2025-04-13 20:50:28,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067419643] [2025-04-13 20:50:28,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:50:28,527 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 20:50:28,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:50:28,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 20:50:28,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1127, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 20:50:28,528 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:50:28,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 835 places, 3582 transitions, 86741 flow. Second operand has 36 states, 36 states have (on average 4.833333333333333) internal successors, (174), 36 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:50:28,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:50:28,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:50:28,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:50:50,835 INFO L116 PetriNetUnfolderBase]: 17926/26648 cut-off events. [2025-04-13 20:50:50,835 INFO L117 PetriNetUnfolderBase]: For 1252403/1252403 co-relation queries the response was YES. [2025-04-13 20:50:51,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342557 conditions, 26648 events. 17926/26648 cut-off events. For 1252403/1252403 co-relation queries the response was YES. Maximal size of possible extension queue 1597. Compared 179490 event pairs, 1632 based on Foata normal form. 1/26649 useless extension candidates. Maximal degree in co-relation 342242. Up to 25873 conditions per place. [2025-04-13 20:50:51,466 INFO L140 encePairwiseOnDemand]: 15/28 looper letters, 3357 selfloop transitions, 303 changer transitions 2/3662 dead transitions. [2025-04-13 20:50:51,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 856 places, 3662 transitions, 95775 flow [2025-04-13 20:50:51,467 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 20:50:51,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-13 20:50:51,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 219 transitions. [2025-04-13 20:50:51,467 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3555194805194805 [2025-04-13 20:50:51,467 INFO L175 Difference]: Start difference. First operand has 835 places, 3582 transitions, 86741 flow. Second operand 22 states and 219 transitions. [2025-04-13 20:50:51,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 856 places, 3662 transitions, 95775 flow [2025-04-13 20:51:13,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 830 places, 3662 transitions, 92811 flow, removed 1180 selfloop flow, removed 26 redundant places. [2025-04-13 20:51:13,063 INFO L231 Difference]: Finished difference. Result has 832 places, 3603 transitions, 85352 flow [2025-04-13 20:51:13,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=83780, PETRI_DIFFERENCE_MINUEND_PLACES=809, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=288, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=85352, PETRI_PLACES=832, PETRI_TRANSITIONS=3603} [2025-04-13 20:51:13,066 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 803 predicate places. [2025-04-13 20:51:13,066 INFO L485 AbstractCegarLoop]: Abstraction has has 832 places, 3603 transitions, 85352 flow [2025-04-13 20:51:13,067 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.833333333333333) internal successors, (174), 36 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:51:13,067 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:51:13,067 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:51:13,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2025-04-13 20:51:13,271 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,SelfDestructingSolverStorable39 [2025-04-13 20:51:13,271 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:51:13,272 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:51:13,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1943322210, now seen corresponding path program 20 times [2025-04-13 20:51:13,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:51:13,272 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036431019] [2025-04-13 20:51:13,272 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:51:13,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:51:13,278 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:51:13,286 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:51:13,287 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:51:13,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:51:14,428 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:51:14,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:51:14,428 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036431019] [2025-04-13 20:51:14,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036431019] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:51:14,428 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476995821] [2025-04-13 20:51:14,428 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:51:14,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:51:14,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:51:14,431 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-13 20:51:14,433 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-13 20:51:14,504 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:51:14,526 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:51:14,526 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:51:14,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:51:14,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-04-13 20:51:14,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:51:14,610 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-13 20:51:15,322 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:51:15,323 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 104 [2025-04-13 20:51:15,601 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:51:15,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:51:19,563 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 729 treesize of output 647 [2025-04-13 20:51:19,579 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:51:19,579 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1702 treesize of output 1326 [2025-04-13 20:51:40,179 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 402 treesize of output 360 [2025-04-13 20:51:40,191 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:51:40,191 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 549 treesize of output 481 [2025-04-13 20:51:40,747 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:51:40,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476995821] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:51:40,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:51:40,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 37 [2025-04-13 20:51:40,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609692051] [2025-04-13 20:51:40,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:51:40,748 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 20:51:40,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:51:40,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 20:51:40,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1329, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 20:51:40,749 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-04-13 20:51:40,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 832 places, 3603 transitions, 85352 flow. Second operand has 39 states, 39 states have (on average 4.846153846153846) internal successors, (189), 39 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:51:40,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:51:40,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-04-13 20:51:40,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:52:04,908 INFO L116 PetriNetUnfolderBase]: 18127/26970 cut-off events. [2025-04-13 20:52:04,908 INFO L117 PetriNetUnfolderBase]: For 1233405/1233405 co-relation queries the response was YES. [2025-04-13 20:52:05,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342639 conditions, 26970 events. 18127/26970 cut-off events. For 1233405/1233405 co-relation queries the response was YES. Maximal size of possible extension queue 1578. Compared 181907 event pairs, 1494 based on Foata normal form. 2/26972 useless extension candidates. Maximal degree in co-relation 342321. Up to 25245 conditions per place. [2025-04-13 20:52:05,659 INFO L140 encePairwiseOnDemand]: 13/28 looper letters, 3186 selfloop transitions, 611 changer transitions 8/3805 dead transitions. [2025-04-13 20:52:05,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 873 places, 3805 transitions, 96540 flow [2025-04-13 20:52:05,659 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-13 20:52:05,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-04-13 20:52:05,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 426 transitions. [2025-04-13 20:52:05,660 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3622448979591837 [2025-04-13 20:52:05,660 INFO L175 Difference]: Start difference. First operand has 832 places, 3603 transitions, 85352 flow. Second operand 42 states and 426 transitions. [2025-04-13 20:52:05,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 873 places, 3805 transitions, 96540 flow [2025-04-13 20:52:26,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 860 places, 3805 transitions, 95859 flow, removed 231 selfloop flow, removed 13 redundant places. [2025-04-13 20:52:26,588 INFO L231 Difference]: Finished difference. Result has 871 places, 3653 transitions, 87782 flow [2025-04-13 20:52:26,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=84675, PETRI_DIFFERENCE_MINUEND_PLACES=819, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=566, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3010, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=87782, PETRI_PLACES=871, PETRI_TRANSITIONS=3653} [2025-04-13 20:52:26,591 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 842 predicate places. [2025-04-13 20:52:26,591 INFO L485 AbstractCegarLoop]: Abstraction has has 871 places, 3653 transitions, 87782 flow [2025-04-13 20:52:26,591 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.846153846153846) internal successors, (189), 39 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:52:26,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:52:26,592 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:52:26,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2025-04-13 20:52:26,796 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:52:26,796 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:52:26,797 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:52:26,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1854998802, now seen corresponding path program 21 times [2025-04-13 20:52:26,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:52:26,797 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165426282] [2025-04-13 20:52:26,797 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:52:26,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:52:26,805 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:52:26,817 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:52:26,818 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:52:26,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:52:27,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:52:27,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:52:27,705 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165426282] [2025-04-13 20:52:27,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165426282] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:52:27,705 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353587926] [2025-04-13 20:52:27,705 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:52:27,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:52:27,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:52:27,707 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-13 20:52:27,708 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-13 20:52:27,772 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:52:27,789 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:52:27,789 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:52:27,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:52:27,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-04-13 20:52:27,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:52:27,846 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 19 treesize of output 1 [2025-04-13 20:52:28,293 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:52:28,293 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 156 treesize of output 108 [2025-04-13 20:52:28,774 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:52:28,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:52:37,333 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 1299 treesize of output 1171 [2025-04-13 20:52:39,053 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:52:39,054 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 2511 treesize of output 2838 [2025-04-13 20:52:59,316 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 20:53:14,576 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-13 20:53:19,869 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-13 20:53:19,870 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-13 20:53:19,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2025-04-13 20:53:19,879 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-13 20:53:20,071 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,SelfDestructingSolverStorable41 [2025-04-13 20:53:20,072 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:589) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:726) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:56) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2025-04-13 20:53:20,091 INFO L158 Benchmark]: Toolchain (without parser) took 705098.09ms. Allocated memory was 125.8MB in the beginning and 4.3GB in the end (delta: 4.2GB). Free memory was 86.4MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 3.9GB. Max. memory is 8.0GB. [2025-04-13 20:53:20,092 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 163.6MB. Free memory is still 90.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:53:20,092 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.68ms. Allocated memory is still 125.8MB. Free memory was 86.4MB in the beginning and 71.2MB in the end (delta: 15.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 20:53:20,092 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.28ms. Allocated memory is still 125.8MB. Free memory was 71.2MB in the beginning and 68.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:53:20,092 INFO L158 Benchmark]: Boogie Preprocessor took 41.14ms. Allocated memory is still 125.8MB. Free memory was 68.6MB in the beginning and 66.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:53:20,092 INFO L158 Benchmark]: RCFGBuilder took 693.41ms. Allocated memory is still 125.8MB. Free memory was 66.2MB in the beginning and 51.2MB in the end (delta: 15.0MB). Peak memory consumption was 52.1MB. Max. memory is 8.0GB. [2025-04-13 20:53:20,092 INFO L158 Benchmark]: TraceAbstraction took 704093.76ms. Allocated memory was 125.8MB in the beginning and 4.3GB in the end (delta: 4.2GB). Free memory was 50.6MB in the beginning and 2.8GB in the end (delta: -2.8GB). Peak memory consumption was 3.9GB. Max. memory is 8.0GB. [2025-04-13 20:53:20,093 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.12ms. Allocated memory is still 163.6MB. Free memory is still 90.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 235.68ms. Allocated memory is still 125.8MB. Free memory was 86.4MB in the beginning and 71.2MB in the end (delta: 15.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.28ms. Allocated memory is still 125.8MB. Free memory was 71.2MB in the beginning and 68.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.14ms. Allocated memory is still 125.8MB. Free memory was 68.6MB in the beginning and 66.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 693.41ms. Allocated memory is still 125.8MB. Free memory was 66.2MB in the beginning and 51.2MB in the end (delta: 15.0MB). Peak memory consumption was 52.1MB. Max. memory is 8.0GB. * TraceAbstraction took 704093.76ms. Allocated memory was 125.8MB in the beginning and 4.3GB in the end (delta: 4.2GB). Free memory was 50.6MB in the beginning and 2.8GB in the end (delta: -2.8GB). Peak memory consumption was 3.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...