./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-bakery-2.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/parallel-bakery-2.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 4f539592bc69a174492e01050b581a78ee6bfd25c2e79dba974730b39e2fa54b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:20:18,041 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:20:18,097 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:20:18,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:20:18,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:20:18,126 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:20:18,127 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:20:18,128 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:20:18,128 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:20:18,128 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:20:18,129 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:20:18,129 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:20:18,129 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:20:18,129 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:20:18,130 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:20:18,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:20:18,130 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:20:18,130 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:20:18,130 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:20:18,130 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:20:18,130 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:20:18,130 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:20:18,130 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:20:18,130 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:20:18,131 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:20:18,131 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:20:18,131 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:20:18,131 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:20:18,131 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:20:18,131 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:20:18,131 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:20:18,131 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:20:18,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:20:18,132 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:20:18,132 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:20:18,132 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:20:18,132 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:20:18,132 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:20:18,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:20:18,132 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:20:18,132 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:20:18,132 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:20:18,132 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:20:18,132 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 -> 4f539592bc69a174492e01050b581a78ee6bfd25c2e79dba974730b39e2fa54b [2025-03-04 02:20:18,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:20:18,371 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:20:18,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:20:18,373 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:20:18,374 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:20:18,375 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-bakery-2.wvr.c [2025-03-04 02:20:19,568 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/532f8c676/0cad1b6553c24018a99ce5e866a1eb9b/FLAG3d573a98b [2025-03-04 02:20:19,847 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:20:19,848 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-bakery-2.wvr.c [2025-03-04 02:20:19,853 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/532f8c676/0cad1b6553c24018a99ce5e866a1eb9b/FLAG3d573a98b [2025-03-04 02:20:19,870 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/532f8c676/0cad1b6553c24018a99ce5e866a1eb9b [2025-03-04 02:20:19,872 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:20:19,873 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:20:19,874 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:20:19,874 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:20:19,878 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:20:19,879 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:20:19" (1/1) ... [2025-03-04 02:20:19,879 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d8f05fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:19, skipping insertion in model container [2025-03-04 02:20:19,879 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:20:19" (1/1) ... [2025-03-04 02:20:19,890 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:20:20,008 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/parallel-bakery-2.wvr.c[2556,2569] [2025-03-04 02:20:20,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:20:20,019 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:20:20,034 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/parallel-bakery-2.wvr.c[2556,2569] [2025-03-04 02:20:20,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:20:20,044 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:20:20,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:20 WrapperNode [2025-03-04 02:20:20,045 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:20:20,046 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:20:20,046 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:20:20,046 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:20:20,050 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:20:20" (1/1) ... [2025-03-04 02:20:20,054 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:20:20" (1/1) ... [2025-03-04 02:20:20,067 INFO L138 Inliner]: procedures = 18, calls = 14, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2025-03-04 02:20:20,068 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:20:20,069 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:20:20,069 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:20:20,069 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:20:20,075 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:20" (1/1) ... [2025-03-04 02:20:20,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:20" (1/1) ... [2025-03-04 02:20:20,076 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:20" (1/1) ... [2025-03-04 02:20:20,092 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:20:20,092 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:20" (1/1) ... [2025-03-04 02:20:20,092 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:20" (1/1) ... [2025-03-04 02:20:20,095 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:20" (1/1) ... [2025-03-04 02:20:20,096 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:20" (1/1) ... [2025-03-04 02:20:20,097 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:20" (1/1) ... [2025-03-04 02:20:20,098 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:20" (1/1) ... [2025-03-04 02:20:20,098 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:20:20,099 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:20:20,099 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:20:20,099 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:20:20,100 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:20" (1/1) ... [2025-03-04 02:20:20,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:20:20,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:20,125 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:20:20,127 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:20:20,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:20:20,146 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:20:20,146 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:20:20,146 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:20:20,146 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:20:20,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:20:20,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:20:20,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:20:20,148 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:20:20,207 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:20:20,209 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:20:20,434 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:20:20,435 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:20:20,548 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:20:20,548 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:20:20,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:20:20 BoogieIcfgContainer [2025-03-04 02:20:20,549 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:20:20,550 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:20:20,551 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:20:20,554 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:20:20,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:20:19" (1/3) ... [2025-03-04 02:20:20,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56a4a89c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:20:20, skipping insertion in model container [2025-03-04 02:20:20,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:20" (2/3) ... [2025-03-04 02:20:20,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56a4a89c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:20:20, skipping insertion in model container [2025-03-04 02:20:20,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:20:20" (3/3) ... [2025-03-04 02:20:20,557 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-bakery-2.wvr.c [2025-03-04 02:20:20,569 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:20:20,571 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-bakery-2.wvr.c that has 3 procedures, 53 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-04 02:20:20,572 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:20:20,620 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 02:20:20,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 54 transitions, 122 flow [2025-03-04 02:20:20,680 INFO L124 PetriNetUnfolderBase]: 2/52 cut-off events. [2025-03-04 02:20:20,683 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:20:20,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 52 events. 2/52 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-03-04 02:20:20,688 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 54 transitions, 122 flow [2025-03-04 02:20:20,691 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 51 transitions, 114 flow [2025-03-04 02:20:20,698 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:20:20,710 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;@61f7a139, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:20:20,710 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-04 02:20:20,727 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:20:20,727 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events. [2025-03-04 02:20:20,727 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:20:20,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:20,728 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:20,729 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:20:20,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:20,735 INFO L85 PathProgramCache]: Analyzing trace with hash 536100910, now seen corresponding path program 1 times [2025-03-04 02:20:20,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:20,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17285167] [2025-03-04 02:20:20,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:20,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:20,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 02:20:20,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 02:20:20,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:20,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:21,222 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:20:21,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:21,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17285167] [2025-03-04 02:20:21,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17285167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:21,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:21,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:20:21,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453718627] [2025-03-04 02:20:21,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:21,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:20:21,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:21,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:20:21,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:20:21,248 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2025-03-04 02:20:21,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 114 flow. Second operand has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 0 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:20:21,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:21,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2025-03-04 02:20:21,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:21,637 INFO L124 PetriNetUnfolderBase]: 441/859 cut-off events. [2025-03-04 02:20:21,638 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-03-04 02:20:21,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1710 conditions, 859 events. 441/859 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3815 event pairs, 149 based on Foata normal form. 1/833 useless extension candidates. Maximal degree in co-relation 1552. Up to 274 conditions per place. [2025-03-04 02:20:21,646 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 70 selfloop transitions, 10 changer transitions 21/110 dead transitions. [2025-03-04 02:20:21,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 110 transitions, 461 flow [2025-03-04 02:20:21,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:20:21,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:20:21,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 190 transitions. [2025-03-04 02:20:21,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4398148148148148 [2025-03-04 02:20:21,660 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 114 flow. Second operand 8 states and 190 transitions. [2025-03-04 02:20:21,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 110 transitions, 461 flow [2025-03-04 02:20:21,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 110 transitions, 435 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 02:20:21,672 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 150 flow [2025-03-04 02:20:21,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=150, PETRI_PLACES=62, PETRI_TRANSITIONS=56} [2025-03-04 02:20:21,676 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 6 predicate places. [2025-03-04 02:20:21,677 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 150 flow [2025-03-04 02:20:21,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 0 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:20:21,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:21,678 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:21,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:20:21,679 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:20:21,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:21,680 INFO L85 PathProgramCache]: Analyzing trace with hash -802854162, now seen corresponding path program 2 times [2025-03-04 02:20:21,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:21,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503008294] [2025-03-04 02:20:21,680 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:21,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:21,707 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 1 equivalence classes. [2025-03-04 02:20:21,719 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 02:20:21,720 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:20:21,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:21,824 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:20:21,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:21,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503008294] [2025-03-04 02:20:21,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503008294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:21,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:21,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:20:21,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595829356] [2025-03-04 02:20:21,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:21,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:20:21,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:21,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:20:21,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:20:21,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-03-04 02:20:21,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 150 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:21,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:21,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-03-04 02:20:21,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:22,084 INFO L124 PetriNetUnfolderBase]: 722/1316 cut-off events. [2025-03-04 02:20:22,085 INFO L125 PetriNetUnfolderBase]: For 98/98 co-relation queries the response was YES. [2025-03-04 02:20:22,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2853 conditions, 1316 events. 722/1316 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 6059 event pairs, 120 based on Foata normal form. 0/1275 useless extension candidates. Maximal degree in co-relation 2835. Up to 814 conditions per place. [2025-03-04 02:20:22,102 INFO L140 encePairwiseOnDemand]: 42/54 looper letters, 89 selfloop transitions, 18 changer transitions 9/122 dead transitions. [2025-03-04 02:20:22,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 122 transitions, 558 flow [2025-03-04 02:20:22,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:20:22,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:20:22,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions. [2025-03-04 02:20:22,106 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43386243386243384 [2025-03-04 02:20:22,106 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 150 flow. Second operand 7 states and 164 transitions. [2025-03-04 02:20:22,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 122 transitions, 558 flow [2025-03-04 02:20:22,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 122 transitions, 556 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 02:20:22,110 INFO L231 Difference]: Finished difference. Result has 70 places, 70 transitions, 261 flow [2025-03-04 02:20:22,110 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=261, PETRI_PLACES=70, PETRI_TRANSITIONS=70} [2025-03-04 02:20:22,111 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 14 predicate places. [2025-03-04 02:20:22,111 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 70 transitions, 261 flow [2025-03-04 02:20:22,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:22,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:22,111 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:22,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:20:22,111 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:20:22,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:22,112 INFO L85 PathProgramCache]: Analyzing trace with hash 879340076, now seen corresponding path program 3 times [2025-03-04 02:20:22,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:22,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873077828] [2025-03-04 02:20:22,112 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:20:22,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:22,124 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 1 equivalence classes. [2025-03-04 02:20:22,135 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 02:20:22,135 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:20:22,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:22,187 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:20:22,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:22,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873077828] [2025-03-04 02:20:22,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873077828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:22,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:22,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:20:22,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240274115] [2025-03-04 02:20:22,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:22,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:20:22,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:22,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:20:22,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:20:22,190 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2025-03-04 02:20:22,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 70 transitions, 261 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 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:20:22,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:22,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2025-03-04 02:20:22,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:22,324 INFO L124 PetriNetUnfolderBase]: 536/1092 cut-off events. [2025-03-04 02:20:22,325 INFO L125 PetriNetUnfolderBase]: For 503/505 co-relation queries the response was YES. [2025-03-04 02:20:22,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2869 conditions, 1092 events. 536/1092 cut-off events. For 503/505 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5396 event pairs, 334 based on Foata normal form. 10/1093 useless extension candidates. Maximal degree in co-relation 1287. Up to 753 conditions per place. [2025-03-04 02:20:22,334 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 64 selfloop transitions, 2 changer transitions 4/83 dead transitions. [2025-03-04 02:20:22,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 83 transitions, 453 flow [2025-03-04 02:20:22,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:20:22,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:20:22,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-03-04 02:20:22,336 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2025-03-04 02:20:22,336 INFO L175 Difference]: Start difference. First operand has 70 places, 70 transitions, 261 flow. Second operand 3 states and 87 transitions. [2025-03-04 02:20:22,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 83 transitions, 453 flow [2025-03-04 02:20:22,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 83 transitions, 448 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 02:20:22,342 INFO L231 Difference]: Finished difference. Result has 72 places, 70 transitions, 264 flow [2025-03-04 02:20:22,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=72, PETRI_TRANSITIONS=70} [2025-03-04 02:20:22,343 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 16 predicate places. [2025-03-04 02:20:22,343 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 70 transitions, 264 flow [2025-03-04 02:20:22,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 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:20:22,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:22,343 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:22,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:20:22,344 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:20:22,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:22,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1944676580, now seen corresponding path program 4 times [2025-03-04 02:20:22,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:22,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718111425] [2025-03-04 02:20:22,344 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:20:22,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:22,353 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-03-04 02:20:22,357 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 36 of 47 statements. [2025-03-04 02:20:22,357 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:20:22,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:22,429 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:20:22,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:22,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718111425] [2025-03-04 02:20:22,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718111425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:22,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:22,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:20:22,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772318082] [2025-03-04 02:20:22,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:22,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:20:22,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:22,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:20:22,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:20:22,443 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 54 [2025-03-04 02:20:22,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 70 transitions, 264 flow. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:22,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:22,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 54 [2025-03-04 02:20:22,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:22,913 INFO L124 PetriNetUnfolderBase]: 1158/2176 cut-off events. [2025-03-04 02:20:22,913 INFO L125 PetriNetUnfolderBase]: For 1119/1119 co-relation queries the response was YES. [2025-03-04 02:20:22,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5975 conditions, 2176 events. 1158/2176 cut-off events. For 1119/1119 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 11697 event pairs, 108 based on Foata normal form. 0/2148 useless extension candidates. Maximal degree in co-relation 2382. Up to 818 conditions per place. [2025-03-04 02:20:22,922 INFO L140 encePairwiseOnDemand]: 38/54 looper letters, 144 selfloop transitions, 45 changer transitions 7/203 dead transitions. [2025-03-04 02:20:22,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 203 transitions, 1169 flow [2025-03-04 02:20:22,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:20:22,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:20:22,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 214 transitions. [2025-03-04 02:20:22,923 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3962962962962963 [2025-03-04 02:20:22,923 INFO L175 Difference]: Start difference. First operand has 72 places, 70 transitions, 264 flow. Second operand 10 states and 214 transitions. [2025-03-04 02:20:22,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 203 transitions, 1169 flow [2025-03-04 02:20:22,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 203 transitions, 1155 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:20:22,934 INFO L231 Difference]: Finished difference. Result has 85 places, 105 transitions, 608 flow [2025-03-04 02:20:22,934 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=608, PETRI_PLACES=85, PETRI_TRANSITIONS=105} [2025-03-04 02:20:22,934 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 29 predicate places. [2025-03-04 02:20:22,934 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 105 transitions, 608 flow [2025-03-04 02:20:22,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:22,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:22,934 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:22,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:20:22,935 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:20:22,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:22,935 INFO L85 PathProgramCache]: Analyzing trace with hash 2050864592, now seen corresponding path program 5 times [2025-03-04 02:20:22,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:22,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948773193] [2025-03-04 02:20:22,935 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:20:22,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:22,941 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 1 equivalence classes. [2025-03-04 02:20:22,947 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 02:20:22,947 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:20:22,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:22,997 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:20:22,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:22,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948773193] [2025-03-04 02:20:22,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948773193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:22,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:22,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:20:22,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904469450] [2025-03-04 02:20:22,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:22,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:20:22,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:22,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:20:22,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:20:22,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2025-03-04 02:20:22,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 105 transitions, 608 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 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:20:22,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:22,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2025-03-04 02:20:22,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:23,190 INFO L124 PetriNetUnfolderBase]: 862/1735 cut-off events. [2025-03-04 02:20:23,190 INFO L125 PetriNetUnfolderBase]: For 2669/2707 co-relation queries the response was YES. [2025-03-04 02:20:23,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5598 conditions, 1735 events. 862/1735 cut-off events. For 2669/2707 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 9483 event pairs, 482 based on Foata normal form. 26/1743 useless extension candidates. Maximal degree in co-relation 3385. Up to 1255 conditions per place. [2025-03-04 02:20:23,197 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 100 selfloop transitions, 2 changer transitions 1/125 dead transitions. [2025-03-04 02:20:23,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 125 transitions, 914 flow [2025-03-04 02:20:23,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:20:23,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:20:23,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2025-03-04 02:20:23,197 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5432098765432098 [2025-03-04 02:20:23,198 INFO L175 Difference]: Start difference. First operand has 85 places, 105 transitions, 608 flow. Second operand 3 states and 88 transitions. [2025-03-04 02:20:23,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 125 transitions, 914 flow [2025-03-04 02:20:23,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 125 transitions, 864 flow, removed 25 selfloop flow, removed 0 redundant places. [2025-03-04 02:20:23,206 INFO L231 Difference]: Finished difference. Result has 88 places, 103 transitions, 558 flow [2025-03-04 02:20:23,206 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=558, PETRI_PLACES=88, PETRI_TRANSITIONS=103} [2025-03-04 02:20:23,207 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 32 predicate places. [2025-03-04 02:20:23,207 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 103 transitions, 558 flow [2025-03-04 02:20:23,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 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:20:23,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:23,207 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:23,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:20:23,207 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:20:23,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:23,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1234153840, now seen corresponding path program 6 times [2025-03-04 02:20:23,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:23,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756439737] [2025-03-04 02:20:23,208 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:20:23,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:23,217 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 47 statements into 1 equivalence classes. [2025-03-04 02:20:23,222 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 02:20:23,222 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:20:23,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:23,320 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:20:23,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:23,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756439737] [2025-03-04 02:20:23,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756439737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:23,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:23,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:20:23,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783269007] [2025-03-04 02:20:23,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:23,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:20:23,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:23,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:20:23,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:20:23,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2025-03-04 02:20:23,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 103 transitions, 558 flow. Second operand has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 0 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:20:23,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:23,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2025-03-04 02:20:23,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:23,623 INFO L124 PetriNetUnfolderBase]: 857/1686 cut-off events. [2025-03-04 02:20:23,626 INFO L125 PetriNetUnfolderBase]: For 2122/2146 co-relation queries the response was YES. [2025-03-04 02:20:23,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5403 conditions, 1686 events. 857/1686 cut-off events. For 2122/2146 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 9126 event pairs, 259 based on Foata normal form. 9/1664 useless extension candidates. Maximal degree in co-relation 5112. Up to 556 conditions per place. [2025-03-04 02:20:23,633 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 97 selfloop transitions, 9 changer transitions 63/189 dead transitions. [2025-03-04 02:20:23,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 189 transitions, 1367 flow [2025-03-04 02:20:23,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:20:23,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:20:23,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 181 transitions. [2025-03-04 02:20:23,634 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41898148148148145 [2025-03-04 02:20:23,634 INFO L175 Difference]: Start difference. First operand has 88 places, 103 transitions, 558 flow. Second operand 8 states and 181 transitions. [2025-03-04 02:20:23,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 189 transitions, 1367 flow [2025-03-04 02:20:23,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 189 transitions, 1355 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:20:23,644 INFO L231 Difference]: Finished difference. Result has 94 places, 97 transitions, 545 flow [2025-03-04 02:20:23,644 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=545, PETRI_PLACES=94, PETRI_TRANSITIONS=97} [2025-03-04 02:20:23,646 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 38 predicate places. [2025-03-04 02:20:23,646 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 97 transitions, 545 flow [2025-03-04 02:20:23,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 0 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:20:23,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:23,647 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:23,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:20:23,647 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:20:23,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:23,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1067906654, now seen corresponding path program 7 times [2025-03-04 02:20:23,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:23,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080611783] [2025-03-04 02:20:23,648 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:20:23,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:23,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 02:20:23,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 02:20:23,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:23,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:23,774 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:20:23,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:23,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080611783] [2025-03-04 02:20:23,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080611783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:23,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:23,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:20:23,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540577568] [2025-03-04 02:20:23,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:23,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:20:23,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:23,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:20:23,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:20:23,798 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2025-03-04 02:20:23,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 97 transitions, 545 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:23,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:23,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2025-03-04 02:20:23,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:23,984 INFO L124 PetriNetUnfolderBase]: 558/1188 cut-off events. [2025-03-04 02:20:23,984 INFO L125 PetriNetUnfolderBase]: For 1430/1438 co-relation queries the response was YES. [2025-03-04 02:20:23,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3786 conditions, 1188 events. 558/1188 cut-off events. For 1430/1438 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 6104 event pairs, 111 based on Foata normal form. 6/1168 useless extension candidates. Maximal degree in co-relation 3758. Up to 897 conditions per place. [2025-03-04 02:20:23,991 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 78 selfloop transitions, 13 changer transitions 6/117 dead transitions. [2025-03-04 02:20:23,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 117 transitions, 811 flow [2025-03-04 02:20:23,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:20:23,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:20:23,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2025-03-04 02:20:23,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45185185185185184 [2025-03-04 02:20:23,992 INFO L175 Difference]: Start difference. First operand has 94 places, 97 transitions, 545 flow. Second operand 5 states and 122 transitions. [2025-03-04 02:20:23,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 117 transitions, 811 flow [2025-03-04 02:20:23,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 117 transitions, 765 flow, removed 8 selfloop flow, removed 10 redundant places. [2025-03-04 02:20:23,999 INFO L231 Difference]: Finished difference. Result has 88 places, 98 transitions, 545 flow [2025-03-04 02:20:23,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=545, PETRI_PLACES=88, PETRI_TRANSITIONS=98} [2025-03-04 02:20:24,000 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 32 predicate places. [2025-03-04 02:20:24,000 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 98 transitions, 545 flow [2025-03-04 02:20:24,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:24,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:24,000 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:24,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:20:24,000 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:20:24,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:24,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1078636822, now seen corresponding path program 8 times [2025-03-04 02:20:24,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:24,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184563705] [2025-03-04 02:20:24,001 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:24,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:24,006 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 1 equivalence classes. [2025-03-04 02:20:24,012 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 02:20:24,013 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:20:24,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:24,125 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:20:24,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:24,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184563705] [2025-03-04 02:20:24,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184563705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:24,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:24,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:20:24,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890718504] [2025-03-04 02:20:24,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:24,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:20:24,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:24,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:20:24,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:20:24,147 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2025-03-04 02:20:24,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 98 transitions, 545 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:24,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:24,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2025-03-04 02:20:24,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:24,318 INFO L124 PetriNetUnfolderBase]: 518/1110 cut-off events. [2025-03-04 02:20:24,318 INFO L125 PetriNetUnfolderBase]: For 1289/1297 co-relation queries the response was YES. [2025-03-04 02:20:24,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3362 conditions, 1110 events. 518/1110 cut-off events. For 1289/1297 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5597 event pairs, 109 based on Foata normal form. 6/1090 useless extension candidates. Maximal degree in co-relation 3171. Up to 809 conditions per place. [2025-03-04 02:20:24,324 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 76 selfloop transitions, 14 changer transitions 6/116 dead transitions. [2025-03-04 02:20:24,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 116 transitions, 781 flow [2025-03-04 02:20:24,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:20:24,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:20:24,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2025-03-04 02:20:24,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45925925925925926 [2025-03-04 02:20:24,329 INFO L175 Difference]: Start difference. First operand has 88 places, 98 transitions, 545 flow. Second operand 5 states and 124 transitions. [2025-03-04 02:20:24,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 116 transitions, 781 flow [2025-03-04 02:20:24,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 116 transitions, 762 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-04 02:20:24,335 INFO L231 Difference]: Finished difference. Result has 90 places, 95 transitions, 536 flow [2025-03-04 02:20:24,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=536, PETRI_PLACES=90, PETRI_TRANSITIONS=95} [2025-03-04 02:20:24,336 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 34 predicate places. [2025-03-04 02:20:24,337 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 95 transitions, 536 flow [2025-03-04 02:20:24,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:24,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:24,337 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:24,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:20:24,337 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:20:24,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:24,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1147917703, now seen corresponding path program 1 times [2025-03-04 02:20:24,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:24,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247627243] [2025-03-04 02:20:24,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:24,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:24,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 02:20:24,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 02:20:24,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:24,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:24,412 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:20:24,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:24,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247627243] [2025-03-04 02:20:24,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247627243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:24,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:24,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:20:24,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587013197] [2025-03-04 02:20:24,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:24,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:20:24,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:24,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:20:24,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:20:24,421 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-03-04 02:20:24,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 95 transitions, 536 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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:20:24,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:24,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-03-04 02:20:24,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:24,602 INFO L124 PetriNetUnfolderBase]: 501/1045 cut-off events. [2025-03-04 02:20:24,604 INFO L125 PetriNetUnfolderBase]: For 1215/1229 co-relation queries the response was YES. [2025-03-04 02:20:24,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3121 conditions, 1045 events. 501/1045 cut-off events. For 1215/1229 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4892 event pairs, 89 based on Foata normal form. 24/1061 useless extension candidates. Maximal degree in co-relation 2868. Up to 545 conditions per place. [2025-03-04 02:20:24,609 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 86 selfloop transitions, 17 changer transitions 1/113 dead transitions. [2025-03-04 02:20:24,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 113 transitions, 784 flow [2025-03-04 02:20:24,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:20:24,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:20:24,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2025-03-04 02:20:24,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42962962962962964 [2025-03-04 02:20:24,611 INFO L175 Difference]: Start difference. First operand has 90 places, 95 transitions, 536 flow. Second operand 5 states and 116 transitions. [2025-03-04 02:20:24,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 113 transitions, 784 flow [2025-03-04 02:20:24,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 113 transitions, 732 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-03-04 02:20:24,617 INFO L231 Difference]: Finished difference. Result has 89 places, 88 transitions, 506 flow [2025-03-04 02:20:24,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=506, PETRI_PLACES=89, PETRI_TRANSITIONS=88} [2025-03-04 02:20:24,618 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 33 predicate places. [2025-03-04 02:20:24,618 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 88 transitions, 506 flow [2025-03-04 02:20:24,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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:20:24,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:24,619 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:24,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:20:24,619 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:20:24,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:24,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1361046205, now seen corresponding path program 1 times [2025-03-04 02:20:24,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:24,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599805872] [2025-03-04 02:20:24,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:24,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:24,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 02:20:24,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 02:20:24,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:24,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:24,730 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:20:24,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:24,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599805872] [2025-03-04 02:20:24,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599805872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:24,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:24,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:20:24,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702992647] [2025-03-04 02:20:24,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:24,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:20:24,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:24,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:20:24,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:20:24,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-03-04 02:20:24,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 88 transitions, 506 flow. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 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:20:24,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:24,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-03-04 02:20:24,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:24,970 INFO L124 PetriNetUnfolderBase]: 449/957 cut-off events. [2025-03-04 02:20:24,970 INFO L125 PetriNetUnfolderBase]: For 1314/1328 co-relation queries the response was YES. [2025-03-04 02:20:24,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2939 conditions, 957 events. 449/957 cut-off events. For 1314/1328 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4490 event pairs, 145 based on Foata normal form. 12/958 useless extension candidates. Maximal degree in co-relation 1651. Up to 331 conditions per place. [2025-03-04 02:20:24,976 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 73 selfloop transitions, 16 changer transitions 20/120 dead transitions. [2025-03-04 02:20:24,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 120 transitions, 830 flow [2025-03-04 02:20:24,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:20:24,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:20:24,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2025-03-04 02:20:24,978 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2025-03-04 02:20:24,978 INFO L175 Difference]: Start difference. First operand has 89 places, 88 transitions, 506 flow. Second operand 7 states and 147 transitions. [2025-03-04 02:20:24,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 120 transitions, 830 flow [2025-03-04 02:20:24,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 120 transitions, 820 flow, removed 5 selfloop flow, removed 0 redundant places. [2025-03-04 02:20:24,985 INFO L231 Difference]: Finished difference. Result has 97 places, 78 transitions, 460 flow [2025-03-04 02:20:24,985 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=460, PETRI_PLACES=97, PETRI_TRANSITIONS=78} [2025-03-04 02:20:24,985 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 41 predicate places. [2025-03-04 02:20:24,985 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 78 transitions, 460 flow [2025-03-04 02:20:24,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 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:20:24,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:24,986 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:24,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:20:24,986 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:20:24,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:24,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1612802183, now seen corresponding path program 2 times [2025-03-04 02:20:24,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:24,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130355591] [2025-03-04 02:20:24,987 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:24,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:24,992 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 1 equivalence classes. [2025-03-04 02:20:24,996 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 02:20:24,996 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:20:24,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:25,030 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:20:25,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:25,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130355591] [2025-03-04 02:20:25,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130355591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:25,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:25,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:20:25,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615316790] [2025-03-04 02:20:25,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:25,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:20:25,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:25,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:20:25,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:20:25,037 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-03-04 02:20:25,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 78 transitions, 460 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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:20:25,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:25,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-03-04 02:20:25,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:25,149 INFO L124 PetriNetUnfolderBase]: 212/469 cut-off events. [2025-03-04 02:20:25,150 INFO L125 PetriNetUnfolderBase]: For 644/648 co-relation queries the response was YES. [2025-03-04 02:20:25,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1383 conditions, 469 events. 212/469 cut-off events. For 644/648 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1602 event pairs, 48 based on Foata normal form. 12/477 useless extension candidates. Maximal degree in co-relation 1361. Up to 188 conditions per place. [2025-03-04 02:20:25,152 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 59 selfloop transitions, 7 changer transitions 2/75 dead transitions. [2025-03-04 02:20:25,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 75 transitions, 475 flow [2025-03-04 02:20:25,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:20:25,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:20:25,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2025-03-04 02:20:25,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3851851851851852 [2025-03-04 02:20:25,153 INFO L175 Difference]: Start difference. First operand has 97 places, 78 transitions, 460 flow. Second operand 5 states and 104 transitions. [2025-03-04 02:20:25,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 75 transitions, 475 flow [2025-03-04 02:20:25,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 75 transitions, 393 flow, removed 9 selfloop flow, removed 19 redundant places. [2025-03-04 02:20:25,155 INFO L231 Difference]: Finished difference. Result has 76 places, 56 transitions, 211 flow [2025-03-04 02:20:25,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=211, PETRI_PLACES=76, PETRI_TRANSITIONS=56} [2025-03-04 02:20:25,156 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 20 predicate places. [2025-03-04 02:20:25,156 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 56 transitions, 211 flow [2025-03-04 02:20:25,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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:20:25,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:25,156 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:25,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 02:20:25,156 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:20:25,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:25,157 INFO L85 PathProgramCache]: Analyzing trace with hash 454587439, now seen corresponding path program 2 times [2025-03-04 02:20:25,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:25,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223649015] [2025-03-04 02:20:25,157 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:25,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:25,162 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 1 equivalence classes. [2025-03-04 02:20:25,166 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 02:20:25,166 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:20:25,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:25,248 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:20:25,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:25,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223649015] [2025-03-04 02:20:25,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223649015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:25,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:25,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:20:25,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021576458] [2025-03-04 02:20:25,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:25,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:20:25,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:25,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:20:25,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:20:25,275 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-03-04 02:20:25,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 56 transitions, 211 flow. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 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:20:25,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:25,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-03-04 02:20:25,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:25,400 INFO L124 PetriNetUnfolderBase]: 106/263 cut-off events. [2025-03-04 02:20:25,400 INFO L125 PetriNetUnfolderBase]: For 150/150 co-relation queries the response was YES. [2025-03-04 02:20:25,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 677 conditions, 263 events. 106/263 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 862 event pairs, 40 based on Foata normal form. 10/273 useless extension candidates. Maximal degree in co-relation 668. Up to 86 conditions per place. [2025-03-04 02:20:25,400 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 0 selfloop transitions, 0 changer transitions 51/51 dead transitions. [2025-03-04 02:20:25,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 51 transitions, 269 flow [2025-03-04 02:20:25,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:20:25,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:20:25,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2025-03-04 02:20:25,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2751322751322751 [2025-03-04 02:20:25,401 INFO L175 Difference]: Start difference. First operand has 76 places, 56 transitions, 211 flow. Second operand 7 states and 104 transitions. [2025-03-04 02:20:25,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 51 transitions, 269 flow [2025-03-04 02:20:25,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 51 transitions, 242 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 02:20:25,402 INFO L231 Difference]: Finished difference. Result has 58 places, 0 transitions, 0 flow [2025-03-04 02:20:25,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=58, PETRI_TRANSITIONS=0} [2025-03-04 02:20:25,403 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 2 predicate places. [2025-03-04 02:20:25,403 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 0 transitions, 0 flow [2025-03-04 02:20:25,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 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:20:25,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-03-04 02:20:25,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-03-04 02:20:25,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-03-04 02:20:25,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 02:20:25,407 INFO L422 BasicCegarLoop]: Path program histogram: [8, 2, 2] [2025-03-04 02:20:25,409 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 02:20:25,409 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 02:20:25,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:20:25 BasicIcfg [2025-03-04 02:20:25,415 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 02:20:25,416 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 02:20:25,416 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 02:20:25,416 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 02:20:25,417 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:20:20" (3/4) ... [2025-03-04 02:20:25,419 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 02:20:25,421 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 02:20:25,422 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 02:20:25,424 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-04 02:20:25,425 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-04 02:20:25,426 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 02:20:25,426 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 02:20:25,478 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 02:20:25,479 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 02:20:25,479 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 02:20:25,479 INFO L158 Benchmark]: Toolchain (without parser) took 5606.24ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 112.3MB in the beginning and 185.9MB in the end (delta: -73.6MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2025-03-04 02:20:25,479 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory was 124.7MB in the beginning and 124.4MB in the end (delta: 293.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:20:25,480 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.34ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 100.3MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:20:25,480 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.62ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 98.8MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:20:25,480 INFO L158 Benchmark]: Boogie Preprocessor took 29.74ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 97.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:20:25,480 INFO L158 Benchmark]: IcfgBuilder took 449.74ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 69.1MB in the end (delta: 28.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 02:20:25,480 INFO L158 Benchmark]: TraceAbstraction took 4865.01ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 68.7MB in the beginning and 189.3MB in the end (delta: -120.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:20:25,481 INFO L158 Benchmark]: Witness Printer took 62.70ms. Allocated memory is still 226.5MB. Free memory was 189.3MB in the beginning and 185.9MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:20:25,481 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.23ms. Allocated memory is still 201.3MB. Free memory was 124.7MB in the beginning and 124.4MB in the end (delta: 293.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 171.34ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 100.3MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.62ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 98.8MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.74ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 97.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 449.74ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 69.1MB in the end (delta: 28.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4865.01ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 68.7MB in the beginning and 189.3MB in the end (delta: -120.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 62.70ms. Allocated memory is still 226.5MB. Free memory was 189.3MB in the beginning and 185.9MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 98]: 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, 83 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: 4.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 645 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 585 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2723 IncrementalHoareTripleChecker+Invalid, 2765 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 2 mSDtfsCounter, 2723 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=608occurred in iteration=4, InterpolantAutomatonStates: 73, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 568 NumberOfCodeBlocks, 557 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 556 ConstructedInterpolants, 0 QuantifiedInterpolants, 1232 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 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:20:25,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE