/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-bad-buffer-mult-alt2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:20:40,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:20:40,288 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:20:40,291 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:20:40,292 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:20:40,306 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:20:40,308 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:20:40,308 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:20:40,309 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:20:40,309 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:20:40,309 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:20:40,310 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:20:40,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:20:40,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:20:40,310 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:20:40,310 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:20:40,311 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:20:40,311 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:20:40,311 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:20:40,311 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:20:40,311 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:20:40,311 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:20:40,311 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:20:40,311 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:20:40,311 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:20:40,311 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:20:40,311 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:20:40,311 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:20:40,311 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:20:40,311 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:20:40,311 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:20:40,311 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:20:40,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:20:40,312 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:20:40,312 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:20:40,312 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:20:40,312 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:20:40,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:20:40,312 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:20:40,312 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:20:40,312 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:20:40,312 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:20:40,312 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:20:40,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:20:40,312 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:20:40,312 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:20:40,312 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:20:40,312 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:20:40,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:20:40,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:20:40,530 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:20:40,531 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:20:40,531 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:20:40,533 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2025-04-13 20:20:41,878 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a9b5a502/655aa2c0df494f0ca292f48303b40370/FLAG216306339 [2025-04-13 20:20:42,102 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:20:42,102 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2025-04-13 20:20:42,108 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a9b5a502/655aa2c0df494f0ca292f48303b40370/FLAG216306339 [2025-04-13 20:20:42,878 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a9b5a502/655aa2c0df494f0ca292f48303b40370 [2025-04-13 20:20:42,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:20:42,881 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:20:42,882 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:20:42,882 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:20:42,886 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:20:42,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:20:42" (1/1) ... [2025-04-13 20:20:42,888 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39cf7717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:20:42, skipping insertion in model container [2025-04-13 20:20:42,888 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:20:42" (1/1) ... [2025-04-13 20:20:42,907 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:20:43,060 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-bad-buffer-mult-alt2.wvr.c[4226,4239] [2025-04-13 20:20:43,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:20:43,075 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:20:43,097 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-bad-buffer-mult-alt2.wvr.c[4226,4239] [2025-04-13 20:20:43,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:20:43,117 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:20:43,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:20:43 WrapperNode [2025-04-13 20:20:43,119 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:20:43,119 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:20:43,119 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:20:43,120 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:20:43,124 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:20:43" (1/1) ... [2025-04-13 20:20:43,132 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:20:43" (1/1) ... [2025-04-13 20:20:43,159 INFO L138 Inliner]: procedures = 25, calls = 55, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 289 [2025-04-13 20:20:43,160 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:20:43,160 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:20:43,160 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:20:43,160 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:20:43,173 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:20:43" (1/1) ... [2025-04-13 20:20:43,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:20:43" (1/1) ... [2025-04-13 20:20:43,181 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:20:43" (1/1) ... [2025-04-13 20:20:43,199 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-04-13 20:20:43,199 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:20:43" (1/1) ... [2025-04-13 20:20:43,203 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:20:43" (1/1) ... [2025-04-13 20:20:43,211 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:20:43" (1/1) ... [2025-04-13 20:20:43,212 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:20:43" (1/1) ... [2025-04-13 20:20:43,219 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:20:43" (1/1) ... [2025-04-13 20:20:43,220 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:20:43" (1/1) ... [2025-04-13 20:20:43,224 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:20:43" (1/1) ... [2025-04-13 20:20:43,233 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:20:43,233 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:20:43,233 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:20:43,233 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:20:43,237 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:20:43" (1/1) ... [2025-04-13 20:20:43,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:20:43,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:20:43,264 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:20:43,266 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:20:43,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:20:43,285 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:20:43,285 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:20:43,285 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:20:43,285 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:20:43,285 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:20:43,286 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:20:43,286 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 20:20:43,286 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 20:20:43,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:20:43,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 20:20:43,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 20:20:43,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 20:20:43,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 20:20:43,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 20:20:43,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 20:20:43,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:20:43,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:20:43,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 20:20:43,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 20:20:43,287 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:20:43,367 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:20:43,369 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:20:43,703 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:20:43,704 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:20:43,704 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:20:44,092 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:20:44,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:20:44 BoogieIcfgContainer [2025-04-13 20:20:44,093 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:20:44,095 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:20:44,095 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:20:44,098 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:20:44,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:20:42" (1/3) ... [2025-04-13 20:20:44,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a73bffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:20:44, skipping insertion in model container [2025-04-13 20:20:44,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:20:43" (2/3) ... [2025-04-13 20:20:44,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a73bffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:20:44, skipping insertion in model container [2025-04-13 20:20:44,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:20:44" (3/3) ... [2025-04-13 20:20:44,100 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt2.wvr.c [2025-04-13 20:20:44,111 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:20:44,112 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-buffer-mult-alt2.wvr.c that has 5 procedures, 42 locations, 43 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-13 20:20:44,112 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:20:44,170 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 20:20:44,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 47 transitions, 122 flow [2025-04-13 20:20:44,227 INFO L116 PetriNetUnfolderBase]: 6/43 cut-off events. [2025-04-13 20:20:44,231 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 20:20:44,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 43 events. 6/43 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-04-13 20:20:44,234 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 47 transitions, 122 flow [2025-04-13 20:20:44,239 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 42 transitions, 108 flow [2025-04-13 20:20:44,245 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:20:44,255 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;@1b0710fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:20:44,255 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 20:20:44,271 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:20:44,271 INFO L116 PetriNetUnfolderBase]: 6/41 cut-off events. [2025-04-13 20:20:44,271 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 20:20:44,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:20:44,271 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, 1, 1, 1, 1, 1, 1] [2025-04-13 20:20:44,272 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 2 more)] === [2025-04-13 20:20:44,275 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:20:44,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1941448318, now seen corresponding path program 1 times [2025-04-13 20:20:44,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:20:44,282 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288924068] [2025-04-13 20:20:44,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:20:44,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:20:44,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 20:20:44,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:20:44,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:20:44,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:20:44,860 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:20:44,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:20:44,861 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288924068] [2025-04-13 20:20:44,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288924068] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:20:44,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:20:44,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:20:44,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464920438] [2025-04-13 20:20:44,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:20:44,867 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:20:44,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:20:44,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:20:44,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:20:44,911 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2025-04-13 20:20:44,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:20:44,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:20:44,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2025-04-13 20:20:44,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:20:45,408 INFO L116 PetriNetUnfolderBase]: 1705/2598 cut-off events. [2025-04-13 20:20:45,408 INFO L117 PetriNetUnfolderBase]: For 264/264 co-relation queries the response was YES. [2025-04-13 20:20:45,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5171 conditions, 2598 events. 1705/2598 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 15204 event pairs, 201 based on Foata normal form. 120/2678 useless extension candidates. Maximal degree in co-relation 4417. Up to 1389 conditions per place. [2025-04-13 20:20:45,433 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 62 selfloop transitions, 7 changer transitions 0/83 dead transitions. [2025-04-13 20:20:45,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 83 transitions, 361 flow [2025-04-13 20:20:45,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:20:45,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:20:45,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions. [2025-04-13 20:20:45,442 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6347517730496454 [2025-04-13 20:20:45,443 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 108 flow. Second operand 6 states and 179 transitions. [2025-04-13 20:20:45,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 83 transitions, 361 flow [2025-04-13 20:20:45,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 83 transitions, 323 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-04-13 20:20:45,452 INFO L231 Difference]: Finished difference. Result has 49 places, 47 transitions, 139 flow [2025-04-13 20:20:45,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=139, PETRI_PLACES=49, PETRI_TRANSITIONS=47} [2025-04-13 20:20:45,456 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 0 predicate places. [2025-04-13 20:20:45,456 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 47 transitions, 139 flow [2025-04-13 20:20:45,457 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:20:45,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:20:45,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:20:45,457 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:20:45,457 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 2 more)] === [2025-04-13 20:20:45,458 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:20:45,458 INFO L85 PathProgramCache]: Analyzing trace with hash 467683654, now seen corresponding path program 1 times [2025-04-13 20:20:45,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:20:45,458 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718339343] [2025-04-13 20:20:45,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:20:45,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:20:45,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 20:20:45,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 20:20:45,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:20:45,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:20:45,682 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:20:45,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:20:45,682 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718339343] [2025-04-13 20:20:45,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718339343] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:20:45,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:20:45,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:20:45,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986674996] [2025-04-13 20:20:45,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:20:45,683 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:20:45,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:20:45,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:20:45,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:20:45,684 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2025-04-13 20:20:45,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states 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:20:45,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:20:45,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2025-04-13 20:20:45,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:20:45,966 INFO L116 PetriNetUnfolderBase]: 1602/2497 cut-off events. [2025-04-13 20:20:45,967 INFO L117 PetriNetUnfolderBase]: For 1926/2127 co-relation queries the response was YES. [2025-04-13 20:20:45,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6043 conditions, 2497 events. 1602/2497 cut-off events. For 1926/2127 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 15155 event pairs, 1039 based on Foata normal form. 290/2549 useless extension candidates. Maximal degree in co-relation 2723. Up to 1963 conditions per place. [2025-04-13 20:20:45,984 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 28 selfloop transitions, 2 changer transitions 18/66 dead transitions. [2025-04-13 20:20:45,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 66 transitions, 282 flow [2025-04-13 20:20:45,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:20:45,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:20:45,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 147 transitions. [2025-04-13 20:20:45,985 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.625531914893617 [2025-04-13 20:20:45,985 INFO L175 Difference]: Start difference. First operand has 49 places, 47 transitions, 139 flow. Second operand 5 states and 147 transitions. [2025-04-13 20:20:45,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 66 transitions, 282 flow [2025-04-13 20:20:45,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 66 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 20:20:45,988 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 154 flow [2025-04-13 20:20:45,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=154, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2025-04-13 20:20:45,988 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2025-04-13 20:20:45,988 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 154 flow [2025-04-13 20:20:45,988 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states 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:20:45,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:20:45,988 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:20:45,989 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:20:45,989 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 2 more)] === [2025-04-13 20:20:45,989 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:20:45,989 INFO L85 PathProgramCache]: Analyzing trace with hash -2110314519, now seen corresponding path program 1 times [2025-04-13 20:20:45,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:20:45,989 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051757672] [2025-04-13 20:20:45,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:20:45,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:20:45,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 20:20:46,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 20:20:46,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:20:46,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:20:46,184 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:20:46,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:20:46,184 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051757672] [2025-04-13 20:20:46,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051757672] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:20:46,184 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953808235] [2025-04-13 20:20:46,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:20:46,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:20:46,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:20:46,186 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:20:46,188 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:20:46,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 20:20:46,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 20:20:46,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:20:46,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:20:46,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 20:20:46,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:20:46,452 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:20:46,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:20:46,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:20:46,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953808235] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:20:46,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:20:46,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 7] total 15 [2025-04-13 20:20:46,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116168218] [2025-04-13 20:20:46,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:20:46,582 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:20:46,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:20:46,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:20:46,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-04-13 20:20:46,592 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2025-04-13 20:20:46,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 154 flow. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:20:46,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:20:46,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2025-04-13 20:20:46,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:20:47,218 INFO L116 PetriNetUnfolderBase]: 5465/7599 cut-off events. [2025-04-13 20:20:47,218 INFO L117 PetriNetUnfolderBase]: For 2435/2444 co-relation queries the response was YES. [2025-04-13 20:20:47,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18189 conditions, 7599 events. 5465/7599 cut-off events. For 2435/2444 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 46989 event pairs, 1101 based on Foata normal form. 114/7125 useless extension candidates. Maximal degree in co-relation 18173. Up to 2214 conditions per place. [2025-04-13 20:20:47,268 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 80 selfloop transitions, 12 changer transitions 0/102 dead transitions. [2025-04-13 20:20:47,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 102 transitions, 487 flow [2025-04-13 20:20:47,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:20:47,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:20:47,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 170 transitions. [2025-04-13 20:20:47,271 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6028368794326241 [2025-04-13 20:20:47,271 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 154 flow. Second operand 6 states and 170 transitions. [2025-04-13 20:20:47,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 102 transitions, 487 flow [2025-04-13 20:20:47,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 102 transitions, 473 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-04-13 20:20:47,281 INFO L231 Difference]: Finished difference. Result has 57 places, 56 transitions, 232 flow [2025-04-13 20:20:47,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=232, PETRI_PLACES=57, PETRI_TRANSITIONS=56} [2025-04-13 20:20:47,282 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 8 predicate places. [2025-04-13 20:20:47,282 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 56 transitions, 232 flow [2025-04-13 20:20:47,282 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:20:47,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:20:47,283 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:20:47,292 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:20:47,483 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:20:47,484 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 2 more)] === [2025-04-13 20:20:47,484 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:20:47,484 INFO L85 PathProgramCache]: Analyzing trace with hash -2072357337, now seen corresponding path program 1 times [2025-04-13 20:20:47,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:20:47,484 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833336863] [2025-04-13 20:20:47,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:20:47,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:20:47,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 20:20:47,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 20:20:47,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:20:47,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:20:47,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:20:47,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:20:47,587 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833336863] [2025-04-13 20:20:47,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833336863] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:20:47,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:20:47,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:20:47,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301486243] [2025-04-13 20:20:47,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:20:47,587 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:20:47,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:20:47,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:20:47,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:20:47,590 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2025-04-13 20:20:47,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 56 transitions, 232 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states 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:20:47,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:20:47,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2025-04-13 20:20:47,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:20:47,828 INFO L116 PetriNetUnfolderBase]: 1775/3022 cut-off events. [2025-04-13 20:20:47,829 INFO L117 PetriNetUnfolderBase]: For 5432/5813 co-relation queries the response was YES. [2025-04-13 20:20:47,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8613 conditions, 3022 events. 1775/3022 cut-off events. For 5432/5813 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 20149 event pairs, 261 based on Foata normal form. 207/3130 useless extension candidates. Maximal degree in co-relation 8592. Up to 2184 conditions per place. [2025-04-13 20:20:47,849 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 41 selfloop transitions, 4 changer transitions 2/69 dead transitions. [2025-04-13 20:20:47,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 69 transitions, 353 flow [2025-04-13 20:20:47,850 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:20:47,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:20:47,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2025-04-13 20:20:47,851 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.723404255319149 [2025-04-13 20:20:47,851 INFO L175 Difference]: Start difference. First operand has 57 places, 56 transitions, 232 flow. Second operand 3 states and 102 transitions. [2025-04-13 20:20:47,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 69 transitions, 353 flow [2025-04-13 20:20:47,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 69 transitions, 350 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 20:20:47,857 INFO L231 Difference]: Finished difference. Result has 58 places, 55 transitions, 231 flow [2025-04-13 20:20:47,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=231, PETRI_PLACES=58, PETRI_TRANSITIONS=55} [2025-04-13 20:20:47,858 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2025-04-13 20:20:47,858 INFO L485 AbstractCegarLoop]: Abstraction has has 58 places, 55 transitions, 231 flow [2025-04-13 20:20:47,859 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states 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:20:47,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:20:47,859 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:20:47,859 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:20:47,859 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 2 more)] === [2025-04-13 20:20:47,859 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:20:47,859 INFO L85 PathProgramCache]: Analyzing trace with hash 774425623, now seen corresponding path program 1 times [2025-04-13 20:20:47,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:20:47,859 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675583030] [2025-04-13 20:20:47,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:20:47,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:20:47,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 20:20:47,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 20:20:47,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:20:47,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:20:48,509 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:20:48,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:20:48,510 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675583030] [2025-04-13 20:20:48,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675583030] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:20:48,510 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174376440] [2025-04-13 20:20:48,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:20:48,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:20:48,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:20:48,514 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:20:48,515 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:20:48,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 20:20:48,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 20:20:48,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:20:48,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:20:48,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 20:20:48,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:20:48,658 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 23 treesize of output 1 [2025-04-13 20:20:48,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 15 treesize of output 7 [2025-04-13 20:20:48,875 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:20:48,875 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:20:49,268 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 39 treesize of output 35 [2025-04-13 20:20:49,273 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 47 treesize of output 35 [2025-04-13 20:20:49,320 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:20:49,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174376440] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:20:49,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:20:49,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-04-13 20:20:49,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841169957] [2025-04-13 20:20:49,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:20:49,321 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 20:20:49,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:20:49,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 20:20:49,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2025-04-13 20:20:49,383 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2025-04-13 20:20:49,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 231 flow. Second operand has 18 states, 18 states have (on average 23.055555555555557) internal successors, (415), 18 states have internal predecessors, (415), 0 states have call successors, (0), 0 states 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:20:49,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:20:49,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2025-04-13 20:20:49,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:20:50,966 INFO L116 PetriNetUnfolderBase]: 6442/10785 cut-off events. [2025-04-13 20:20:50,967 INFO L117 PetriNetUnfolderBase]: For 18030/19097 co-relation queries the response was YES. [2025-04-13 20:20:50,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30243 conditions, 10785 events. 6442/10785 cut-off events. For 18030/19097 co-relation queries the response was YES. Maximal size of possible extension queue 684. Compared 84623 event pairs, 1413 based on Foata normal form. 771/11110 useless extension candidates. Maximal degree in co-relation 14709. Up to 3548 conditions per place. [2025-04-13 20:20:51,030 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 167 selfloop transitions, 44 changer transitions 10/243 dead transitions. [2025-04-13 20:20:51,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 243 transitions, 1379 flow [2025-04-13 20:20:51,030 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 20:20:51,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-13 20:20:51,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 583 transitions. [2025-04-13 20:20:51,032 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6528555431131019 [2025-04-13 20:20:51,032 INFO L175 Difference]: Start difference. First operand has 58 places, 55 transitions, 231 flow. Second operand 19 states and 583 transitions. [2025-04-13 20:20:51,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 243 transitions, 1379 flow [2025-04-13 20:20:51,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 243 transitions, 1337 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 20:20:51,045 INFO L231 Difference]: Finished difference. Result has 78 places, 99 transitions, 596 flow [2025-04-13 20:20:51,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=596, PETRI_PLACES=78, PETRI_TRANSITIONS=99} [2025-04-13 20:20:51,046 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 29 predicate places. [2025-04-13 20:20:51,046 INFO L485 AbstractCegarLoop]: Abstraction has has 78 places, 99 transitions, 596 flow [2025-04-13 20:20:51,046 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 23.055555555555557) internal successors, (415), 18 states have internal predecessors, (415), 0 states have call successors, (0), 0 states 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:20:51,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:20:51,046 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:20:51,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 20:20:51,250 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:20:51,250 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 2 more)] === [2025-04-13 20:20:51,250 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:20:51,250 INFO L85 PathProgramCache]: Analyzing trace with hash -549885658, now seen corresponding path program 1 times [2025-04-13 20:20:51,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:20:51,250 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689675678] [2025-04-13 20:20:51,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:20:51,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:20:51,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 20:20:51,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 20:20:51,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:20:51,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:20:51,998 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:20:51,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:20:51,998 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689675678] [2025-04-13 20:20:51,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689675678] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:20:51,999 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676461949] [2025-04-13 20:20:51,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:20:51,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:20:51,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:20:52,001 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:20:52,003 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:20:52,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 20:20:52,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 20:20:52,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:20:52,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:20:52,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 20:20:52,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:20:52,241 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 23 treesize of output 7 [2025-04-13 20:20:52,250 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:20:52,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:20:52,298 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:20:52,299 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 26 treesize of output 18 [2025-04-13 20:20:52,378 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:20:52,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676461949] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:20:52,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:20:52,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 14 [2025-04-13 20:20:52,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067066220] [2025-04-13 20:20:52,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:20:52,379 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 20:20:52,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:20:52,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 20:20:52,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-04-13 20:20:52,475 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2025-04-13 20:20:52,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 99 transitions, 596 flow. Second operand has 16 states, 16 states have (on average 23.8125) internal successors, (381), 16 states have internal predecessors, (381), 0 states have call successors, (0), 0 states 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:20:52,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:20:52,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2025-04-13 20:20:52,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:20:54,414 INFO L116 PetriNetUnfolderBase]: 11665/19942 cut-off events. [2025-04-13 20:20:54,414 INFO L117 PetriNetUnfolderBase]: For 45634/47256 co-relation queries the response was YES. [2025-04-13 20:20:54,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59777 conditions, 19942 events. 11665/19942 cut-off events. For 45634/47256 co-relation queries the response was YES. Maximal size of possible extension queue 1336. Compared 174407 event pairs, 944 based on Foata normal form. 1304/20666 useless extension candidates. Maximal degree in co-relation 47587. Up to 4689 conditions per place. [2025-04-13 20:20:54,518 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 122 selfloop transitions, 82 changer transitions 5/231 dead transitions. [2025-04-13 20:20:54,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 231 transitions, 1582 flow [2025-04-13 20:20:54,518 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 20:20:54,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 20:20:54,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 464 transitions. [2025-04-13 20:20:54,520 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6170212765957447 [2025-04-13 20:20:54,520 INFO L175 Difference]: Start difference. First operand has 78 places, 99 transitions, 596 flow. Second operand 16 states and 464 transitions. [2025-04-13 20:20:54,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 231 transitions, 1582 flow [2025-04-13 20:20:54,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 231 transitions, 1564 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-04-13 20:20:54,565 INFO L231 Difference]: Finished difference. Result has 96 places, 138 transitions, 1128 flow [2025-04-13 20:20:54,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1128, PETRI_PLACES=96, PETRI_TRANSITIONS=138} [2025-04-13 20:20:54,565 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 47 predicate places. [2025-04-13 20:20:54,565 INFO L485 AbstractCegarLoop]: Abstraction has has 96 places, 138 transitions, 1128 flow [2025-04-13 20:20:54,566 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 23.8125) internal successors, (381), 16 states have internal predecessors, (381), 0 states have call successors, (0), 0 states 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:20:54,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:20:54,566 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:20:54,572 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:20:54,766 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:20:54,766 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 2 more)] === [2025-04-13 20:20:54,767 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:20:54,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1447906079, now seen corresponding path program 1 times [2025-04-13 20:20:54,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:20:54,767 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910018155] [2025-04-13 20:20:54,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:20:54,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:20:54,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 20:20:54,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:20:54,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:20:54,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:20:54,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:20:54,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:20:54,820 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910018155] [2025-04-13 20:20:54,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910018155] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:20:54,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:20:54,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:20:54,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072277078] [2025-04-13 20:20:54,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:20:54,821 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:20:54,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:20:54,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:20:54,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:20:54,824 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2025-04-13 20:20:54,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 138 transitions, 1128 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 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:20:54,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:20:54,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2025-04-13 20:20:54,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:20:57,341 INFO L116 PetriNetUnfolderBase]: 18001/29623 cut-off events. [2025-04-13 20:20:57,342 INFO L117 PetriNetUnfolderBase]: For 158101/162354 co-relation queries the response was YES. [2025-04-13 20:20:57,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98530 conditions, 29623 events. 18001/29623 cut-off events. For 158101/162354 co-relation queries the response was YES. Maximal size of possible extension queue 1837. Compared 256913 event pairs, 4727 based on Foata normal form. 2950/31018 useless extension candidates. Maximal degree in co-relation 88291. Up to 14780 conditions per place. [2025-04-13 20:20:57,534 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 167 selfloop transitions, 9 changer transitions 0/198 dead transitions. [2025-04-13 20:20:57,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 198 transitions, 2123 flow [2025-04-13 20:20:57,535 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:20:57,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:20:57,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2025-04-13 20:20:57,536 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7375886524822695 [2025-04-13 20:20:57,537 INFO L175 Difference]: Start difference. First operand has 96 places, 138 transitions, 1128 flow. Second operand 3 states and 104 transitions. [2025-04-13 20:20:57,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 198 transitions, 2123 flow [2025-04-13 20:20:57,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 198 transitions, 2035 flow, removed 40 selfloop flow, removed 3 redundant places. [2025-04-13 20:20:57,647 INFO L231 Difference]: Finished difference. Result has 96 places, 139 transitions, 1153 flow [2025-04-13 20:20:57,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1072, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1153, PETRI_PLACES=96, PETRI_TRANSITIONS=139} [2025-04-13 20:20:57,647 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 47 predicate places. [2025-04-13 20:20:57,647 INFO L485 AbstractCegarLoop]: Abstraction has has 96 places, 139 transitions, 1153 flow [2025-04-13 20:20:57,647 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 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:20:57,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:20:57,648 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:57,648 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 20:20:57,648 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 2 more)] === [2025-04-13 20:20:57,648 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:20:57,648 INFO L85 PathProgramCache]: Analyzing trace with hash 125095180, now seen corresponding path program 2 times [2025-04-13 20:20:57,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:20:57,648 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949197218] [2025-04-13 20:20:57,648 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:20:57,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:20:57,657 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-04-13 20:20:57,670 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 20:20:57,670 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:20:57,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:20:57,726 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:20:57,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:20:57,726 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949197218] [2025-04-13 20:20:57,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949197218] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:20:57,726 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666454374] [2025-04-13 20:20:57,726 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:20:57,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:20:57,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:20:57,728 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:20:57,730 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:20:57,787 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-04-13 20:20:57,815 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 20:20:57,815 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:20:57,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:20:57,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-13 20:20:57,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:20:57,844 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:20:57,844 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:20:57,915 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:20:57,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666454374] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:20:57,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:20:57,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2025-04-13 20:20:57,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192527592] [2025-04-13 20:20:57,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:20:57,915 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:20:57,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:20:57,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:20:57,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-04-13 20:20:57,928 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2025-04-13 20:20:57,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 139 transitions, 1153 flow. Second operand has 8 states, 8 states have (on average 24.75) internal successors, (198), 8 states have internal predecessors, (198), 0 states have call successors, (0), 0 states 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:20:57,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:20:57,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2025-04-13 20:20:57,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:21:01,155 INFO L116 PetriNetUnfolderBase]: 23790/39685 cut-off events. [2025-04-13 20:21:01,155 INFO L117 PetriNetUnfolderBase]: For 141815/144639 co-relation queries the response was YES. [2025-04-13 20:21:01,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131639 conditions, 39685 events. 23790/39685 cut-off events. For 141815/144639 co-relation queries the response was YES. Maximal size of possible extension queue 2177. Compared 360686 event pairs, 3405 based on Foata normal form. 1979/40219 useless extension candidates. Maximal degree in co-relation 131592. Up to 18009 conditions per place. [2025-04-13 20:21:01,465 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 131 selfloop transitions, 44 changer transitions 0/197 dead transitions. [2025-04-13 20:21:01,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 197 transitions, 1849 flow [2025-04-13 20:21:01,465 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:21:01,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:21:01,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2025-04-13 20:21:01,466 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.776595744680851 [2025-04-13 20:21:01,466 INFO L175 Difference]: Start difference. First operand has 96 places, 139 transitions, 1153 flow. Second operand 4 states and 146 transitions. [2025-04-13 20:21:01,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 197 transitions, 1849 flow [2025-04-13 20:21:02,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 197 transitions, 1838 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:21:02,373 INFO L231 Difference]: Finished difference. Result has 100 places, 149 transitions, 1458 flow [2025-04-13 20:21:02,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1144, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1458, PETRI_PLACES=100, PETRI_TRANSITIONS=149} [2025-04-13 20:21:02,374 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 51 predicate places. [2025-04-13 20:21:02,374 INFO L485 AbstractCegarLoop]: Abstraction has has 100 places, 149 transitions, 1458 flow [2025-04-13 20:21:02,374 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.75) internal successors, (198), 8 states have internal predecessors, (198), 0 states have call successors, (0), 0 states 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:21:02,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:21:02,374 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:21:02,380 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:21:02,575 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:21:02,576 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 2 more)] === [2025-04-13 20:21:02,576 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:21:02,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1196171319, now seen corresponding path program 1 times [2025-04-13 20:21:02,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:21:02,576 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781362620] [2025-04-13 20:21:02,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:21:02,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:21:02,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 20:21:02,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 20:21:02,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:21:02,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:02,652 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:21:02,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:21:02,652 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781362620] [2025-04-13 20:21:02,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781362620] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:21:02,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:21:02,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:21:02,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804403591] [2025-04-13 20:21:02,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:21:02,654 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:21:02,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:21:02,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:21:02,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:21:02,654 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2025-04-13 20:21:02,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 149 transitions, 1458 flow. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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:21:02,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:21:02,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2025-04-13 20:21:02,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:21:05,896 INFO L116 PetriNetUnfolderBase]: 24616/41171 cut-off events. [2025-04-13 20:21:05,896 INFO L117 PetriNetUnfolderBase]: For 218873/223011 co-relation queries the response was YES. [2025-04-13 20:21:06,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149167 conditions, 41171 events. 24616/41171 cut-off events. For 218873/223011 co-relation queries the response was YES. Maximal size of possible extension queue 2288. Compared 385549 event pairs, 16258 based on Foata normal form. 3274/41578 useless extension candidates. Maximal degree in co-relation 138515. Up to 22419 conditions per place. [2025-04-13 20:21:06,209 INFO L140 encePairwiseOnDemand]: 43/47 looper letters, 134 selfloop transitions, 11 changer transitions 11/178 dead transitions. [2025-04-13 20:21:06,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 178 transitions, 2054 flow [2025-04-13 20:21:06,209 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:21:06,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:21:06,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2025-04-13 20:21:06,210 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6808510638297872 [2025-04-13 20:21:06,210 INFO L175 Difference]: Start difference. First operand has 100 places, 149 transitions, 1458 flow. Second operand 4 states and 128 transitions. [2025-04-13 20:21:06,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 178 transitions, 2054 flow [2025-04-13 20:21:06,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 178 transitions, 2030 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-13 20:21:06,561 INFO L231 Difference]: Finished difference. Result has 103 places, 131 transitions, 1264 flow [2025-04-13 20:21:06,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1348, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1264, PETRI_PLACES=103, PETRI_TRANSITIONS=131} [2025-04-13 20:21:06,562 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 54 predicate places. [2025-04-13 20:21:06,562 INFO L485 AbstractCegarLoop]: Abstraction has has 103 places, 131 transitions, 1264 flow [2025-04-13 20:21:06,562 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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:21:06,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:21:06,562 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:21:06,562 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 20:21:06,562 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 2 more)] === [2025-04-13 20:21:06,562 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:21:06,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1940994611, now seen corresponding path program 1 times [2025-04-13 20:21:06,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:21:06,563 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546050630] [2025-04-13 20:21:06,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:21:06,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:21:06,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-13 20:21:06,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 20:21:06,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:21:06,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:06,860 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:21:06,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:21:06,861 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546050630] [2025-04-13 20:21:06,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546050630] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:21:06,861 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307711878] [2025-04-13 20:21:06,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:21:06,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:21:06,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:21:06,865 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:21:06,865 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:21:06,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-13 20:21:06,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 20:21:06,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:21:06,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:06,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 20:21:06,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:21:07,239 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:21:07,239 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:21:07,561 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:21:07,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307711878] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:21:07,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:21:07,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 11] total 25 [2025-04-13 20:21:07,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415064688] [2025-04-13 20:21:07,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:21:07,561 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 20:21:07,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:21:07,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 20:21:07,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2025-04-13 20:21:07,790 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 47 [2025-04-13 20:21:07,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 131 transitions, 1264 flow. Second operand has 26 states, 26 states have (on average 11.461538461538462) internal successors, (298), 26 states have internal predecessors, (298), 0 states have call successors, (0), 0 states 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:21:07,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:21:07,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 47 [2025-04-13 20:21:07,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand