./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/test-easy1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/test-easy1.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 935a7b7fee114f90b65d69dd73b2635844dd9aedca06c4cbc37a4ce046611c9d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:28:10,864 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:28:10,924 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:28:10,927 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:28:10,928 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:28:10,948 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:28:10,949 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:28:10,949 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:28:10,949 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:28:10,949 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:28:10,949 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:28:10,949 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:28:10,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:28:10,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:28:10,949 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:28:10,950 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:28:10,950 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:28:10,950 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:28:10,950 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:28:10,950 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:28:10,950 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:28:10,950 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:28:10,950 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:28:10,950 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:28:10,950 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:28:10,950 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:28:10,950 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:28:10,950 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:28:10,950 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:28:10,950 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:28:10,950 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:28:10,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:28:10,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:28:10,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:28:10,953 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:28:10,953 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:28:10,953 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:28:10,953 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:28:10,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:28:10,953 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:28:10,953 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:28:10,953 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:28:10,953 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:28:10,953 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 935a7b7fee114f90b65d69dd73b2635844dd9aedca06c4cbc37a4ce046611c9d [2025-03-04 02:28:11,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:28:11,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:28:11,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:28:11,212 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:28:11,212 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:28:11,213 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/test-easy1.wvr.c [2025-03-04 02:28:12,356 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/484f1d09d/9971667ea9f24ceb9bb1999c4e55c51a/FLAG944b54fb7 [2025-03-04 02:28:12,611 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:28:12,613 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/test-easy1.wvr.c [2025-03-04 02:28:12,623 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/484f1d09d/9971667ea9f24ceb9bb1999c4e55c51a/FLAG944b54fb7 [2025-03-04 02:28:12,925 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/484f1d09d/9971667ea9f24ceb9bb1999c4e55c51a [2025-03-04 02:28:12,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:28:12,928 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:28:12,929 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:28:12,929 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:28:12,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:28:12,933 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:28:12" (1/1) ... [2025-03-04 02:28:12,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f13129e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:12, skipping insertion in model container [2025-03-04 02:28:12,933 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:28:12" (1/1) ... [2025-03-04 02:28:12,942 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:28:13,052 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/test-easy1.wvr.c[1902,1915] [2025-03-04 02:28:13,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:28:13,069 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:28:13,081 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/test-easy1.wvr.c[1902,1915] [2025-03-04 02:28:13,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:28:13,093 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:28:13,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:13 WrapperNode [2025-03-04 02:28:13,094 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:28:13,095 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:28:13,095 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:28:13,095 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:28:13,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:13" (1/1) ... [2025-03-04 02:28:13,107 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:13" (1/1) ... [2025-03-04 02:28:13,119 INFO L138 Inliner]: procedures = 20, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 45 [2025-03-04 02:28:13,119 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:28:13,120 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:28:13,120 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:28:13,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:28:13,125 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:13" (1/1) ... [2025-03-04 02:28:13,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:13" (1/1) ... [2025-03-04 02:28:13,126 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:13" (1/1) ... [2025-03-04 02:28:13,136 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 02:28:13,137 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:13" (1/1) ... [2025-03-04 02:28:13,137 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:13" (1/1) ... [2025-03-04 02:28:13,143 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:13" (1/1) ... [2025-03-04 02:28:13,143 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:13" (1/1) ... [2025-03-04 02:28:13,144 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:13" (1/1) ... [2025-03-04 02:28:13,144 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:13" (1/1) ... [2025-03-04 02:28:13,145 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:28:13,149 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:28:13,150 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:28:13,150 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:28:13,151 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:13" (1/1) ... [2025-03-04 02:28:13,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:28:13,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:13,178 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-03-04 02:28:13,184 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-03-04 02:28:13,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:28:13,200 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:28:13,200 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:28:13,200 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:28:13,201 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:28:13,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:28:13,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:28:13,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:28:13,202 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:28:13,266 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:28:13,267 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:28:13,402 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:28:13,403 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:28:13,492 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:28:13,494 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:28:13,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:28:13 BoogieIcfgContainer [2025-03-04 02:28:13,494 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:28:13,496 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:28:13,496 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:28:13,499 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:28:13,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:28:12" (1/3) ... [2025-03-04 02:28:13,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f268b0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:28:13, skipping insertion in model container [2025-03-04 02:28:13,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:13" (2/3) ... [2025-03-04 02:28:13,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f268b0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:28:13, skipping insertion in model container [2025-03-04 02:28:13,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:28:13" (3/3) ... [2025-03-04 02:28:13,502 INFO L128 eAbstractionObserver]: Analyzing ICFG test-easy1.wvr.c [2025-03-04 02:28:13,513 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:28:13,515 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-easy1.wvr.c that has 3 procedures, 17 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-04 02:28:13,515 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:28:13,545 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 02:28:13,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 18 transitions, 50 flow [2025-03-04 02:28:13,600 INFO L124 PetriNetUnfolderBase]: 2/16 cut-off events. [2025-03-04 02:28:13,602 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:28:13,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 16 events. 2/16 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 9 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-03-04 02:28:13,605 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 18 transitions, 50 flow [2025-03-04 02:28:13,607 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 15 transitions, 42 flow [2025-03-04 02:28:13,615 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:28:13,622 INFO L333 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;@77fb2eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:28:13,622 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-04 02:28:13,628 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:28:13,629 INFO L124 PetriNetUnfolderBase]: 2/14 cut-off events. [2025-03-04 02:28:13,629 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:28:13,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:13,629 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:13,629 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:13,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:13,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1224369187, now seen corresponding path program 1 times [2025-03-04 02:28:13,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:13,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822350659] [2025-03-04 02:28:13,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:28:13,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:13,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 02:28:13,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 02:28:13,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:13,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:13,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:13,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:13,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822350659] [2025-03-04 02:28:13,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822350659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:13,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:13,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:28:13,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100763023] [2025-03-04 02:28:13,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:13,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:28:13,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:13,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:28:13,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:28:13,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 18 [2025-03-04 02:28:13,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 15 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:13,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:13,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 18 [2025-03-04 02:28:13,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:13,943 INFO L124 PetriNetUnfolderBase]: 59/104 cut-off events. [2025-03-04 02:28:13,944 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-04 02:28:13,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 104 events. 59/104 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 279 event pairs, 8 based on Foata normal form. 1/69 useless extension candidates. Maximal degree in co-relation 179. Up to 77 conditions per place. [2025-03-04 02:28:13,946 INFO L140 encePairwiseOnDemand]: 14/18 looper letters, 17 selfloop transitions, 3 changer transitions 1/24 dead transitions. [2025-03-04 02:28:13,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 24 transitions, 111 flow [2025-03-04 02:28:13,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:28:13,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:28:13,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-03-04 02:28:13,957 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2025-03-04 02:28:13,958 INFO L175 Difference]: Start difference. First operand has 20 places, 15 transitions, 42 flow. Second operand 3 states and 37 transitions. [2025-03-04 02:28:13,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 24 transitions, 111 flow [2025-03-04 02:28:13,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 24 transitions, 97 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 02:28:13,965 INFO L231 Difference]: Finished difference. Result has 19 places, 17 transitions, 53 flow [2025-03-04 02:28:13,967 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=53, PETRI_PLACES=19, PETRI_TRANSITIONS=17} [2025-03-04 02:28:13,970 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, -1 predicate places. [2025-03-04 02:28:13,970 INFO L471 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 53 flow [2025-03-04 02:28:13,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:13,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:13,971 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:13,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:28:13,972 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:13,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:13,973 INFO L85 PathProgramCache]: Analyzing trace with hash 965142117, now seen corresponding path program 1 times [2025-03-04 02:28:13,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:13,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925683278] [2025-03-04 02:28:13,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:28:13,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:13,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 02:28:13,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:28:13,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:13,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:14,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:14,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:14,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925683278] [2025-03-04 02:28:14,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925683278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:14,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:14,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:28:14,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115291281] [2025-03-04 02:28:14,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:14,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:28:14,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:14,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:28:14,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:28:14,057 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 18 [2025-03-04 02:28:14,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 17 transitions, 53 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:14,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:14,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 18 [2025-03-04 02:28:14,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:14,156 INFO L124 PetriNetUnfolderBase]: 60/115 cut-off events. [2025-03-04 02:28:14,156 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-04 02:28:14,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 115 events. 60/115 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 324 event pairs, 6 based on Foata normal form. 6/119 useless extension candidates. Maximal degree in co-relation 79. Up to 46 conditions per place. [2025-03-04 02:28:14,157 INFO L140 encePairwiseOnDemand]: 13/18 looper letters, 26 selfloop transitions, 7 changer transitions 2/38 dead transitions. [2025-03-04 02:28:14,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 38 transitions, 183 flow [2025-03-04 02:28:14,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:28:14,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:28:14,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2025-03-04 02:28:14,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2025-03-04 02:28:14,158 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 53 flow. Second operand 5 states and 58 transitions. [2025-03-04 02:28:14,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 38 transitions, 183 flow [2025-03-04 02:28:14,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 38 transitions, 179 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:28:14,159 INFO L231 Difference]: Finished difference. Result has 25 places, 23 transitions, 106 flow [2025-03-04 02:28:14,160 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=106, PETRI_PLACES=25, PETRI_TRANSITIONS=23} [2025-03-04 02:28:14,160 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 5 predicate places. [2025-03-04 02:28:14,160 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 23 transitions, 106 flow [2025-03-04 02:28:14,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:14,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:14,161 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:14,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:28:14,161 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:14,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:14,161 INFO L85 PathProgramCache]: Analyzing trace with hash -828600164, now seen corresponding path program 1 times [2025-03-04 02:28:14,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:14,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219923764] [2025-03-04 02:28:14,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:28:14,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:14,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 02:28:14,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:28:14,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:14,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:14,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:14,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:14,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219923764] [2025-03-04 02:28:14,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219923764] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:14,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706504804] [2025-03-04 02:28:14,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:28:14,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:14,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:14,239 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-03-04 02:28:14,241 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-03-04 02:28:14,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 02:28:14,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:28:14,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:14,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:14,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 02:28:14,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:14,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:14,343 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:14,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:14,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706504804] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:14,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:28:14,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 6 [2025-03-04 02:28:14,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110542438] [2025-03-04 02:28:14,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:14,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:28:14,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:14,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:28:14,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:28:14,405 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 18 [2025-03-04 02:28:14,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 23 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:14,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:14,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 18 [2025-03-04 02:28:14,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:14,493 INFO L124 PetriNetUnfolderBase]: 61/134 cut-off events. [2025-03-04 02:28:14,493 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2025-03-04 02:28:14,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 427 conditions, 134 events. 61/134 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 11 based on Foata normal form. 5/137 useless extension candidates. Maximal degree in co-relation 290. Up to 52 conditions per place. [2025-03-04 02:28:14,494 INFO L140 encePairwiseOnDemand]: 13/18 looper letters, 28 selfloop transitions, 8 changer transitions 2/41 dead transitions. [2025-03-04 02:28:14,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 41 transitions, 256 flow [2025-03-04 02:28:14,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:28:14,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:28:14,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2025-03-04 02:28:14,496 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2025-03-04 02:28:14,496 INFO L175 Difference]: Start difference. First operand has 25 places, 23 transitions, 106 flow. Second operand 4 states and 50 transitions. [2025-03-04 02:28:14,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 41 transitions, 256 flow [2025-03-04 02:28:14,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 41 transitions, 256 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:28:14,498 INFO L231 Difference]: Finished difference. Result has 30 places, 26 transitions, 153 flow [2025-03-04 02:28:14,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=153, PETRI_PLACES=30, PETRI_TRANSITIONS=26} [2025-03-04 02:28:14,499 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 10 predicate places. [2025-03-04 02:28:14,499 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 26 transitions, 153 flow [2025-03-04 02:28:14,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:14,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:14,499 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:14,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 02:28:14,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:14,700 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:14,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:14,701 INFO L85 PathProgramCache]: Analyzing trace with hash -518786202, now seen corresponding path program 2 times [2025-03-04 02:28:14,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:14,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112449541] [2025-03-04 02:28:14,701 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:14,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:14,711 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 02:28:14,719 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:28:14,720 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:14,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:14,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:14,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:14,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112449541] [2025-03-04 02:28:14,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112449541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:14,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:14,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:28:14,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506836990] [2025-03-04 02:28:14,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:14,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:28:14,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:14,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:28:14,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:28:14,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 18 [2025-03-04 02:28:14,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 153 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:14,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:14,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 18 [2025-03-04 02:28:14,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:14,845 INFO L124 PetriNetUnfolderBase]: 51/111 cut-off events. [2025-03-04 02:28:14,845 INFO L125 PetriNetUnfolderBase]: For 235/235 co-relation queries the response was YES. [2025-03-04 02:28:14,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421 conditions, 111 events. 51/111 cut-off events. For 235/235 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 328 event pairs, 6 based on Foata normal form. 2/112 useless extension candidates. Maximal degree in co-relation 276. Up to 39 conditions per place. [2025-03-04 02:28:14,847 INFO L140 encePairwiseOnDemand]: 13/18 looper letters, 28 selfloop transitions, 7 changer transitions 2/40 dead transitions. [2025-03-04 02:28:14,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 291 flow [2025-03-04 02:28:14,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:28:14,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:28:14,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2025-03-04 02:28:14,849 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2025-03-04 02:28:14,849 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 153 flow. Second operand 5 states and 55 transitions. [2025-03-04 02:28:14,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 291 flow [2025-03-04 02:28:14,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 287 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-03-04 02:28:14,851 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 172 flow [2025-03-04 02:28:14,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=172, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2025-03-04 02:28:14,853 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 15 predicate places. [2025-03-04 02:28:14,853 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 172 flow [2025-03-04 02:28:14,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:14,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:14,853 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:14,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:28:14,854 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:14,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:14,854 INFO L85 PathProgramCache]: Analyzing trace with hash 494082209, now seen corresponding path program 2 times [2025-03-04 02:28:14,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:14,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16542592] [2025-03-04 02:28:14,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:14,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:14,859 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 02:28:14,866 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:28:14,869 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:14,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:14,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:14,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:14,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16542592] [2025-03-04 02:28:14,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16542592] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:14,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949134082] [2025-03-04 02:28:14,899 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:14,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:14,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:14,902 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-03-04 02:28:14,903 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-03-04 02:28:14,931 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 02:28:14,943 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:28:14,944 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:14,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:14,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 02:28:14,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:14,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:14,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:15,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:15,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949134082] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:15,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:28:15,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 6 [2025-03-04 02:28:15,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121441287] [2025-03-04 02:28:15,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:15,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:28:15,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:15,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:28:15,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:28:15,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 18 [2025-03-04 02:28:15,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:15,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:15,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 18 [2025-03-04 02:28:15,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:15,083 INFO L124 PetriNetUnfolderBase]: 43/93 cut-off events. [2025-03-04 02:28:15,083 INFO L125 PetriNetUnfolderBase]: For 199/199 co-relation queries the response was YES. [2025-03-04 02:28:15,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 389 conditions, 93 events. 43/93 cut-off events. For 199/199 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 228 event pairs, 4 based on Foata normal form. 4/96 useless extension candidates. Maximal degree in co-relation 233. Up to 57 conditions per place. [2025-03-04 02:28:15,084 INFO L140 encePairwiseOnDemand]: 13/18 looper letters, 24 selfloop transitions, 7 changer transitions 0/34 dead transitions. [2025-03-04 02:28:15,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 34 transitions, 263 flow [2025-03-04 02:28:15,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:28:15,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:28:15,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2025-03-04 02:28:15,085 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2025-03-04 02:28:15,085 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 172 flow. Second operand 4 states and 46 transitions. [2025-03-04 02:28:15,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 34 transitions, 263 flow [2025-03-04 02:28:15,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 34 transitions, 241 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-03-04 02:28:15,088 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 169 flow [2025-03-04 02:28:15,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2025-03-04 02:28:15,088 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 17 predicate places. [2025-03-04 02:28:15,088 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 169 flow [2025-03-04 02:28:15,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:15,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:15,088 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:15,095 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-03-04 02:28:15,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:15,289 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:15,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:15,290 INFO L85 PathProgramCache]: Analyzing trace with hash -493455986, now seen corresponding path program 1 times [2025-03-04 02:28:15,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:15,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109311763] [2025-03-04 02:28:15,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:28:15,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:15,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 02:28:15,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 02:28:15,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:15,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:15,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:15,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:15,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109311763] [2025-03-04 02:28:15,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109311763] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:15,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866719744] [2025-03-04 02:28:15,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:28:15,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:15,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:15,405 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-03-04 02:28:15,407 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-03-04 02:28:15,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 02:28:15,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 02:28:15,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:15,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:15,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:28:15,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:15,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:15,550 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:15,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:15,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866719744] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:15,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:15,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-04 02:28:15,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134060667] [2025-03-04 02:28:15,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:15,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:28:15,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:15,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:28:15,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:28:15,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 18 [2025-03-04 02:28:15,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 169 flow. Second operand has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:15,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:15,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 18 [2025-03-04 02:28:15,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:15,769 INFO L124 PetriNetUnfolderBase]: 98/193 cut-off events. [2025-03-04 02:28:15,769 INFO L125 PetriNetUnfolderBase]: For 517/517 co-relation queries the response was YES. [2025-03-04 02:28:15,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 830 conditions, 193 events. 98/193 cut-off events. For 517/517 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 644 event pairs, 0 based on Foata normal form. 17/209 useless extension candidates. Maximal degree in co-relation 274. Up to 76 conditions per place. [2025-03-04 02:28:15,771 INFO L140 encePairwiseOnDemand]: 12/18 looper letters, 38 selfloop transitions, 19 changer transitions 8/68 dead transitions. [2025-03-04 02:28:15,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 68 transitions, 551 flow [2025-03-04 02:28:15,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:28:15,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:28:15,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2025-03-04 02:28:15,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2025-03-04 02:28:15,780 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 169 flow. Second operand 9 states and 102 transitions. [2025-03-04 02:28:15,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 68 transitions, 551 flow [2025-03-04 02:28:15,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 68 transitions, 504 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-04 02:28:15,782 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 346 flow [2025-03-04 02:28:15,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=346, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2025-03-04 02:28:15,786 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 28 predicate places. [2025-03-04 02:28:15,786 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 346 flow [2025-03-04 02:28:15,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:15,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:15,787 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:15,804 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-03-04 02:28:15,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:15,989 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:15,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:15,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1546730822, now seen corresponding path program 2 times [2025-03-04 02:28:15,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:15,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113860888] [2025-03-04 02:28:15,990 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:15,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:15,994 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 02:28:16,001 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 02:28:16,001 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:16,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:16,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:16,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:16,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113860888] [2025-03-04 02:28:16,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113860888] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:16,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091986411] [2025-03-04 02:28:16,080 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:16,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:16,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:16,082 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-03-04 02:28:16,083 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-03-04 02:28:16,110 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 02:28:16,123 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 02:28:16,124 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:16,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:16,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:28:16,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:16,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:16,193 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:16,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:16,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091986411] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:16,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:16,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 3] total 10 [2025-03-04 02:28:16,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862830757] [2025-03-04 02:28:16,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:16,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:28:16,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:16,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:28:16,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:28:16,215 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 18 [2025-03-04 02:28:16,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 346 flow. Second operand has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:16,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:16,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 18 [2025-03-04 02:28:16,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:16,349 INFO L124 PetriNetUnfolderBase]: 151/283 cut-off events. [2025-03-04 02:28:16,349 INFO L125 PetriNetUnfolderBase]: For 1246/1246 co-relation queries the response was YES. [2025-03-04 02:28:16,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1470 conditions, 283 events. 151/283 cut-off events. For 1246/1246 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1023 event pairs, 3 based on Foata normal form. 6/288 useless extension candidates. Maximal degree in co-relation 1361. Up to 101 conditions per place. [2025-03-04 02:28:16,351 INFO L140 encePairwiseOnDemand]: 12/18 looper letters, 42 selfloop transitions, 42 changer transitions 2/89 dead transitions. [2025-03-04 02:28:16,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 89 transitions, 880 flow [2025-03-04 02:28:16,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:28:16,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:28:16,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 114 transitions. [2025-03-04 02:28:16,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2025-03-04 02:28:16,352 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 346 flow. Second operand 11 states and 114 transitions. [2025-03-04 02:28:16,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 89 transitions, 880 flow [2025-03-04 02:28:16,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 89 transitions, 805 flow, removed 36 selfloop flow, removed 2 redundant places. [2025-03-04 02:28:16,357 INFO L231 Difference]: Finished difference. Result has 60 places, 64 transitions, 703 flow [2025-03-04 02:28:16,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=703, PETRI_PLACES=60, PETRI_TRANSITIONS=64} [2025-03-04 02:28:16,358 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 40 predicate places. [2025-03-04 02:28:16,358 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 64 transitions, 703 flow [2025-03-04 02:28:16,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:16,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:16,358 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:16,364 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-03-04 02:28:16,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:16,559 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:16,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:16,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1691273124, now seen corresponding path program 3 times [2025-03-04 02:28:16,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:16,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457259480] [2025-03-04 02:28:16,560 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:28:16,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:16,565 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:28:16,569 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:28:16,569 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:28:16,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:16,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:16,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:16,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457259480] [2025-03-04 02:28:16,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457259480] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:16,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087473495] [2025-03-04 02:28:16,607 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:28:16,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:16,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:16,609 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-03-04 02:28:16,611 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-03-04 02:28:16,637 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:28:16,645 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:28:16,645 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:28:16,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:16,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 02:28:16,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:16,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:16,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:16,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:16,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087473495] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:16,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:16,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 02:28:16,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129244972] [2025-03-04 02:28:16,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:16,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:28:16,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:16,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:28:16,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:28:16,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 18 [2025-03-04 02:28:16,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 64 transitions, 703 flow. Second operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:16,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:16,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 18 [2025-03-04 02:28:16,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:16,834 INFO L124 PetriNetUnfolderBase]: 169/334 cut-off events. [2025-03-04 02:28:16,835 INFO L125 PetriNetUnfolderBase]: For 2614/2614 co-relation queries the response was YES. [2025-03-04 02:28:16,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1952 conditions, 334 events. 169/334 cut-off events. For 2614/2614 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1357 event pairs, 4 based on Foata normal form. 15/348 useless extension candidates. Maximal degree in co-relation 1799. Up to 105 conditions per place. [2025-03-04 02:28:16,837 INFO L140 encePairwiseOnDemand]: 13/18 looper letters, 61 selfloop transitions, 33 changer transitions 19/116 dead transitions. [2025-03-04 02:28:16,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 116 transitions, 1439 flow [2025-03-04 02:28:16,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:28:16,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:28:16,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2025-03-04 02:28:16,839 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5987654320987654 [2025-03-04 02:28:16,839 INFO L175 Difference]: Start difference. First operand has 60 places, 64 transitions, 703 flow. Second operand 9 states and 97 transitions. [2025-03-04 02:28:16,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 116 transitions, 1439 flow [2025-03-04 02:28:16,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 116 transitions, 1232 flow, removed 100 selfloop flow, removed 3 redundant places. [2025-03-04 02:28:16,847 INFO L231 Difference]: Finished difference. Result has 70 places, 75 transitions, 844 flow [2025-03-04 02:28:16,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=844, PETRI_PLACES=70, PETRI_TRANSITIONS=75} [2025-03-04 02:28:16,848 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 50 predicate places. [2025-03-04 02:28:16,848 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 75 transitions, 844 flow [2025-03-04 02:28:16,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:16,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:16,848 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:16,854 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-03-04 02:28:17,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:17,053 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:17,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:17,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1656924602, now seen corresponding path program 4 times [2025-03-04 02:28:17,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:17,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357525385] [2025-03-04 02:28:17,054 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:28:17,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:17,057 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:28:17,059 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:28:17,060 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:28:17,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:17,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:17,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:17,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357525385] [2025-03-04 02:28:17,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357525385] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:17,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594459622] [2025-03-04 02:28:17,101 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:28:17,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:17,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:17,103 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-03-04 02:28:17,105 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-03-04 02:28:17,128 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:28:17,137 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:28:17,137 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:28:17,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:17,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 02:28:17,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:17,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:17,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:17,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:17,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594459622] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:17,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:17,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 02:28:17,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950888092] [2025-03-04 02:28:17,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:17,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:28:17,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:17,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:28:17,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:28:17,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 18 [2025-03-04 02:28:17,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 75 transitions, 844 flow. Second operand has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:17,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:17,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 18 [2025-03-04 02:28:17,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:17,363 INFO L124 PetriNetUnfolderBase]: 169/343 cut-off events. [2025-03-04 02:28:17,363 INFO L125 PetriNetUnfolderBase]: For 1860/1860 co-relation queries the response was YES. [2025-03-04 02:28:17,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1877 conditions, 343 events. 169/343 cut-off events. For 1860/1860 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1390 event pairs, 4 based on Foata normal form. 4/346 useless extension candidates. Maximal degree in co-relation 1690. Up to 168 conditions per place. [2025-03-04 02:28:17,367 INFO L140 encePairwiseOnDemand]: 12/18 looper letters, 70 selfloop transitions, 49 changer transitions 0/122 dead transitions. [2025-03-04 02:28:17,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 122 transitions, 1419 flow [2025-03-04 02:28:17,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:28:17,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:28:17,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 117 transitions. [2025-03-04 02:28:17,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-03-04 02:28:17,368 INFO L175 Difference]: Start difference. First operand has 70 places, 75 transitions, 844 flow. Second operand 12 states and 117 transitions. [2025-03-04 02:28:17,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 122 transitions, 1419 flow [2025-03-04 02:28:17,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 122 transitions, 1329 flow, removed 41 selfloop flow, removed 2 redundant places. [2025-03-04 02:28:17,378 INFO L231 Difference]: Finished difference. Result has 84 places, 97 transitions, 1180 flow [2025-03-04 02:28:17,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1180, PETRI_PLACES=84, PETRI_TRANSITIONS=97} [2025-03-04 02:28:17,379 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 64 predicate places. [2025-03-04 02:28:17,379 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 97 transitions, 1180 flow [2025-03-04 02:28:17,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:17,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:17,379 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:17,385 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-03-04 02:28:17,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:17,580 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:17,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:17,580 INFO L85 PathProgramCache]: Analyzing trace with hash 723460893, now seen corresponding path program 5 times [2025-03-04 02:28:17,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:17,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141305779] [2025-03-04 02:28:17,581 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:28:17,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:17,598 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:28:17,604 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:28:17,605 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:17,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:17,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:17,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:17,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141305779] [2025-03-04 02:28:17,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141305779] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:17,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122608178] [2025-03-04 02:28:17,638 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:28:17,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:17,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:17,640 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-03-04 02:28:17,641 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-03-04 02:28:17,665 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:28:17,674 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:28:17,674 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:17,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:17,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 02:28:17,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:17,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:17,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:17,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:17,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122608178] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:17,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:17,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2025-03-04 02:28:17,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509267320] [2025-03-04 02:28:17,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:17,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:28:17,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:17,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:28:17,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:28:17,755 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 18 [2025-03-04 02:28:17,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 97 transitions, 1180 flow. Second operand has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:17,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:17,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 18 [2025-03-04 02:28:17,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:17,873 INFO L124 PetriNetUnfolderBase]: 172/366 cut-off events. [2025-03-04 02:28:17,873 INFO L125 PetriNetUnfolderBase]: For 2400/2400 co-relation queries the response was YES. [2025-03-04 02:28:17,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2131 conditions, 366 events. 172/366 cut-off events. For 2400/2400 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1590 event pairs, 11 based on Foata normal form. 4/369 useless extension candidates. Maximal degree in co-relation 1908. Up to 121 conditions per place. [2025-03-04 02:28:17,876 INFO L140 encePairwiseOnDemand]: 13/18 looper letters, 74 selfloop transitions, 40 changer transitions 6/123 dead transitions. [2025-03-04 02:28:17,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 123 transitions, 1617 flow [2025-03-04 02:28:17,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:28:17,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:28:17,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2025-03-04 02:28:17,877 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5617283950617284 [2025-03-04 02:28:17,877 INFO L175 Difference]: Start difference. First operand has 84 places, 97 transitions, 1180 flow. Second operand 9 states and 91 transitions. [2025-03-04 02:28:17,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 123 transitions, 1617 flow [2025-03-04 02:28:17,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 123 transitions, 1531 flow, removed 25 selfloop flow, removed 3 redundant places. [2025-03-04 02:28:17,890 INFO L231 Difference]: Finished difference. Result has 90 places, 100 transitions, 1239 flow [2025-03-04 02:28:17,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=1071, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1239, PETRI_PLACES=90, PETRI_TRANSITIONS=100} [2025-03-04 02:28:17,891 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 70 predicate places. [2025-03-04 02:28:17,891 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 100 transitions, 1239 flow [2025-03-04 02:28:17,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:17,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:17,891 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:17,897 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-03-04 02:28:18,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:18,092 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:18,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:18,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1442805150, now seen corresponding path program 6 times [2025-03-04 02:28:18,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:18,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723305847] [2025-03-04 02:28:18,092 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:28:18,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:18,096 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:28:18,099 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:28:18,099 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:28:18,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:18,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:18,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:18,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723305847] [2025-03-04 02:28:18,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723305847] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:18,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796325861] [2025-03-04 02:28:18,134 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:28:18,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:18,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:18,136 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:18,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 02:28:18,163 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:28:18,171 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:28:18,171 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:28:18,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:18,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 02:28:18,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:18,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:18,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:18,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:18,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796325861] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:18,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:18,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2025-03-04 02:28:18,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474181494] [2025-03-04 02:28:18,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:18,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:28:18,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:18,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:28:18,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:28:18,276 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 18 [2025-03-04 02:28:18,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 100 transitions, 1239 flow. Second operand has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:18,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:18,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 18 [2025-03-04 02:28:18,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:18,398 INFO L124 PetriNetUnfolderBase]: 156/316 cut-off events. [2025-03-04 02:28:18,398 INFO L125 PetriNetUnfolderBase]: For 1771/1771 co-relation queries the response was YES. [2025-03-04 02:28:18,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1873 conditions, 316 events. 156/316 cut-off events. For 1771/1771 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1267 event pairs, 4 based on Foata normal form. 6/321 useless extension candidates. Maximal degree in co-relation 1693. Up to 144 conditions per place. [2025-03-04 02:28:18,401 INFO L140 encePairwiseOnDemand]: 12/18 looper letters, 72 selfloop transitions, 39 changer transitions 2/116 dead transitions. [2025-03-04 02:28:18,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 116 transitions, 1508 flow [2025-03-04 02:28:18,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:28:18,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:28:18,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 94 transitions. [2025-03-04 02:28:18,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5222222222222223 [2025-03-04 02:28:18,402 INFO L175 Difference]: Start difference. First operand has 90 places, 100 transitions, 1239 flow. Second operand 10 states and 94 transitions. [2025-03-04 02:28:18,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 116 transitions, 1508 flow [2025-03-04 02:28:18,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 116 transitions, 1420 flow, removed 21 selfloop flow, removed 5 redundant places. [2025-03-04 02:28:18,411 INFO L231 Difference]: Finished difference. Result has 95 places, 95 transitions, 1147 flow [2025-03-04 02:28:18,411 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=1089, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1147, PETRI_PLACES=95, PETRI_TRANSITIONS=95} [2025-03-04 02:28:18,412 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 75 predicate places. [2025-03-04 02:28:18,412 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 95 transitions, 1147 flow [2025-03-04 02:28:18,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:18,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:18,412 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:18,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 02:28:18,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 02:28:18,613 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:18,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:18,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1117916897, now seen corresponding path program 7 times [2025-03-04 02:28:18,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:18,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357315378] [2025-03-04 02:28:18,614 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:28:18,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:18,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:28:18,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:28:18,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:18,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:18,659 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:18,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:18,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357315378] [2025-03-04 02:28:18,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357315378] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:18,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028887860] [2025-03-04 02:28:18,660 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:28:18,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:18,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:18,661 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:18,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 02:28:18,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:28:18,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:28:18,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:18,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:18,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 02:28:18,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:18,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:18,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:18,769 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:18,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028887860] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:18,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:18,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 02:28:18,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100642337] [2025-03-04 02:28:18,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:18,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:28:18,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:18,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:28:18,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:28:18,770 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 18 [2025-03-04 02:28:18,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 95 transitions, 1147 flow. Second operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:18,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:18,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 18 [2025-03-04 02:28:18,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:18,882 INFO L124 PetriNetUnfolderBase]: 150/304 cut-off events. [2025-03-04 02:28:18,882 INFO L125 PetriNetUnfolderBase]: For 1601/1601 co-relation queries the response was YES. [2025-03-04 02:28:18,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1785 conditions, 304 events. 150/304 cut-off events. For 1601/1601 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1186 event pairs, 5 based on Foata normal form. 4/307 useless extension candidates. Maximal degree in co-relation 1603. Up to 107 conditions per place. [2025-03-04 02:28:18,885 INFO L140 encePairwiseOnDemand]: 13/18 looper letters, 72 selfloop transitions, 33 changer transitions 4/112 dead transitions. [2025-03-04 02:28:18,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 112 transitions, 1438 flow [2025-03-04 02:28:18,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:28:18,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:28:18,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 88 transitions. [2025-03-04 02:28:18,886 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5432098765432098 [2025-03-04 02:28:18,886 INFO L175 Difference]: Start difference. First operand has 95 places, 95 transitions, 1147 flow. Second operand 9 states and 88 transitions. [2025-03-04 02:28:18,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 112 transitions, 1438 flow [2025-03-04 02:28:18,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 112 transitions, 1332 flow, removed 13 selfloop flow, removed 6 redundant places. [2025-03-04 02:28:18,896 INFO L231 Difference]: Finished difference. Result has 99 places, 91 transitions, 1096 flow [2025-03-04 02:28:18,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1096, PETRI_PLACES=99, PETRI_TRANSITIONS=91} [2025-03-04 02:28:18,898 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 79 predicate places. [2025-03-04 02:28:18,899 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1096 flow [2025-03-04 02:28:18,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:18,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:18,899 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:18,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 02:28:19,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:19,100 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:19,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:19,100 INFO L85 PathProgramCache]: Analyzing trace with hash -19155735, now seen corresponding path program 8 times [2025-03-04 02:28:19,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:19,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384974312] [2025-03-04 02:28:19,100 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:19,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:19,104 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:28:19,108 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:28:19,108 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:19,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:19,208 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:19,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:19,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384974312] [2025-03-04 02:28:19,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384974312] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:19,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961495467] [2025-03-04 02:28:19,208 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:19,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:19,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:19,210 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:19,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 02:28:19,234 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:28:19,242 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:28:19,242 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:19,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:19,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:28:19,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:19,310 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:19,310 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:19,342 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:19,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961495467] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:19,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:19,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 4] total 14 [2025-03-04 02:28:19,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643783681] [2025-03-04 02:28:19,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:19,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 02:28:19,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:19,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 02:28:19,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:28:19,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 18 [2025-03-04 02:28:19,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1096 flow. Second operand has 15 states, 15 states have (on average 7.666666666666667) internal successors, (115), 15 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:19,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:19,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 18 [2025-03-04 02:28:19,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:19,523 INFO L124 PetriNetUnfolderBase]: 247/499 cut-off events. [2025-03-04 02:28:19,524 INFO L125 PetriNetUnfolderBase]: For 2970/2970 co-relation queries the response was YES. [2025-03-04 02:28:19,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2933 conditions, 499 events. 247/499 cut-off events. For 2970/2970 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2281 event pairs, 5 based on Foata normal form. 16/514 useless extension candidates. Maximal degree in co-relation 2797. Up to 233 conditions per place. [2025-03-04 02:28:19,527 INFO L140 encePairwiseOnDemand]: 13/18 looper letters, 109 selfloop transitions, 48 changer transitions 3/163 dead transitions. [2025-03-04 02:28:19,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 163 transitions, 2128 flow [2025-03-04 02:28:19,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:28:19,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:28:19,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2025-03-04 02:28:19,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6555555555555556 [2025-03-04 02:28:19,528 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1096 flow. Second operand 10 states and 118 transitions. [2025-03-04 02:28:19,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 163 transitions, 2128 flow [2025-03-04 02:28:19,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 163 transitions, 2055 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-03-04 02:28:19,541 INFO L231 Difference]: Finished difference. Result has 108 places, 124 transitions, 1636 flow [2025-03-04 02:28:19,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=1049, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1636, PETRI_PLACES=108, PETRI_TRANSITIONS=124} [2025-03-04 02:28:19,541 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 88 predicate places. [2025-03-04 02:28:19,541 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 124 transitions, 1636 flow [2025-03-04 02:28:19,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.666666666666667) internal successors, (115), 15 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:19,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:19,542 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:19,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 02:28:19,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 02:28:19,743 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:19,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:19,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1113936415, now seen corresponding path program 9 times [2025-03-04 02:28:19,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:19,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642725851] [2025-03-04 02:28:19,744 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:28:19,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:19,746 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:28:19,750 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:28:19,750 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:28:19,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:19,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:19,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:19,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642725851] [2025-03-04 02:28:19,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642725851] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:19,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169976112] [2025-03-04 02:28:19,829 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:28:19,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:19,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:19,831 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:19,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 02:28:19,854 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:28:19,862 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:28:19,862 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:28:19,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:19,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:28:19,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:19,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:19,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:19,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:19,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169976112] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:19,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:19,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 4] total 14 [2025-03-04 02:28:19,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537722529] [2025-03-04 02:28:19,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:19,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 02:28:19,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:19,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 02:28:19,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:28:19,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 18 [2025-03-04 02:28:19,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 124 transitions, 1636 flow. Second operand has 15 states, 15 states have (on average 7.6) internal successors, (114), 15 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:19,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:19,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 18 [2025-03-04 02:28:19,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:20,255 INFO L124 PetriNetUnfolderBase]: 369/733 cut-off events. [2025-03-04 02:28:20,255 INFO L125 PetriNetUnfolderBase]: For 5981/5981 co-relation queries the response was YES. [2025-03-04 02:28:20,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4848 conditions, 733 events. 369/733 cut-off events. For 5981/5981 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3761 event pairs, 2 based on Foata normal form. 34/766 useless extension candidates. Maximal degree in co-relation 4738. Up to 200 conditions per place. [2025-03-04 02:28:20,261 INFO L140 encePairwiseOnDemand]: 12/18 looper letters, 103 selfloop transitions, 104 changer transitions 30/240 dead transitions. [2025-03-04 02:28:20,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 240 transitions, 3377 flow [2025-03-04 02:28:20,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 02:28:20,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 02:28:20,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 209 transitions. [2025-03-04 02:28:20,263 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5805555555555556 [2025-03-04 02:28:20,263 INFO L175 Difference]: Start difference. First operand has 108 places, 124 transitions, 1636 flow. Second operand 20 states and 209 transitions. [2025-03-04 02:28:20,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 240 transitions, 3377 flow [2025-03-04 02:28:20,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 240 transitions, 3240 flow, removed 32 selfloop flow, removed 5 redundant places. [2025-03-04 02:28:20,298 INFO L231 Difference]: Finished difference. Result has 139 places, 167 transitions, 2532 flow [2025-03-04 02:28:20,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=1478, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2532, PETRI_PLACES=139, PETRI_TRANSITIONS=167} [2025-03-04 02:28:20,299 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 119 predicate places. [2025-03-04 02:28:20,299 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 167 transitions, 2532 flow [2025-03-04 02:28:20,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.6) internal successors, (114), 15 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:20,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:20,300 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:20,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 02:28:20,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 02:28:20,500 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:20,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:20,501 INFO L85 PathProgramCache]: Analyzing trace with hash 245762373, now seen corresponding path program 10 times [2025-03-04 02:28:20,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:20,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756146800] [2025-03-04 02:28:20,501 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:28:20,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:20,504 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:28:20,507 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:28:20,507 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:28:20,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:20,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:20,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:20,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756146800] [2025-03-04 02:28:20,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756146800] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:20,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813256872] [2025-03-04 02:28:20,592 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:28:20,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:20,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:20,594 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:20,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 02:28:20,615 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:28:20,624 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:28:20,624 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:28:20,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:20,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 02:28:20,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:20,720 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:20,720 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:20,875 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:20,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813256872] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:20,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:20,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 15 [2025-03-04 02:28:20,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163342993] [2025-03-04 02:28:20,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:20,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 02:28:20,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:20,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 02:28:20,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2025-03-04 02:28:20,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 18 [2025-03-04 02:28:20,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 167 transitions, 2532 flow. Second operand has 16 states, 16 states have (on average 7.4375) internal successors, (119), 16 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-03-04 02:28:20,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:20,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 18 [2025-03-04 02:28:20,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:21,219 INFO L124 PetriNetUnfolderBase]: 449/883 cut-off events. [2025-03-04 02:28:21,219 INFO L125 PetriNetUnfolderBase]: For 16894/16894 co-relation queries the response was YES. [2025-03-04 02:28:21,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6952 conditions, 883 events. 449/883 cut-off events. For 16894/16894 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4546 event pairs, 18 based on Foata normal form. 35/917 useless extension candidates. Maximal degree in co-relation 6776. Up to 475 conditions per place. [2025-03-04 02:28:21,226 INFO L140 encePairwiseOnDemand]: 12/18 looper letters, 166 selfloop transitions, 88 changer transitions 9/266 dead transitions. [2025-03-04 02:28:21,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 266 transitions, 4476 flow [2025-03-04 02:28:21,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 02:28:21,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 02:28:21,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 200 transitions. [2025-03-04 02:28:21,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-03-04 02:28:21,242 INFO L175 Difference]: Start difference. First operand has 139 places, 167 transitions, 2532 flow. Second operand 20 states and 200 transitions. [2025-03-04 02:28:21,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 266 transitions, 4476 flow [2025-03-04 02:28:21,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 266 transitions, 4090 flow, removed 191 selfloop flow, removed 4 redundant places. [2025-03-04 02:28:21,290 INFO L231 Difference]: Finished difference. Result has 164 places, 218 transitions, 3420 flow [2025-03-04 02:28:21,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=2248, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3420, PETRI_PLACES=164, PETRI_TRANSITIONS=218} [2025-03-04 02:28:21,291 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 144 predicate places. [2025-03-04 02:28:21,291 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 218 transitions, 3420 flow [2025-03-04 02:28:21,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.4375) internal successors, (119), 16 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-03-04 02:28:21,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:21,291 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:21,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 02:28:21,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 02:28:21,496 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:21,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:21,496 INFO L85 PathProgramCache]: Analyzing trace with hash -593061075, now seen corresponding path program 11 times [2025-03-04 02:28:21,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:21,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120367956] [2025-03-04 02:28:21,497 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:28:21,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:21,499 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:28:21,501 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:28:21,501 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:21,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:21,553 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:21,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:21,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120367956] [2025-03-04 02:28:21,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120367956] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:21,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451925112] [2025-03-04 02:28:21,554 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:28:21,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:21,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:21,556 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:21,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 02:28:21,579 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:28:21,589 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:28:21,590 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:21,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:21,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:28:21,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:21,638 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:21,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:21,693 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:21,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451925112] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:21,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:21,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-04 02:28:21,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789816398] [2025-03-04 02:28:21,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:21,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 02:28:21,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:21,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 02:28:21,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:28:21,694 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 18 [2025-03-04 02:28:21,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 218 transitions, 3420 flow. Second operand has 14 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:21,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:21,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 18 [2025-03-04 02:28:21,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:21,932 INFO L124 PetriNetUnfolderBase]: 477/953 cut-off events. [2025-03-04 02:28:21,933 INFO L125 PetriNetUnfolderBase]: For 23519/23519 co-relation queries the response was YES. [2025-03-04 02:28:21,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8006 conditions, 953 events. 477/953 cut-off events. For 23519/23519 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5068 event pairs, 9 based on Foata normal form. 30/982 useless extension candidates. Maximal degree in co-relation 7860. Up to 308 conditions per place. [2025-03-04 02:28:21,942 INFO L140 encePairwiseOnDemand]: 13/18 looper letters, 135 selfloop transitions, 142 changer transitions 21/301 dead transitions. [2025-03-04 02:28:21,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 301 transitions, 5565 flow [2025-03-04 02:28:21,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:28:21,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:28:21,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 123 transitions. [2025-03-04 02:28:21,943 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5694444444444444 [2025-03-04 02:28:21,943 INFO L175 Difference]: Start difference. First operand has 164 places, 218 transitions, 3420 flow. Second operand 12 states and 123 transitions. [2025-03-04 02:28:21,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 301 transitions, 5565 flow [2025-03-04 02:28:22,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 301 transitions, 4791 flow, removed 350 selfloop flow, removed 6 redundant places. [2025-03-04 02:28:22,017 INFO L231 Difference]: Finished difference. Result has 174 places, 252 transitions, 4261 flow [2025-03-04 02:28:22,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=2996, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4261, PETRI_PLACES=174, PETRI_TRANSITIONS=252} [2025-03-04 02:28:22,017 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 154 predicate places. [2025-03-04 02:28:22,017 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 252 transitions, 4261 flow [2025-03-04 02:28:22,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:22,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:22,018 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:22,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 02:28:22,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 02:28:22,218 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:22,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:22,219 INFO L85 PathProgramCache]: Analyzing trace with hash -207972259, now seen corresponding path program 12 times [2025-03-04 02:28:22,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:22,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065286688] [2025-03-04 02:28:22,219 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:28:22,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:22,222 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 3 equivalence classes. [2025-03-04 02:28:22,226 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:28:22,227 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:28:22,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:22,263 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:22,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:22,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065286688] [2025-03-04 02:28:22,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065286688] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:22,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619223863] [2025-03-04 02:28:22,264 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:28:22,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:22,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:22,266 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:22,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 02:28:22,296 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 3 equivalence classes. [2025-03-04 02:28:22,308 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:28:22,308 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:28:22,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:22,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:28:22,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:22,366 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:22,366 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:22,460 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:22,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619223863] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:22,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:22,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 14 [2025-03-04 02:28:22,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83797833] [2025-03-04 02:28:22,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:22,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 02:28:22,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:22,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 02:28:22,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:28:22,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 18 [2025-03-04 02:28:22,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 252 transitions, 4261 flow. Second operand has 15 states, 15 states have (on average 7.2) internal successors, (108), 15 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:22,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:22,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 18 [2025-03-04 02:28:22,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:22,793 INFO L124 PetriNetUnfolderBase]: 539/1076 cut-off events. [2025-03-04 02:28:22,794 INFO L125 PetriNetUnfolderBase]: For 28978/28978 co-relation queries the response was YES. [2025-03-04 02:28:22,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9247 conditions, 1076 events. 539/1076 cut-off events. For 28978/28978 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5851 event pairs, 12 based on Foata normal form. 6/1081 useless extension candidates. Maximal degree in co-relation 9071. Up to 339 conditions per place. [2025-03-04 02:28:22,804 INFO L140 encePairwiseOnDemand]: 12/18 looper letters, 135 selfloop transitions, 213 changer transitions 0/351 dead transitions. [2025-03-04 02:28:22,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 351 transitions, 6626 flow [2025-03-04 02:28:22,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 02:28:22,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 02:28:22,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 154 transitions. [2025-03-04 02:28:22,805 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5347222222222222 [2025-03-04 02:28:22,806 INFO L175 Difference]: Start difference. First operand has 174 places, 252 transitions, 4261 flow. Second operand 16 states and 154 transitions. [2025-03-04 02:28:22,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 351 transitions, 6626 flow [2025-03-04 02:28:22,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 351 transitions, 5972 flow, removed 325 selfloop flow, removed 2 redundant places. [2025-03-04 02:28:22,935 INFO L231 Difference]: Finished difference. Result has 194 places, 314 transitions, 5884 flow [2025-03-04 02:28:22,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=3907, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=156, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=5884, PETRI_PLACES=194, PETRI_TRANSITIONS=314} [2025-03-04 02:28:22,936 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 174 predicate places. [2025-03-04 02:28:22,936 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 314 transitions, 5884 flow [2025-03-04 02:28:22,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.2) internal successors, (108), 15 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:22,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:22,936 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:22,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 02:28:23,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:23,137 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:23,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:23,137 INFO L85 PathProgramCache]: Analyzing trace with hash -295089598, now seen corresponding path program 13 times [2025-03-04 02:28:23,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:23,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145625381] [2025-03-04 02:28:23,137 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:28:23,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:23,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:28:23,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:28:23,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:23,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:23,177 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:23,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:23,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145625381] [2025-03-04 02:28:23,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145625381] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:23,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870090513] [2025-03-04 02:28:23,178 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:28:23,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:23,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:23,180 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:23,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 02:28:23,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:28:23,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:28:23,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:23,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:23,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:28:23,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:23,259 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:23,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:23,312 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:23,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870090513] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:23,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:23,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 14 [2025-03-04 02:28:23,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352302598] [2025-03-04 02:28:23,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:23,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 02:28:23,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:23,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 02:28:23,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:28:23,314 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 18 [2025-03-04 02:28:23,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 314 transitions, 5884 flow. Second operand has 15 states, 15 states have (on average 7.2) internal successors, (108), 15 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:23,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:23,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 18 [2025-03-04 02:28:23,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:23,634 INFO L124 PetriNetUnfolderBase]: 568/1152 cut-off events. [2025-03-04 02:28:23,634 INFO L125 PetriNetUnfolderBase]: For 25580/25580 co-relation queries the response was YES. [2025-03-04 02:28:23,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10079 conditions, 1152 events. 568/1152 cut-off events. For 25580/25580 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 6515 event pairs, 25 based on Foata normal form. 8/1159 useless extension candidates. Maximal degree in co-relation 9893. Up to 438 conditions per place. [2025-03-04 02:28:23,648 INFO L140 encePairwiseOnDemand]: 13/18 looper letters, 231 selfloop transitions, 128 changer transitions 10/372 dead transitions. [2025-03-04 02:28:23,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 372 transitions, 7708 flow [2025-03-04 02:28:23,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 02:28:23,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 02:28:23,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 132 transitions. [2025-03-04 02:28:23,651 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2025-03-04 02:28:23,651 INFO L175 Difference]: Start difference. First operand has 194 places, 314 transitions, 5884 flow. Second operand 14 states and 132 transitions. [2025-03-04 02:28:23,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 372 transitions, 7708 flow [2025-03-04 02:28:23,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 372 transitions, 7204 flow, removed 236 selfloop flow, removed 4 redundant places. [2025-03-04 02:28:23,796 INFO L231 Difference]: Finished difference. Result has 208 places, 336 transitions, 6548 flow [2025-03-04 02:28:23,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=5541, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=6548, PETRI_PLACES=208, PETRI_TRANSITIONS=336} [2025-03-04 02:28:23,796 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 188 predicate places. [2025-03-04 02:28:23,797 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 336 transitions, 6548 flow [2025-03-04 02:28:23,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.2) internal successors, (108), 15 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:23,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:23,797 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:23,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 02:28:23,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 02:28:23,997 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:23,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:23,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1442547693, now seen corresponding path program 14 times [2025-03-04 02:28:23,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:23,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908786364] [2025-03-04 02:28:23,998 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:23,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:24,000 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:28:24,002 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:28:24,002 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:24,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:24,038 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:24,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:24,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908786364] [2025-03-04 02:28:24,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908786364] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:24,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095623570] [2025-03-04 02:28:24,039 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:24,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:24,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:24,041 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:24,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 02:28:24,063 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:28:24,071 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:28:24,071 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:24,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:24,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:28:24,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:24,130 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:24,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:24,187 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:24,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095623570] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:24,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:24,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 14 [2025-03-04 02:28:24,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823952077] [2025-03-04 02:28:24,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:24,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 02:28:24,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:24,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 02:28:24,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:28:24,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 18 [2025-03-04 02:28:24,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 336 transitions, 6548 flow. Second operand has 15 states, 15 states have (on average 7.2) internal successors, (108), 15 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:24,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:24,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 18 [2025-03-04 02:28:24,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:24,504 INFO L124 PetriNetUnfolderBase]: 571/1102 cut-off events. [2025-03-04 02:28:24,504 INFO L125 PetriNetUnfolderBase]: For 18991/18991 co-relation queries the response was YES. [2025-03-04 02:28:24,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9755 conditions, 1102 events. 571/1102 cut-off events. For 18991/18991 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5896 event pairs, 12 based on Foata normal form. 15/1116 useless extension candidates. Maximal degree in co-relation 9642. Up to 340 conditions per place. [2025-03-04 02:28:24,513 INFO L140 encePairwiseOnDemand]: 12/18 looper letters, 178 selfloop transitions, 180 changer transitions 10/371 dead transitions. [2025-03-04 02:28:24,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 371 transitions, 7635 flow [2025-03-04 02:28:24,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 02:28:24,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 02:28:24,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 151 transitions. [2025-03-04 02:28:24,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5243055555555556 [2025-03-04 02:28:24,515 INFO L175 Difference]: Start difference. First operand has 208 places, 336 transitions, 6548 flow. Second operand 16 states and 151 transitions. [2025-03-04 02:28:24,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 371 transitions, 7635 flow [2025-03-04 02:28:24,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 371 transitions, 7316 flow, removed 133 selfloop flow, removed 6 redundant places. [2025-03-04 02:28:24,627 INFO L231 Difference]: Finished difference. Result has 216 places, 331 transitions, 6438 flow [2025-03-04 02:28:24,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=6054, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=166, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=6438, PETRI_PLACES=216, PETRI_TRANSITIONS=331} [2025-03-04 02:28:24,628 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 196 predicate places. [2025-03-04 02:28:24,628 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 331 transitions, 6438 flow [2025-03-04 02:28:24,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.2) internal successors, (108), 15 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:24,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:24,628 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:24,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 02:28:24,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:24,829 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:24,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:24,829 INFO L85 PathProgramCache]: Analyzing trace with hash -110303554, now seen corresponding path program 15 times [2025-03-04 02:28:24,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:24,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505011314] [2025-03-04 02:28:24,829 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:28:24,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:24,832 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 3 equivalence classes. [2025-03-04 02:28:24,834 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 18 statements. [2025-03-04 02:28:24,834 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:28:24,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:24,869 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 02:28:24,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:24,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505011314] [2025-03-04 02:28:24,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505011314] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:24,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100974836] [2025-03-04 02:28:24,869 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:28:24,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:24,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:24,871 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:24,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 02:28:24,894 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 3 equivalence classes. [2025-03-04 02:28:24,901 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 18 statements. [2025-03-04 02:28:24,902 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:28:24,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:24,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:28:24,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:24,923 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 02:28:24,923 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:28:24,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100974836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:24,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:28:24,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-03-04 02:28:24,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527055227] [2025-03-04 02:28:24,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:24,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:28:24,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:24,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:28:24,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:28:24,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 18 [2025-03-04 02:28:24,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 331 transitions, 6438 flow. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:24,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:24,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 18 [2025-03-04 02:28:24,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:25,104 INFO L124 PetriNetUnfolderBase]: 555/1047 cut-off events. [2025-03-04 02:28:25,105 INFO L125 PetriNetUnfolderBase]: For 14157/14157 co-relation queries the response was YES. [2025-03-04 02:28:25,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9191 conditions, 1047 events. 555/1047 cut-off events. For 14157/14157 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5438 event pairs, 5 based on Foata normal form. 9/1055 useless extension candidates. Maximal degree in co-relation 9061. Up to 732 conditions per place. [2025-03-04 02:28:25,115 INFO L140 encePairwiseOnDemand]: 13/18 looper letters, 270 selfloop transitions, 13 changer transitions 55/341 dead transitions. [2025-03-04 02:28:25,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 341 transitions, 7166 flow [2025-03-04 02:28:25,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:28:25,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:28:25,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2025-03-04 02:28:25,116 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-03-04 02:28:25,117 INFO L175 Difference]: Start difference. First operand has 216 places, 331 transitions, 6438 flow. Second operand 6 states and 60 transitions. [2025-03-04 02:28:25,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 341 transitions, 7166 flow [2025-03-04 02:28:25,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 341 transitions, 6734 flow, removed 74 selfloop flow, removed 16 redundant places. [2025-03-04 02:28:25,198 INFO L231 Difference]: Finished difference. Result has 201 places, 280 transitions, 5081 flow [2025-03-04 02:28:25,198 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=5975, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5081, PETRI_PLACES=201, PETRI_TRANSITIONS=280} [2025-03-04 02:28:25,199 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 181 predicate places. [2025-03-04 02:28:25,199 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 280 transitions, 5081 flow [2025-03-04 02:28:25,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:25,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:25,199 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:25,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-04 02:28:25,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:25,400 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:25,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:25,400 INFO L85 PathProgramCache]: Analyzing trace with hash 455821888, now seen corresponding path program 16 times [2025-03-04 02:28:25,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:25,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708554308] [2025-03-04 02:28:25,401 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:28:25,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:25,403 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:28:25,405 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:28:25,405 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:28:25,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:25,444 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:25,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:25,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708554308] [2025-03-04 02:28:25,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708554308] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:25,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016796164] [2025-03-04 02:28:25,445 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:28:25,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:25,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:25,447 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:25,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 02:28:25,470 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:28:25,477 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:28:25,478 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:28:25,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:25,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:28:25,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:25,528 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:25,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:25,574 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:25,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016796164] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:25,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:25,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-04 02:28:25,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666192757] [2025-03-04 02:28:25,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:25,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 02:28:25,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:25,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 02:28:25,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:28:25,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 18 [2025-03-04 02:28:25,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 280 transitions, 5081 flow. Second operand has 14 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:25,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:25,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 18 [2025-03-04 02:28:25,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:25,749 INFO L124 PetriNetUnfolderBase]: 444/817 cut-off events. [2025-03-04 02:28:25,749 INFO L125 PetriNetUnfolderBase]: For 8069/8069 co-relation queries the response was YES. [2025-03-04 02:28:25,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6974 conditions, 817 events. 444/817 cut-off events. For 8069/8069 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3759 event pairs, 0 based on Foata normal form. 4/820 useless extension candidates. Maximal degree in co-relation 6909. Up to 480 conditions per place. [2025-03-04 02:28:25,756 INFO L140 encePairwiseOnDemand]: 13/18 looper letters, 198 selfloop transitions, 85 changer transitions 12/298 dead transitions. [2025-03-04 02:28:25,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 298 transitions, 5764 flow [2025-03-04 02:28:25,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:28:25,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:28:25,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 100 transitions. [2025-03-04 02:28:25,757 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5050505050505051 [2025-03-04 02:28:25,757 INFO L175 Difference]: Start difference. First operand has 201 places, 280 transitions, 5081 flow. Second operand 11 states and 100 transitions. [2025-03-04 02:28:25,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 298 transitions, 5764 flow [2025-03-04 02:28:25,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 298 transitions, 5250 flow, removed 66 selfloop flow, removed 20 redundant places. [2025-03-04 02:28:25,817 INFO L231 Difference]: Finished difference. Result has 180 places, 268 transitions, 4595 flow [2025-03-04 02:28:25,817 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=4570, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4595, PETRI_PLACES=180, PETRI_TRANSITIONS=268} [2025-03-04 02:28:25,817 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 160 predicate places. [2025-03-04 02:28:25,818 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 268 transitions, 4595 flow [2025-03-04 02:28:25,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:25,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:25,818 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:25,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-04 02:28:26,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:26,019 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:26,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:26,019 INFO L85 PathProgramCache]: Analyzing trace with hash 554943334, now seen corresponding path program 17 times [2025-03-04 02:28:26,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:26,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299535519] [2025-03-04 02:28:26,019 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:28:26,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:26,021 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 3 equivalence classes. [2025-03-04 02:28:26,023 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:26,023 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:28:26,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:26,058 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:28:26,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:26,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299535519] [2025-03-04 02:28:26,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299535519] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:26,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937627445] [2025-03-04 02:28:26,059 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:28:26,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:26,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:26,061 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:26,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 02:28:26,083 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 3 equivalence classes. [2025-03-04 02:28:26,092 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:26,093 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:28:26,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:26,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:28:26,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:26,120 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:28:26,120 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:28:26,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937627445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:26,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:28:26,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-03-04 02:28:26,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676444636] [2025-03-04 02:28:26,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:26,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:28:26,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:26,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:28:26,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:28:26,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 18 [2025-03-04 02:28:26,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 268 transitions, 4595 flow. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:26,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:26,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 18 [2025-03-04 02:28:26,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:26,226 INFO L124 PetriNetUnfolderBase]: 427/762 cut-off events. [2025-03-04 02:28:26,226 INFO L125 PetriNetUnfolderBase]: For 4915/4915 co-relation queries the response was YES. [2025-03-04 02:28:26,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6227 conditions, 762 events. 427/762 cut-off events. For 4915/4915 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3317 event pairs, 9 based on Foata normal form. 7/768 useless extension candidates. Maximal degree in co-relation 6173. Up to 437 conditions per place. [2025-03-04 02:28:26,230 INFO L140 encePairwiseOnDemand]: 13/18 looper letters, 0 selfloop transitions, 0 changer transitions 274/274 dead transitions. [2025-03-04 02:28:26,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 274 transitions, 5196 flow [2025-03-04 02:28:26,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:28:26,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:28:26,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2025-03-04 02:28:26,231 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2025-03-04 02:28:26,231 INFO L175 Difference]: Start difference. First operand has 180 places, 268 transitions, 4595 flow. Second operand 6 states and 52 transitions. [2025-03-04 02:28:26,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 274 transitions, 5196 flow [2025-03-04 02:28:26,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 274 transitions, 4956 flow, removed 8 selfloop flow, removed 10 redundant places. [2025-03-04 02:28:26,267 INFO L231 Difference]: Finished difference. Result has 172 places, 0 transitions, 0 flow [2025-03-04 02:28:26,267 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=4341, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=172, PETRI_TRANSITIONS=0} [2025-03-04 02:28:26,268 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 152 predicate places. [2025-03-04 02:28:26,268 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 0 transitions, 0 flow [2025-03-04 02:28:26,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-03-04 02:28:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-03-04 02:28:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-03-04 02:28:26,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-04 02:28:26,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:26,471 INFO L422 BasicCegarLoop]: Path program histogram: [17, 2, 2, 1] [2025-03-04 02:28:26,475 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 02:28:26,475 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 02:28:26,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:28:26 BasicIcfg [2025-03-04 02:28:26,479 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 02:28:26,480 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 02:28:26,480 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 02:28:26,480 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 02:28:26,481 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:28:13" (3/4) ... [2025-03-04 02:28:26,483 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 02:28:26,485 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 02:28:26,485 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 02:28:26,488 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2025-03-04 02:28:26,488 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-04 02:28:26,488 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-04 02:28:26,488 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 02:28:26,537 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 02:28:26,537 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 02:28:26,537 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 02:28:26,538 INFO L158 Benchmark]: Toolchain (without parser) took 13610.20ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 112.8MB in the beginning and 106.8MB in the end (delta: 5.9MB). Peak memory consumption was 82.8MB. Max. memory is 16.1GB. [2025-03-04 02:28:26,538 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:28:26,538 INFO L158 Benchmark]: CACSL2BoogieTranslator took 165.54ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 101.3MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:28:26,539 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.67ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 100.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:28:26,539 INFO L158 Benchmark]: Boogie Preprocessor took 24.87ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 99.0MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:28:26,539 INFO L158 Benchmark]: IcfgBuilder took 344.77ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 79.8MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 02:28:26,539 INFO L158 Benchmark]: TraceAbstraction took 12983.56ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 78.8MB in the beginning and 112.9MB in the end (delta: -34.0MB). Peak memory consumption was 108.0MB. Max. memory is 16.1GB. [2025-03-04 02:28:26,539 INFO L158 Benchmark]: Witness Printer took 57.75ms. Allocated memory is still 218.1MB. Free memory was 112.9MB in the beginning and 106.8MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:28:26,540 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.27ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 165.54ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 101.3MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.67ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 100.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.87ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 99.0MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 344.77ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 79.8MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12983.56ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 78.8MB in the beginning and 112.9MB in the end (delta: -34.0MB). Peak memory consumption was 108.0MB. Max. memory is 16.1GB. * Witness Printer took 57.75ms. Allocated memory is still 218.1MB. Free memory was 112.9MB in the beginning and 106.8MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 70]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 25 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.9s, OverallIterations: 22, TraceHistogramMax: 3, PathProgramHistogramMax: 17, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 814 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 814 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 277 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2696 IncrementalHoareTripleChecker+Invalid, 2973 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 277 mSolverCounterUnsat, 0 mSDtfsCounter, 2696 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 761 GetRequests, 470 SyntacticMatches, 14 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6548occurred in iteration=18, InterpolantAutomatonStates: 221, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 673 NumberOfCodeBlocks, 671 NumberOfCodeBlocksAsserted, 76 NumberOfCheckSat, 894 ConstructedInterpolants, 0 QuantifiedInterpolants, 3922 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1781 ConjunctsInSsa, 122 ConjunctsInUnsatCore, 58 InterpolantComputations, 7 PerfectInterpolantSequences, 145/263 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 02:28:26,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE