/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-commit-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:23:45,668 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:23:45,726 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:23:45,733 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:23:45,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:23:45,758 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:23:45,759 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:23:45,759 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:23:45,759 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:23:45,759 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:23:45,759 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:23:45,759 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:23:45,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:23:45,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:23:45,760 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:23:45,760 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:23:45,760 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:23:45,760 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:23:45,760 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:23:45,760 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:23:45,760 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:23:45,760 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:23:45,760 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:23:45,760 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:23:45,760 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:23:45,760 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:23:45,760 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:23:45,760 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:23:45,761 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:23:45,761 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:23:45,761 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:23:45,761 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:23:45,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:23:45,761 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:23:45,761 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:23:45,761 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:23:45,761 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:23:45,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:23:45,761 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:23:45,761 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:23:45,761 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:23:45,763 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:23:45,763 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:23:45,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:23:45,763 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:23:45,763 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:23:45,763 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:23:45,763 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:23:45,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:23:45,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:23:45,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:23:45,980 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:23:45,980 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:23:45,981 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c [2025-04-13 20:23:47,236 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/686520eee/7f43f81a0ad54cb38fe90917cda634f3/FLAG3f6d46922 [2025-04-13 20:23:47,454 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:23:47,455 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c [2025-04-13 20:23:47,463 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/686520eee/7f43f81a0ad54cb38fe90917cda634f3/FLAG3f6d46922 [2025-04-13 20:23:48,237 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/686520eee/7f43f81a0ad54cb38fe90917cda634f3 [2025-04-13 20:23:48,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:23:48,240 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:23:48,241 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:23:48,241 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:23:48,245 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:23:48,245 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:23:48" (1/1) ... [2025-04-13 20:23:48,246 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7551690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:48, skipping insertion in model container [2025-04-13 20:23:48,246 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:23:48" (1/1) ... [2025-04-13 20:23:48,256 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:23:48,444 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-commit-1.wvr.c[4643,4656] [2025-04-13 20:23:48,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:23:48,463 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:23:48,504 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-commit-1.wvr.c[4643,4656] [2025-04-13 20:23:48,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:23:48,531 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:23:48,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:48 WrapperNode [2025-04-13 20:23:48,531 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:23:48,532 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:23:48,532 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:23:48,532 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:23:48,537 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:23:48" (1/1) ... [2025-04-13 20:23:48,544 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:23:48" (1/1) ... [2025-04-13 20:23:48,562 INFO L138 Inliner]: procedures = 24, calls = 53, calls flagged for inlining = 20, calls inlined = 24, statements flattened = 325 [2025-04-13 20:23:48,563 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:23:48,563 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:23:48,563 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:23:48,563 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:23:48,569 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:48" (1/1) ... [2025-04-13 20:23:48,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:48" (1/1) ... [2025-04-13 20:23:48,573 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:48" (1/1) ... [2025-04-13 20:23:48,588 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-04-13 20:23:48,588 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:48" (1/1) ... [2025-04-13 20:23:48,589 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:48" (1/1) ... [2025-04-13 20:23:48,601 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:48" (1/1) ... [2025-04-13 20:23:48,602 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:48" (1/1) ... [2025-04-13 20:23:48,605 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:48" (1/1) ... [2025-04-13 20:23:48,606 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:48" (1/1) ... [2025-04-13 20:23:48,607 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:48" (1/1) ... [2025-04-13 20:23:48,610 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:23:48,611 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:23:48,611 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:23:48,611 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:23:48,612 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:48" (1/1) ... [2025-04-13 20:23:48,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:23:48,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:23:48,636 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:23:48,638 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:23:48,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:23:48,657 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:23:48,657 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:23:48,657 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:23:48,657 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:23:48,657 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:23:48,657 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:23:48,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:23:48,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 20:23:48,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 20:23:48,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 20:23:48,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 20:23:48,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 20:23:48,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 20:23:48,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:23:48,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:23:48,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 20:23:48,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 20:23:48,659 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:23:48,738 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:23:48,739 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:23:49,081 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:23:49,085 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:23:49,085 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:23:49,404 INFO L313 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-13 20:23:49,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:23:49 BoogieIcfgContainer [2025-04-13 20:23:49,404 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:23:49,406 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:23:49,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:23:49,409 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:23:49,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:23:48" (1/3) ... [2025-04-13 20:23:49,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e1daea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:23:49, skipping insertion in model container [2025-04-13 20:23:49,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:48" (2/3) ... [2025-04-13 20:23:49,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e1daea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:23:49, skipping insertion in model container [2025-04-13 20:23:49,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:23:49" (3/3) ... [2025-04-13 20:23:49,411 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-commit-1.wvr.c [2025-04-13 20:23:49,422 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:23:49,423 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-commit-1.wvr.c that has 4 procedures, 33 locations, 35 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-13 20:23:49,423 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:23:49,474 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 20:23:49,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 38 transitions, 97 flow [2025-04-13 20:23:49,532 INFO L116 PetriNetUnfolderBase]: 6/35 cut-off events. [2025-04-13 20:23:49,533 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:23:49,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 6/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-04-13 20:23:49,535 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 38 transitions, 97 flow [2025-04-13 20:23:49,538 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 34 transitions, 86 flow [2025-04-13 20:23:49,544 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:23:49,553 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;@21e87a5a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:23:49,553 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 20:23:49,567 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:23:49,567 INFO L116 PetriNetUnfolderBase]: 6/33 cut-off events. [2025-04-13 20:23:49,567 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:23:49,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:49,568 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:23:49,568 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:23:49,594 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:49,595 INFO L85 PathProgramCache]: Analyzing trace with hash -654638393, now seen corresponding path program 1 times [2025-04-13 20:23:49,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:49,601 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986157559] [2025-04-13 20:23:49,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:23:49,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:49,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:23:49,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:23:49,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:23:49,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:49,974 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:23:49,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:49,975 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986157559] [2025-04-13 20:23:49,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986157559] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:23:49,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:23:49,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 20:23:49,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483167864] [2025-04-13 20:23:49,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:23:49,982 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:23:49,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:50,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:23:50,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:23:50,002 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-13 20:23:50,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:23:50,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:50,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-13 20:23:50,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:50,292 INFO L116 PetriNetUnfolderBase]: 1542/2132 cut-off events. [2025-04-13 20:23:50,292 INFO L117 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2025-04-13 20:23:50,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4410 conditions, 2132 events. 1542/2132 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 9414 event pairs, 276 based on Foata normal form. 1/1598 useless extension candidates. Maximal degree in co-relation 4053. Up to 1837 conditions per place. [2025-04-13 20:23:50,312 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 44 selfloop transitions, 4 changer transitions 1/52 dead transitions. [2025-04-13 20:23:50,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 52 transitions, 235 flow [2025-04-13 20:23:50,313 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:23:50,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:23:50,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-04-13 20:23:50,322 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5964912280701754 [2025-04-13 20:23:50,323 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 86 flow. Second operand 3 states and 68 transitions. [2025-04-13 20:23:50,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 52 transitions, 235 flow [2025-04-13 20:23:50,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 52 transitions, 213 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-13 20:23:50,332 INFO L231 Difference]: Finished difference. Result has 35 places, 37 transitions, 100 flow [2025-04-13 20:23:50,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=35, PETRI_TRANSITIONS=37} [2025-04-13 20:23:50,338 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2025-04-13 20:23:50,339 INFO L485 AbstractCegarLoop]: Abstraction has has 35 places, 37 transitions, 100 flow [2025-04-13 20:23:50,339 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:23:50,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:50,339 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] [2025-04-13 20:23:50,339 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:23:50,339 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:23:50,340 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:50,340 INFO L85 PathProgramCache]: Analyzing trace with hash -886972370, now seen corresponding path program 1 times [2025-04-13 20:23:50,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:50,341 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381226508] [2025-04-13 20:23:50,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:23:50,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:50,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 20:23:50,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:23:50,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:23:50,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:50,447 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:23:50,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:50,448 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381226508] [2025-04-13 20:23:50,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381226508] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:23:50,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:23:50,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:23:50,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21640605] [2025-04-13 20:23:50,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:23:50,449 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:23:50,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:50,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:23:50,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:23:50,449 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-13 20:23:50,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 37 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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:23:50,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:50,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-13 20:23:50,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:50,700 INFO L116 PetriNetUnfolderBase]: 1552/2214 cut-off events. [2025-04-13 20:23:50,700 INFO L117 PetriNetUnfolderBase]: For 262/262 co-relation queries the response was YES. [2025-04-13 20:23:50,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4837 conditions, 2214 events. 1552/2214 cut-off events. For 262/262 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10117 event pairs, 536 based on Foata normal form. 73/1753 useless extension candidates. Maximal degree in co-relation 1893. Up to 1520 conditions per place. [2025-04-13 20:23:50,710 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 50 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2025-04-13 20:23:50,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 55 transitions, 248 flow [2025-04-13 20:23:50,711 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:23:50,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:23:50,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-04-13 20:23:50,712 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6052631578947368 [2025-04-13 20:23:50,712 INFO L175 Difference]: Start difference. First operand has 35 places, 37 transitions, 100 flow. Second operand 3 states and 69 transitions. [2025-04-13 20:23:50,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 55 transitions, 248 flow [2025-04-13 20:23:50,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 55 transitions, 245 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:23:50,713 INFO L231 Difference]: Finished difference. Result has 37 places, 37 transitions, 104 flow [2025-04-13 20:23:50,713 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=37, PETRI_TRANSITIONS=37} [2025-04-13 20:23:50,714 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2025-04-13 20:23:50,714 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 37 transitions, 104 flow [2025-04-13 20:23:50,714 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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:23:50,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:50,714 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] [2025-04-13 20:23:50,714 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:23:50,714 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:23:50,715 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:50,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1801037543, now seen corresponding path program 1 times [2025-04-13 20:23:50,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:50,715 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010325551] [2025-04-13 20:23:50,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:23:50,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:50,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 20:23:50,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:23:50,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:23:50,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:50,814 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:23:50,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:50,814 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010325551] [2025-04-13 20:23:50,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010325551] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:23:50,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:23:50,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:23:50,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235143473] [2025-04-13 20:23:50,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:23:50,814 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:23:50,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:50,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:23:50,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:23:50,815 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-13 20:23:50,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 37 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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:23:50,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:50,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-13 20:23:50,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:51,045 INFO L116 PetriNetUnfolderBase]: 1580/2253 cut-off events. [2025-04-13 20:23:51,045 INFO L117 PetriNetUnfolderBase]: For 353/353 co-relation queries the response was YES. [2025-04-13 20:23:51,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5043 conditions, 2253 events. 1580/2253 cut-off events. For 353/353 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10088 event pairs, 461 based on Foata normal form. 48/1782 useless extension candidates. Maximal degree in co-relation 1295. Up to 1537 conditions per place. [2025-04-13 20:23:51,056 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 46 selfloop transitions, 2 changer transitions 4/55 dead transitions. [2025-04-13 20:23:51,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 55 transitions, 251 flow [2025-04-13 20:23:51,057 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:23:51,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:23:51,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-04-13 20:23:51,057 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6228070175438597 [2025-04-13 20:23:51,057 INFO L175 Difference]: Start difference. First operand has 37 places, 37 transitions, 104 flow. Second operand 3 states and 71 transitions. [2025-04-13 20:23:51,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 55 transitions, 251 flow [2025-04-13 20:23:51,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 55 transitions, 249 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:23:51,060 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 110 flow [2025-04-13 20:23:51,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=39, PETRI_TRANSITIONS=37} [2025-04-13 20:23:51,061 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2025-04-13 20:23:51,061 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 110 flow [2025-04-13 20:23:51,061 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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:23:51,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:51,061 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] [2025-04-13 20:23:51,061 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:23:51,061 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:23:51,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:51,062 INFO L85 PathProgramCache]: Analyzing trace with hash -530322268, now seen corresponding path program 1 times [2025-04-13 20:23:51,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:51,062 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446631019] [2025-04-13 20:23:51,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:23:51,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:51,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 20:23:51,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:23:51,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:23:51,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:51,190 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:23:51,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:51,190 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446631019] [2025-04-13 20:23:51,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446631019] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:23:51,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:23:51,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:23:51,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279800153] [2025-04-13 20:23:51,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:23:51,191 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:23:51,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:51,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:23:51,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:23:51,191 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-13 20:23:51,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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:23:51,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:51,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-13 20:23:51,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:51,359 INFO L116 PetriNetUnfolderBase]: 909/1331 cut-off events. [2025-04-13 20:23:51,360 INFO L117 PetriNetUnfolderBase]: For 381/381 co-relation queries the response was YES. [2025-04-13 20:23:51,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3068 conditions, 1331 events. 909/1331 cut-off events. For 381/381 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5263 event pairs, 400 based on Foata normal form. 26/1045 useless extension candidates. Maximal degree in co-relation 744. Up to 1097 conditions per place. [2025-04-13 20:23:51,366 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 38 selfloop transitions, 2 changer transitions 5/48 dead transitions. [2025-04-13 20:23:51,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 48 transitions, 225 flow [2025-04-13 20:23:51,367 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:23:51,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:23:51,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2025-04-13 20:23:51,368 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5350877192982456 [2025-04-13 20:23:51,368 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 110 flow. Second operand 3 states and 61 transitions. [2025-04-13 20:23:51,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 48 transitions, 225 flow [2025-04-13 20:23:51,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 223 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:23:51,369 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 120 flow [2025-04-13 20:23:51,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=41, PETRI_TRANSITIONS=38} [2025-04-13 20:23:51,369 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2025-04-13 20:23:51,369 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 120 flow [2025-04-13 20:23:51,369 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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:23:51,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:51,370 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:23:51,370 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:23:51,370 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:23:51,370 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:51,370 INFO L85 PathProgramCache]: Analyzing trace with hash 103512900, now seen corresponding path program 1 times [2025-04-13 20:23:51,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:51,370 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508496889] [2025-04-13 20:23:51,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:23:51,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:51,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 20:23:51,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:23:51,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:23:51,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:51,522 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:23:51,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:51,523 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508496889] [2025-04-13 20:23:51,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508496889] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:23:51,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:23:51,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:23:51,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732890089] [2025-04-13 20:23:51,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:23:51,523 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:23:51,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:51,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:23:51,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:23:51,524 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-13 20:23:51,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:23:51,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:51,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-13 20:23:51,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:51,698 INFO L116 PetriNetUnfolderBase]: 1037/1569 cut-off events. [2025-04-13 20:23:51,698 INFO L117 PetriNetUnfolderBase]: For 402/402 co-relation queries the response was YES. [2025-04-13 20:23:51,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3652 conditions, 1569 events. 1037/1569 cut-off events. For 402/402 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6906 event pairs, 812 based on Foata normal form. 22/1199 useless extension candidates. Maximal degree in co-relation 1262. Up to 1319 conditions per place. [2025-04-13 20:23:51,704 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 34 selfloop transitions, 2 changer transitions 24/63 dead transitions. [2025-04-13 20:23:51,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 63 transitions, 296 flow [2025-04-13 20:23:51,705 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:23:51,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:23:51,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2025-04-13 20:23:51,706 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45789473684210524 [2025-04-13 20:23:51,706 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 120 flow. Second operand 5 states and 87 transitions. [2025-04-13 20:23:51,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 63 transitions, 296 flow [2025-04-13 20:23:51,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 63 transitions, 294 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:23:51,707 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 140 flow [2025-04-13 20:23:51,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=140, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2025-04-13 20:23:51,708 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 9 predicate places. [2025-04-13 20:23:51,708 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 140 flow [2025-04-13 20:23:51,708 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:23:51,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:51,708 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] [2025-04-13 20:23:51,708 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:23:51,708 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:23:51,709 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:51,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1065478753, now seen corresponding path program 1 times [2025-04-13 20:23:51,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:51,709 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578062177] [2025-04-13 20:23:51,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:23:51,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:51,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 20:23:51,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 20:23:51,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:23:51,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:51,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:23:51,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:51,820 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578062177] [2025-04-13 20:23:51,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578062177] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:23:51,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:23:51,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:23:51,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456915148] [2025-04-13 20:23:51,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:23:51,820 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:23:51,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:51,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:23:51,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:23:51,821 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-13 20:23:51,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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:23:51,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:51,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-13 20:23:51,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:52,012 INFO L116 PetriNetUnfolderBase]: 1111/1690 cut-off events. [2025-04-13 20:23:52,013 INFO L117 PetriNetUnfolderBase]: For 481/481 co-relation queries the response was YES. [2025-04-13 20:23:52,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3982 conditions, 1690 events. 1111/1690 cut-off events. For 481/481 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 7444 event pairs, 880 based on Foata normal form. 10/1289 useless extension candidates. Maximal degree in co-relation 3961. Up to 1317 conditions per place. [2025-04-13 20:23:52,019 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 33 selfloop transitions, 4 changer transitions 26/66 dead transitions. [2025-04-13 20:23:52,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 66 transitions, 352 flow [2025-04-13 20:23:52,019 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:23:52,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:23:52,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2025-04-13 20:23:52,020 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2025-04-13 20:23:52,020 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 140 flow. Second operand 5 states and 90 transitions. [2025-04-13 20:23:52,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 66 transitions, 352 flow [2025-04-13 20:23:52,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 66 transitions, 324 flow, removed 13 selfloop flow, removed 3 redundant places. [2025-04-13 20:23:52,023 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 152 flow [2025-04-13 20:23:52,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2025-04-13 20:23:52,024 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2025-04-13 20:23:52,024 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 152 flow [2025-04-13 20:23:52,024 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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:23:52,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:52,024 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] [2025-04-13 20:23:52,024 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 20:23:52,024 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:23:52,025 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:52,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1064857706, now seen corresponding path program 1 times [2025-04-13 20:23:52,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:52,025 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660281062] [2025-04-13 20:23:52,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:23:52,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:52,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 20:23:52,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 20:23:52,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:23:52,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:52,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:23:52,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:52,162 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660281062] [2025-04-13 20:23:52,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660281062] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:23:52,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:23:52,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:23:52,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456321604] [2025-04-13 20:23:52,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:23:52,162 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:23:52,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:52,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:23:52,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:23:52,163 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-13 20:23:52,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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:23:52,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:52,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-13 20:23:52,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:52,335 INFO L116 PetriNetUnfolderBase]: 1079/1637 cut-off events. [2025-04-13 20:23:52,335 INFO L117 PetriNetUnfolderBase]: For 426/426 co-relation queries the response was YES. [2025-04-13 20:23:52,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3830 conditions, 1637 events. 1079/1637 cut-off events. For 426/426 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7354 event pairs, 858 based on Foata normal form. 6/1241 useless extension candidates. Maximal degree in co-relation 3799. Up to 1315 conditions per place. [2025-04-13 20:23:52,341 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 32 selfloop transitions, 6 changer transitions 18/59 dead transitions. [2025-04-13 20:23:52,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 59 transitions, 318 flow [2025-04-13 20:23:52,342 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:23:52,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:23:52,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2025-04-13 20:23:52,343 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4368421052631579 [2025-04-13 20:23:52,343 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 152 flow. Second operand 5 states and 83 transitions. [2025-04-13 20:23:52,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 59 transitions, 318 flow [2025-04-13 20:23:52,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 59 transitions, 298 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-04-13 20:23:52,344 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 162 flow [2025-04-13 20:23:52,344 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2025-04-13 20:23:52,345 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2025-04-13 20:23:52,345 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 162 flow [2025-04-13 20:23:52,345 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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:23:52,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:52,345 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:23:52,345 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 20:23:52,345 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:23:52,347 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:52,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1769287836, now seen corresponding path program 1 times [2025-04-13 20:23:52,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:52,348 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76874924] [2025-04-13 20:23:52,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:23:52,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:52,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 20:23:52,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 20:23:52,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:23:52,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:52,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:23:52,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:52,590 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76874924] [2025-04-13 20:23:52,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76874924] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:23:52,590 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504739952] [2025-04-13 20:23:52,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:23:52,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:23:52,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:23:52,595 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:23:52,596 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:23:52,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 20:23:52,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 20:23:52,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:23:52,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:52,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-13 20:23:52,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:23:52,768 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:23:52,768 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 20:23:52,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504739952] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:23:52,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 20:23:52,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-04-13 20:23:52,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594107089] [2025-04-13 20:23:52,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:23:52,769 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:23:52,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:52,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:23:52,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-13 20:23:52,769 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-13 20:23:52,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states 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:23:52,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:52,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-13 20:23:52,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:52,998 INFO L116 PetriNetUnfolderBase]: 1727/2556 cut-off events. [2025-04-13 20:23:52,998 INFO L117 PetriNetUnfolderBase]: For 1029/1029 co-relation queries the response was YES. [2025-04-13 20:23:53,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6287 conditions, 2556 events. 1727/2556 cut-off events. For 1029/1029 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 10404 event pairs, 779 based on Foata normal form. 72/2113 useless extension candidates. Maximal degree in co-relation 6255. Up to 905 conditions per place. [2025-04-13 20:23:53,009 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 67 selfloop transitions, 9 changer transitions 0/79 dead transitions. [2025-04-13 20:23:53,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 79 transitions, 434 flow [2025-04-13 20:23:53,010 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:23:53,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:23:53,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-04-13 20:23:53,010 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6118421052631579 [2025-04-13 20:23:53,010 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 162 flow. Second operand 4 states and 93 transitions. [2025-04-13 20:23:53,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 79 transitions, 434 flow [2025-04-13 20:23:53,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 79 transitions, 420 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-04-13 20:23:53,012 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 211 flow [2025-04-13 20:23:53,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=211, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2025-04-13 20:23:53,013 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2025-04-13 20:23:53,013 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 211 flow [2025-04-13 20:23:53,013 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states 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:23:53,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:53,013 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] [2025-04-13 20:23:53,020 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:23:53,217 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:23:53,217 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:23:53,217 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:53,218 INFO L85 PathProgramCache]: Analyzing trace with hash -587784499, now seen corresponding path program 1 times [2025-04-13 20:23:53,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:53,218 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439363613] [2025-04-13 20:23:53,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:23:53,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:53,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 20:23:53,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 20:23:53,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:23:53,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:53,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:23:53,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:53,440 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439363613] [2025-04-13 20:23:53,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439363613] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:23:53,441 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409450754] [2025-04-13 20:23:53,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:23:53,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:23:53,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:23:53,443 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:23:53,445 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:23:53,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 20:23:53,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 20:23:53,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:23:53,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:53,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:23:53,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:23:53,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:23:53,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:23:53,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:23:53,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409450754] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:23:53,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:23:53,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 20:23:53,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194991156] [2025-04-13 20:23:53,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:23:53,732 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:23:53,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:53,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:23:53,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:23:53,733 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-13 20:23:53,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 211 flow. Second operand has 12 states, 12 states have (on average 9.916666666666666) internal successors, (119), 12 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:23:53,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:53,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-13 20:23:53,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:54,013 INFO L116 PetriNetUnfolderBase]: 1907/2882 cut-off events. [2025-04-13 20:23:54,013 INFO L117 PetriNetUnfolderBase]: For 2006/2006 co-relation queries the response was YES. [2025-04-13 20:23:54,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7927 conditions, 2882 events. 1907/2882 cut-off events. For 2006/2006 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 12734 event pairs, 1483 based on Foata normal form. 2/2276 useless extension candidates. Maximal degree in co-relation 7135. Up to 2543 conditions per place. [2025-04-13 20:23:54,031 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 42 selfloop transitions, 3 changer transitions 33/81 dead transitions. [2025-04-13 20:23:54,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 81 transitions, 483 flow [2025-04-13 20:23:54,032 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:23:54,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:23:54,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2025-04-13 20:23:54,033 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44298245614035087 [2025-04-13 20:23:54,033 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 211 flow. Second operand 6 states and 101 transitions. [2025-04-13 20:23:54,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 81 transitions, 483 flow [2025-04-13 20:23:54,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 81 transitions, 475 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-04-13 20:23:54,037 INFO L231 Difference]: Finished difference. Result has 61 places, 48 transitions, 225 flow [2025-04-13 20:23:54,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=225, PETRI_PLACES=61, PETRI_TRANSITIONS=48} [2025-04-13 20:23:54,038 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 23 predicate places. [2025-04-13 20:23:54,038 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 48 transitions, 225 flow [2025-04-13 20:23:54,038 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.916666666666666) internal successors, (119), 12 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:23:54,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:54,038 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] [2025-04-13 20:23:54,046 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:23:54,239 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-04-13 20:23:54,239 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:23:54,239 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:54,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1966276718, now seen corresponding path program 2 times [2025-04-13 20:23:54,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:54,240 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14619987] [2025-04-13 20:23:54,240 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:23:54,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:54,255 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-13 20:23:54,342 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 35 statements. [2025-04-13 20:23:54,342 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:23:54,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:55,273 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 20:23:55,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:55,273 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14619987] [2025-04-13 20:23:55,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14619987] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:23:55,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:23:55,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 20:23:55,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129131134] [2025-04-13 20:23:55,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:23:55,274 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 20:23:55,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:55,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 20:23:55,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-04-13 20:23:55,275 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-13 20:23:55,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 48 transitions, 225 flow. Second operand has 13 states, 13 states have (on average 8.384615384615385) internal successors, (109), 13 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:23:55,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:55,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-13 20:23:55,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:55,680 INFO L116 PetriNetUnfolderBase]: 1963/2904 cut-off events. [2025-04-13 20:23:55,680 INFO L117 PetriNetUnfolderBase]: For 2115/2115 co-relation queries the response was YES. [2025-04-13 20:23:55,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8081 conditions, 2904 events. 1963/2904 cut-off events. For 2115/2115 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 11832 event pairs, 564 based on Foata normal form. 1/2303 useless extension candidates. Maximal degree in co-relation 8046. Up to 2264 conditions per place. [2025-04-13 20:23:55,690 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 74 selfloop transitions, 15 changer transitions 12/104 dead transitions. [2025-04-13 20:23:55,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 104 transitions, 601 flow [2025-04-13 20:23:55,690 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:23:55,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:23:55,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 151 transitions. [2025-04-13 20:23:55,691 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3973684210526316 [2025-04-13 20:23:55,691 INFO L175 Difference]: Start difference. First operand has 61 places, 48 transitions, 225 flow. Second operand 10 states and 151 transitions. [2025-04-13 20:23:55,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 104 transitions, 601 flow [2025-04-13 20:23:55,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 104 transitions, 587 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-13 20:23:55,695 INFO L231 Difference]: Finished difference. Result has 68 places, 59 transitions, 335 flow [2025-04-13 20:23:55,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=335, PETRI_PLACES=68, PETRI_TRANSITIONS=59} [2025-04-13 20:23:55,696 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 30 predicate places. [2025-04-13 20:23:55,696 INFO L485 AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 335 flow [2025-04-13 20:23:55,696 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.384615384615385) internal successors, (109), 13 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:23:55,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:55,696 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] [2025-04-13 20:23:55,696 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 20:23:55,696 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:23:55,697 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:55,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1673296678, now seen corresponding path program 3 times [2025-04-13 20:23:55,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:55,697 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562867015] [2025-04-13 20:23:55,697 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:23:55,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:55,711 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 2 equivalence classes. [2025-04-13 20:23:55,763 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:23:55,764 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:23:55,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:55,843 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 20:23:55,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:55,843 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562867015] [2025-04-13 20:23:55,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562867015] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:23:55,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:23:55,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:23:55,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839067235] [2025-04-13 20:23:55,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:23:55,843 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:23:55,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:55,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:23:55,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:23:55,844 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-13 20:23:55,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 335 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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:23:55,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:55,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-13 20:23:55,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:56,367 INFO L116 PetriNetUnfolderBase]: 4718/6914 cut-off events. [2025-04-13 20:23:56,367 INFO L117 PetriNetUnfolderBase]: For 8445/8445 co-relation queries the response was YES. [2025-04-13 20:23:56,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20404 conditions, 6914 events. 4718/6914 cut-off events. For 8445/8445 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 31201 event pairs, 1831 based on Foata normal form. 152/5657 useless extension candidates. Maximal degree in co-relation 20361. Up to 2642 conditions per place. [2025-04-13 20:23:56,398 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 97 selfloop transitions, 7 changer transitions 0/107 dead transitions. [2025-04-13 20:23:56,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 107 transitions, 764 flow [2025-04-13 20:23:56,398 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:23:56,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:23:56,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-04-13 20:23:56,399 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6118421052631579 [2025-04-13 20:23:56,399 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 335 flow. Second operand 4 states and 93 transitions. [2025-04-13 20:23:56,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 107 transitions, 764 flow [2025-04-13 20:23:56,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 107 transitions, 734 flow, removed 13 selfloop flow, removed 2 redundant places. [2025-04-13 20:23:56,409 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 344 flow [2025-04-13 20:23:56,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=344, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2025-04-13 20:23:56,410 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 33 predicate places. [2025-04-13 20:23:56,410 INFO L485 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 344 flow [2025-04-13 20:23:56,410 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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:23:56,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:56,410 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] [2025-04-13 20:23:56,410 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 20:23:56,410 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:23:56,410 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:56,410 INFO L85 PathProgramCache]: Analyzing trace with hash 96892515, now seen corresponding path program 4 times [2025-04-13 20:23:56,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:56,411 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759935158] [2025-04-13 20:23:56,411 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:23:56,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:56,430 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-04-13 20:23:56,442 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:23:56,442 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:23:56,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:56,630 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:23:56,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:56,630 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759935158] [2025-04-13 20:23:56,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759935158] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:23:56,630 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714856892] [2025-04-13 20:23:56,630 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:23:56,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:23:56,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:23:56,632 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:23:56,633 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:23:56,703 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-04-13 20:23:56,733 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:23:56,734 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:23:56,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:56,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:23:56,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:23:56,860 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:23:56,860 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:23:56,986 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:23:56,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714856892] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:23:56,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:23:56,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-04-13 20:23:56,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360527172] [2025-04-13 20:23:56,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:23:56,986 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 20:23:56,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:56,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 20:23:56,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2025-04-13 20:23:56,987 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-13 20:23:56,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 344 flow. Second operand has 18 states, 18 states have (on average 9.944444444444445) internal successors, (179), 18 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:23:56,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:56,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-13 20:23:56,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:57,708 INFO L116 PetriNetUnfolderBase]: 5107/7582 cut-off events. [2025-04-13 20:23:57,708 INFO L117 PetriNetUnfolderBase]: For 11694/11694 co-relation queries the response was YES. [2025-04-13 20:23:57,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23189 conditions, 7582 events. 5107/7582 cut-off events. For 11694/11694 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 36738 event pairs, 3897 based on Foata normal form. 61/6048 useless extension candidates. Maximal degree in co-relation 21437. Up to 6900 conditions per place. [2025-04-13 20:23:57,805 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 55 selfloop transitions, 4 changer transitions 54/116 dead transitions. [2025-04-13 20:23:57,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 116 transitions, 803 flow [2025-04-13 20:23:57,806 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:23:57,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:23:57,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2025-04-13 20:23:57,806 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4276315789473684 [2025-04-13 20:23:57,806 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 344 flow. Second operand 8 states and 130 transitions. [2025-04-13 20:23:57,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 116 transitions, 803 flow [2025-04-13 20:23:57,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 116 transitions, 797 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-04-13 20:23:57,816 INFO L231 Difference]: Finished difference. Result has 82 places, 62 transitions, 370 flow [2025-04-13 20:23:57,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=370, PETRI_PLACES=82, PETRI_TRANSITIONS=62} [2025-04-13 20:23:57,816 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 44 predicate places. [2025-04-13 20:23:57,816 INFO L485 AbstractCegarLoop]: Abstraction has has 82 places, 62 transitions, 370 flow [2025-04-13 20:23:57,816 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.944444444444445) internal successors, (179), 18 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:23:57,816 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:57,817 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 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] [2025-04-13 20:23:57,823 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:23:58,017 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:23:58,017 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:23:58,018 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:58,018 INFO L85 PathProgramCache]: Analyzing trace with hash 341610504, now seen corresponding path program 5 times [2025-04-13 20:23:58,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:58,018 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682014476] [2025-04-13 20:23:58,018 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:23:58,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:58,030 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 3 equivalence classes. [2025-04-13 20:23:58,040 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 20:23:58,041 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 20:23:58,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:58,144 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 20:23:58,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:58,144 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682014476] [2025-04-13 20:23:58,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682014476] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:23:58,144 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312084997] [2025-04-13 20:23:58,144 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:23:58,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:23:58,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:23:58,146 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:23:58,147 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:23:58,227 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 3 equivalence classes. [2025-04-13 20:23:58,267 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 20:23:58,267 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 20:23:58,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:58,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:23:58,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:23:58,339 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-13 20:23:58,339 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:23:58,415 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-13 20:23:58,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312084997] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:23:58,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:23:58,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-04-13 20:23:58,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778064684] [2025-04-13 20:23:58,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:23:58,416 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 20:23:58,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:58,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 20:23:58,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-04-13 20:23:58,417 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-13 20:23:58,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 62 transitions, 370 flow. Second operand has 13 states, 13 states have (on average 11.153846153846153) internal successors, (145), 13 states have internal predecessors, (145), 0 states have call successors, (0), 0 states 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:23:58,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:58,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-13 20:23:58,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:59,411 INFO L116 PetriNetUnfolderBase]: 5739/8732 cut-off events. [2025-04-13 20:23:59,412 INFO L117 PetriNetUnfolderBase]: For 15183/15183 co-relation queries the response was YES. [2025-04-13 20:23:59,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26693 conditions, 8732 events. 5739/8732 cut-off events. For 15183/15183 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 44996 event pairs, 4367 based on Foata normal form. 259/7118 useless extension candidates. Maximal degree in co-relation 26643. Up to 6894 conditions per place. [2025-04-13 20:23:59,443 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 52 selfloop transitions, 9 changer transitions 123/187 dead transitions. [2025-04-13 20:23:59,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 187 transitions, 1300 flow [2025-04-13 20:23:59,443 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 20:23:59,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-13 20:23:59,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 266 transitions. [2025-04-13 20:23:59,444 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3684210526315789 [2025-04-13 20:23:59,444 INFO L175 Difference]: Start difference. First operand has 82 places, 62 transitions, 370 flow. Second operand 19 states and 266 transitions. [2025-04-13 20:23:59,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 187 transitions, 1300 flow [2025-04-13 20:23:59,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 187 transitions, 1256 flow, removed 19 selfloop flow, removed 6 redundant places. [2025-04-13 20:23:59,457 INFO L231 Difference]: Finished difference. Result has 101 places, 64 transitions, 422 flow [2025-04-13 20:23:59,457 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=422, PETRI_PLACES=101, PETRI_TRANSITIONS=64} [2025-04-13 20:23:59,458 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 63 predicate places. [2025-04-13 20:23:59,458 INFO L485 AbstractCegarLoop]: Abstraction has has 101 places, 64 transitions, 422 flow [2025-04-13 20:23:59,458 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.153846153846153) internal successors, (145), 13 states have internal predecessors, (145), 0 states have call successors, (0), 0 states 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:23:59,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:59,458 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 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] [2025-04-13 20:23:59,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 20:23:59,658 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:23:59,659 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:23:59,659 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:59,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1141648045, now seen corresponding path program 6 times [2025-04-13 20:23:59,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:59,659 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951208681] [2025-04-13 20:23:59,659 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:23:59,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:59,672 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 41 statements into 3 equivalence classes. [2025-04-13 20:23:59,714 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 20:23:59,714 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 20:23:59,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:59,777 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 20:23:59,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:59,777 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951208681] [2025-04-13 20:23:59,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951208681] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:23:59,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:23:59,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:23:59,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440399641] [2025-04-13 20:23:59,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:23:59,777 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:23:59,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:59,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:23:59,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:23:59,778 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-13 20:23:59,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 64 transitions, 422 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states 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:23:59,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:59,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-13 20:23:59,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:59,865 INFO L116 PetriNetUnfolderBase]: 580/992 cut-off events. [2025-04-13 20:23:59,865 INFO L117 PetriNetUnfolderBase]: For 1694/1694 co-relation queries the response was YES. [2025-04-13 20:23:59,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2720 conditions, 992 events. 580/992 cut-off events. For 1694/1694 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3838 event pairs, 557 based on Foata normal form. 80/792 useless extension candidates. Maximal degree in co-relation 2654. Up to 953 conditions per place. [2025-04-13 20:23:59,869 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 44 selfloop transitions, 5 changer transitions 1/53 dead transitions. [2025-04-13 20:23:59,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 53 transitions, 426 flow [2025-04-13 20:23:59,869 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:23:59,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:23:59,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2025-04-13 20:23:59,870 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3881578947368421 [2025-04-13 20:23:59,870 INFO L175 Difference]: Start difference. First operand has 101 places, 64 transitions, 422 flow. Second operand 4 states and 59 transitions. [2025-04-13 20:23:59,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 53 transitions, 426 flow [2025-04-13 20:23:59,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 53 transitions, 327 flow, removed 15 selfloop flow, removed 26 redundant places. [2025-04-13 20:23:59,873 INFO L231 Difference]: Finished difference. Result has 69 places, 50 transitions, 231 flow [2025-04-13 20:23:59,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=231, PETRI_PLACES=69, PETRI_TRANSITIONS=50} [2025-04-13 20:23:59,873 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 31 predicate places. [2025-04-13 20:23:59,873 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 50 transitions, 231 flow [2025-04-13 20:23:59,873 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states 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:23:59,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:59,873 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:23:59,874 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 20:23:59,874 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:23:59,874 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:59,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1525955988, now seen corresponding path program 7 times [2025-04-13 20:23:59,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:59,874 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229131856] [2025-04-13 20:23:59,874 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:23:59,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:59,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-13 20:23:59,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-13 20:23:59,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:23:59,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:24:00,147 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:24:00,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:24:00,147 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229131856] [2025-04-13 20:24:00,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229131856] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:24:00,147 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798716963] [2025-04-13 20:24:00,148 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:24:00,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:24:00,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:24:00,150 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:24:00,151 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:24:00,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-13 20:24:00,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-13 20:24:00,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:24:00,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:24:00,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 20:24:00,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:24:00,448 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:24:00,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:24:00,608 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:24:00,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798716963] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:24:00,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:24:00,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2025-04-13 20:24:00,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200485951] [2025-04-13 20:24:00,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:24:00,610 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 20:24:00,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:24:00,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 20:24:00,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2025-04-13 20:24:00,610 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-13 20:24:00,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 50 transitions, 231 flow. Second operand has 24 states, 24 states have (on average 9.583333333333334) internal successors, (230), 24 states have internal predecessors, (230), 0 states have call successors, (0), 0 states 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:24:00,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:24:00,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-13 20:24:00,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:24:01,000 INFO L116 PetriNetUnfolderBase]: 964/1661 cut-off events. [2025-04-13 20:24:01,001 INFO L117 PetriNetUnfolderBase]: For 389/389 co-relation queries the response was YES. [2025-04-13 20:24:01,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3843 conditions, 1661 events. 964/1661 cut-off events. For 389/389 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 7557 event pairs, 803 based on Foata normal form. 2/1195 useless extension candidates. Maximal degree in co-relation 2253. Up to 977 conditions per place. [2025-04-13 20:24:01,005 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 43 selfloop transitions, 5 changer transitions 60/111 dead transitions. [2025-04-13 20:24:01,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 111 transitions, 671 flow [2025-04-13 20:24:01,006 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 20:24:01,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 20:24:01,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 158 transitions. [2025-04-13 20:24:01,007 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37799043062200954 [2025-04-13 20:24:01,007 INFO L175 Difference]: Start difference. First operand has 69 places, 50 transitions, 231 flow. Second operand 11 states and 158 transitions. [2025-04-13 20:24:01,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 111 transitions, 671 flow [2025-04-13 20:24:01,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 111 transitions, 653 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-13 20:24:01,010 INFO L231 Difference]: Finished difference. Result has 83 places, 51 transitions, 255 flow [2025-04-13 20:24:01,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=255, PETRI_PLACES=83, PETRI_TRANSITIONS=51} [2025-04-13 20:24:01,011 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 45 predicate places. [2025-04-13 20:24:01,012 INFO L485 AbstractCegarLoop]: Abstraction has has 83 places, 51 transitions, 255 flow [2025-04-13 20:24:01,012 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.583333333333334) internal successors, (230), 24 states have internal predecessors, (230), 0 states have call successors, (0), 0 states 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:24:01,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:24:01,012 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:24:01,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 20:24:01,216 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 20:24:01,216 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:24:01,216 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:24:01,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1087954521, now seen corresponding path program 8 times [2025-04-13 20:24:01,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:24:01,216 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207194581] [2025-04-13 20:24:01,217 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:24:01,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:24:01,237 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-04-13 20:24:01,268 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 20:24:01,268 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:24:01,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:24:01,471 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 20:24:01,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:24:01,472 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207194581] [2025-04-13 20:24:01,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207194581] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:24:01,472 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921654273] [2025-04-13 20:24:01,472 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:24:01,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:24:01,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:24:01,476 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:24:01,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 20:24:01,566 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-04-13 20:24:01,658 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 20:24:01,658 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:24:01,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:24:01,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 20:24:01,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:24:01,764 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 20:24:01,765 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:24:01,879 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 20:24:01,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921654273] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:24:01,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:24:01,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-04-13 20:24:01,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563398693] [2025-04-13 20:24:01,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:24:01,880 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 20:24:01,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:24:01,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 20:24:01,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-04-13 20:24:01,880 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-13 20:24:01,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 51 transitions, 255 flow. Second operand has 15 states, 15 states have (on average 11.133333333333333) internal successors, (167), 15 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:24:01,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:24:01,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-13 20:24:01,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:24:02,273 INFO L116 PetriNetUnfolderBase]: 996/1725 cut-off events. [2025-04-13 20:24:02,274 INFO L117 PetriNetUnfolderBase]: For 574/574 co-relation queries the response was YES. [2025-04-13 20:24:02,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4104 conditions, 1725 events. 996/1725 cut-off events. For 574/574 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 7926 event pairs, 800 based on Foata normal form. 22/1264 useless extension candidates. Maximal degree in co-relation 4055. Up to 973 conditions per place. [2025-04-13 20:24:02,279 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 41 selfloop transitions, 8 changer transitions 45/97 dead transitions. [2025-04-13 20:24:02,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 97 transitions, 626 flow [2025-04-13 20:24:02,281 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 20:24:02,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 20:24:02,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 153 transitions. [2025-04-13 20:24:02,281 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3355263157894737 [2025-04-13 20:24:02,281 INFO L175 Difference]: Start difference. First operand has 83 places, 51 transitions, 255 flow. Second operand 12 states and 153 transitions. [2025-04-13 20:24:02,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 97 transitions, 626 flow [2025-04-13 20:24:02,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 97 transitions, 590 flow, removed 14 selfloop flow, removed 9 redundant places. [2025-04-13 20:24:02,285 INFO L231 Difference]: Finished difference. Result has 84 places, 52 transitions, 263 flow [2025-04-13 20:24:02,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=263, PETRI_PLACES=84, PETRI_TRANSITIONS=52} [2025-04-13 20:24:02,285 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 46 predicate places. [2025-04-13 20:24:02,285 INFO L485 AbstractCegarLoop]: Abstraction has has 84 places, 52 transitions, 263 flow [2025-04-13 20:24:02,286 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.133333333333333) internal successors, (167), 15 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:24:02,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:24:02,286 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:24:02,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 20:24:02,486 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 20:24:02,486 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:24:02,487 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:24:02,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1789564182, now seen corresponding path program 9 times [2025-04-13 20:24:02,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:24:02,487 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420430165] [2025-04-13 20:24:02,487 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:24:02,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:24:02,504 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 51 statements into 4 equivalence classes. [2025-04-13 20:24:02,723 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 51 of 51 statements. [2025-04-13 20:24:02,723 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 20:24:02,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:24:09,079 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:24:09,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:24:09,080 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420430165] [2025-04-13 20:24:09,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420430165] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:24:09,080 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478601546] [2025-04-13 20:24:09,080 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:24:09,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:24:09,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:24:09,082 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:24:09,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 20:24:09,170 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 51 statements into 4 equivalence classes. [2025-04-13 20:24:09,341 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 51 of 51 statements. [2025-04-13 20:24:09,341 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 20:24:09,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:24:09,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 110 conjuncts are in the unsatisfiable core [2025-04-13 20:24:09,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:24:09,648 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 20:24:11,459 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:24:11,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:24:58,492 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:24:58,493 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1065 treesize of output 1029 [2025-04-13 20:24:58,531 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 65 [2025-04-13 20:25:00,922 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 20:25:00,931 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 20:27:38,516 WARN L286 SmtUtils]: Spent 2.63m on a formula simplification. DAG size of input: 3669 DAG size of output: 3579 (called from [L 323] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-04-13 20:27:38,518 INFO L325 Elim1Store]: treesize reduction 262, result has 97.9 percent of original size [2025-04-13 20:27:38,520 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 44 select indices, 44 select index equivalence classes, 8 disjoint index pairs (out of 946 index pairs), introduced 44 new quantified variables, introduced 938 case distinctions, treesize of input 1221 treesize of output 13311 [2025-04-13 20:30:43,265 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-13 20:30:43,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2025-04-13 20:30:43,266 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-13 20:30:43,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-13 20:30:43,467 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:30:43,468 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:589) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:726) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:142) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:56) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 87 more [2025-04-13 20:30:43,472 INFO L158 Benchmark]: Toolchain (without parser) took 415232.53ms. Allocated memory was 155.2MB in the beginning and 717.2MB in the end (delta: 562.0MB). Free memory was 108.7MB in the beginning and 260.7MB in the end (delta: -152.1MB). Peak memory consumption was 441.6MB. Max. memory is 8.0GB. [2025-04-13 20:30:43,473 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 88.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:30:43,473 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.85ms. Allocated memory is still 155.2MB. Free memory was 108.7MB in the beginning and 92.5MB in the end (delta: 16.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 20:30:43,473 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.68ms. Allocated memory is still 155.2MB. Free memory was 92.5MB in the beginning and 89.7MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:30:43,473 INFO L158 Benchmark]: Boogie Preprocessor took 47.38ms. Allocated memory is still 155.2MB. Free memory was 89.7MB in the beginning and 87.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:30:43,473 INFO L158 Benchmark]: RCFGBuilder took 793.07ms. Allocated memory is still 155.2MB. Free memory was 87.0MB in the beginning and 52.6MB in the end (delta: 34.4MB). Peak memory consumption was 70.5MB. Max. memory is 8.0GB. [2025-04-13 20:30:43,473 INFO L158 Benchmark]: TraceAbstraction took 414065.67ms. Allocated memory was 155.2MB in the beginning and 717.2MB in the end (delta: 562.0MB). Free memory was 52.1MB in the beginning and 260.7MB in the end (delta: -208.6MB). Peak memory consumption was 387.9MB. Max. memory is 8.0GB. [2025-04-13 20:30:43,474 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 88.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 290.85ms. Allocated memory is still 155.2MB. Free memory was 108.7MB in the beginning and 92.5MB in the end (delta: 16.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.68ms. Allocated memory is still 155.2MB. Free memory was 92.5MB in the beginning and 89.7MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 47.38ms. Allocated memory is still 155.2MB. Free memory was 89.7MB in the beginning and 87.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 793.07ms. Allocated memory is still 155.2MB. Free memory was 87.0MB in the beginning and 52.6MB in the end (delta: 34.4MB). Peak memory consumption was 70.5MB. Max. memory is 8.0GB. * TraceAbstraction took 414065.67ms. Allocated memory was 155.2MB in the beginning and 717.2MB in the end (delta: 562.0MB). Free memory was 52.1MB in the beginning and 260.7MB in the end (delta: -208.6MB). Peak memory consumption was 387.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...