./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 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/pthread-ext/11_fmaxsymopt-zero.i -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 44a70169ef8abd67c211072db1308f16df00422231dd8f14aa88bc39d0b023bb --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 00:45:48,628 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 00:45:48,682 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 00:45:48,690 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 00:45:48,690 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 00:45:48,706 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 00:45:48,708 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 00:45:48,708 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 00:45:48,708 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 00:45:48,709 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 00:45:48,709 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 00:45:48,709 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 00:45:48,709 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 00:45:48,710 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 00:45:48,710 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 00:45:48,710 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 00:45:48,710 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 00:45:48,710 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 00:45:48,710 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 00:45:48,711 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 00:45:48,711 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 00:45:48,711 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 00:45:48,711 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 00:45:48,711 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 00:45:48,711 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 00:45:48,711 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 00:45:48,711 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 00:45:48,711 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 00:45:48,711 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 00:45:48,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 00:45:48,711 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 00:45:48,711 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 00:45:48,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:45:48,712 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 00:45:48,712 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 00:45:48,712 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 00:45:48,712 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 00:45:48,712 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 00:45:48,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 00:45:48,713 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 00:45:48,713 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 00:45:48,713 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 00:45:48,713 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 00:45:48,713 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 -> 44a70169ef8abd67c211072db1308f16df00422231dd8f14aa88bc39d0b023bb [2025-03-14 00:45:48,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 00:45:48,900 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 00:45:48,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 00:45:48,902 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 00:45:48,902 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 00:45:48,903 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i [2025-03-14 00:45:49,968 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e0c8717f/456f0cf7acd94d8ca18e1ceddab5d734/FLAGd5fa1ba4c [2025-03-14 00:45:50,265 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 00:45:50,265 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i [2025-03-14 00:45:50,274 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e0c8717f/456f0cf7acd94d8ca18e1ceddab5d734/FLAGd5fa1ba4c [2025-03-14 00:45:50,286 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e0c8717f/456f0cf7acd94d8ca18e1ceddab5d734 [2025-03-14 00:45:50,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 00:45:50,289 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 00:45:50,290 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 00:45:50,290 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 00:45:50,293 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 00:45:50,293 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:45:50" (1/1) ... [2025-03-14 00:45:50,294 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@101c181a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:45:50, skipping insertion in model container [2025-03-14 00:45:50,294 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:45:50" (1/1) ... [2025-03-14 00:45:50,317 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 00:45:50,557 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/pthread-ext/11_fmaxsymopt-zero.i[30843,30856] [2025-03-14 00:45:50,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:45:50,580 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 00:45:50,619 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/pthread-ext/11_fmaxsymopt-zero.i[30843,30856] [2025-03-14 00:45:50,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:45:50,655 INFO L204 MainTranslator]: Completed translation [2025-03-14 00:45:50,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:45:50 WrapperNode [2025-03-14 00:45:50,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 00:45:50,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 00:45:50,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 00:45:50,657 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 00:45:50,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:45:50" (1/1) ... [2025-03-14 00:45:50,671 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:45:50" (1/1) ... [2025-03-14 00:45:50,686 INFO L138 Inliner]: procedures = 164, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 72 [2025-03-14 00:45:50,686 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 00:45:50,687 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 00:45:50,687 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 00:45:50,687 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 00:45:50,691 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:45:50" (1/1) ... [2025-03-14 00:45:50,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:45:50" (1/1) ... [2025-03-14 00:45:50,693 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:45:50" (1/1) ... [2025-03-14 00:45:50,702 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6]. The 0 writes are split as follows [0, 0, 0]. [2025-03-14 00:45:50,702 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:45:50" (1/1) ... [2025-03-14 00:45:50,703 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:45:50" (1/1) ... [2025-03-14 00:45:50,707 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:45:50" (1/1) ... [2025-03-14 00:45:50,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:45:50" (1/1) ... [2025-03-14 00:45:50,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:45:50" (1/1) ... [2025-03-14 00:45:50,710 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:45:50" (1/1) ... [2025-03-14 00:45:50,711 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 00:45:50,711 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 00:45:50,712 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 00:45:50,712 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 00:45:50,712 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:45:50" (1/1) ... [2025-03-14 00:45:50,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:45:50,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:45:50,734 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-14 00:45:50,735 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-14 00:45:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-14 00:45:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-14 00:45:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-14 00:45:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-14 00:45:50,753 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-14 00:45:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 00:45:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 00:45:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 00:45:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-14 00:45:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-14 00:45:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 00:45:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 00:45:50,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 00:45:50,754 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 00:45:50,843 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 00:45:50,844 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 00:45:50,951 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 00:45:50,952 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 00:45:50,952 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 00:45:51,052 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 00:45:51,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:45:51 BoogieIcfgContainer [2025-03-14 00:45:51,052 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 00:45:51,054 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 00:45:51,054 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 00:45:51,057 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 00:45:51,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 12:45:50" (1/3) ... [2025-03-14 00:45:51,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a81a696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:45:51, skipping insertion in model container [2025-03-14 00:45:51,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:45:50" (2/3) ... [2025-03-14 00:45:51,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a81a696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:45:51, skipping insertion in model container [2025-03-14 00:45:51,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:45:51" (3/3) ... [2025-03-14 00:45:51,060 INFO L128 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt-zero.i [2025-03-14 00:45:51,069 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 00:45:51,070 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 11_fmaxsymopt-zero.i that has 2 procedures, 17 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-14 00:45:51,070 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 00:45:51,107 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 00:45:51,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 20 transitions, 44 flow [2025-03-14 00:45:51,152 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2025-03-14 00:45:51,156 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:45:51,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 22 events. 3/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-03-14 00:45:51,158 INFO L82 GeneralOperation]: Start removeDead. Operand has 20 places, 20 transitions, 44 flow [2025-03-14 00:45:51,162 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 20 transitions, 44 flow [2025-03-14 00:45:51,168 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:45:51,177 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;@4b2a258b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:45:51,179 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-14 00:45:51,185 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:45:51,185 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2025-03-14 00:45:51,185 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:45:51,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:45:51,186 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-14 00:45:51,186 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-14 00:45:51,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:45:51,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1369331846, now seen corresponding path program 1 times [2025-03-14 00:45:51,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:45:51,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28022006] [2025-03-14 00:45:51,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:45:51,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:45:51,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-14 00:45:51,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-14 00:45:51,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:45:51,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:45:51,295 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 00:45:51,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-14 00:45:51,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-14 00:45:51,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:45:51,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:45:51,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 00:45:51,326 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 00:45:51,327 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-03-14 00:45:51,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-03-14 00:45:51,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-03-14 00:45:51,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 00:45:51,330 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-14 00:45:51,336 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 00:45:51,336 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-14 00:45:51,356 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 00:45:51,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 35 transitions, 80 flow [2025-03-14 00:45:51,374 INFO L124 PetriNetUnfolderBase]: 6/40 cut-off events. [2025-03-14 00:45:51,375 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 00:45:51,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 40 events. 6/40 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 89 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 31. Up to 3 conditions per place. [2025-03-14 00:45:51,377 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 35 transitions, 80 flow [2025-03-14 00:45:51,377 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 35 transitions, 80 flow [2025-03-14 00:45:51,378 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:45:51,380 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;@4b2a258b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:45:51,380 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 00:45:51,388 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:45:51,390 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2025-03-14 00:45:51,390 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 00:45:51,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:45:51,390 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:45:51,390 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-14 00:45:51,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:45:51,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1546554887, now seen corresponding path program 1 times [2025-03-14 00:45:51,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:45:51,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054306952] [2025-03-14 00:45:51,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:45:51,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:45:51,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-14 00:45:51,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-14 00:45:51,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:45:51,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:51,580 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-14 00:45:51,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:45:51,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054306952] [2025-03-14 00:45:51,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054306952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:45:51,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:45:51,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:45:51,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834178739] [2025-03-14 00:45:51,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:45:51,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:45:51,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:45:51,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:45:51,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:45:51,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2025-03-14 00:45:51,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 35 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-14 00:45:51,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:45:51,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2025-03-14 00:45:51,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:45:51,816 INFO L124 PetriNetUnfolderBase]: 455/986 cut-off events. [2025-03-14 00:45:51,816 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-14 00:45:51,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1734 conditions, 986 events. 455/986 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5731 event pairs, 187 based on Foata normal form. 81/1000 useless extension candidates. Maximal degree in co-relation 880. Up to 376 conditions per place. [2025-03-14 00:45:51,829 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 32 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2025-03-14 00:45:51,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 46 transitions, 175 flow [2025-03-14 00:45:51,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:45:51,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:45:51,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-03-14 00:45:51,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2025-03-14 00:45:51,839 INFO L175 Difference]: Start difference. First operand has 34 places, 35 transitions, 80 flow. Second operand 3 states and 77 transitions. [2025-03-14 00:45:51,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 46 transitions, 175 flow [2025-03-14 00:45:51,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 175 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 00:45:51,844 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 88 flow [2025-03-14 00:45:51,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2025-03-14 00:45:51,848 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2025-03-14 00:45:51,849 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 33 transitions, 88 flow [2025-03-14 00:45:51,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-14 00:45:51,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:45:51,849 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-03-14 00:45:51,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 00:45:51,849 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-14 00:45:51,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:45:51,850 INFO L85 PathProgramCache]: Analyzing trace with hash -522826560, now seen corresponding path program 1 times [2025-03-14 00:45:51,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:45:51,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890949348] [2025-03-14 00:45:51,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:45:51,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:45:51,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-14 00:45:51,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-14 00:45:51,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:45:51,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:45:51,869 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 00:45:51,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-14 00:45:51,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-14 00:45:51,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:45:51,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:45:51,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 00:45:51,898 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 00:45:51,898 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-03-14 00:45:51,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-03-14 00:45:51,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-03-14 00:45:51,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-03-14 00:45:51,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 00:45:51,899 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-14 00:45:51,899 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 00:45:51,899 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-14 00:45:51,925 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 00:45:51,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 50 transitions, 118 flow [2025-03-14 00:45:51,935 INFO L124 PetriNetUnfolderBase]: 9/58 cut-off events. [2025-03-14 00:45:51,935 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-14 00:45:51,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 58 events. 9/58 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 143 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 47. Up to 4 conditions per place. [2025-03-14 00:45:51,935 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 50 transitions, 118 flow [2025-03-14 00:45:51,936 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 50 transitions, 118 flow [2025-03-14 00:45:51,937 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:45:51,937 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;@4b2a258b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:45:51,937 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-14 00:45:51,940 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:45:51,941 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2025-03-14 00:45:51,941 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 00:45:51,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:45:51,941 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:45:51,941 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 00:45:51,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:45:51,942 INFO L85 PathProgramCache]: Analyzing trace with hash 169200775, now seen corresponding path program 1 times [2025-03-14 00:45:51,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:45:51,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954355405] [2025-03-14 00:45:51,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:45:51,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:45:51,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-14 00:45:51,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-14 00:45:51,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:45:51,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:52,001 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-14 00:45:52,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:45:52,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954355405] [2025-03-14 00:45:52,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954355405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:45:52,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:45:52,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:45:52,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455473707] [2025-03-14 00:45:52,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:45:52,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:45:52,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:45:52,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:45:52,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:45:52,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50 [2025-03-14 00:45:52,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 50 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-14 00:45:52,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:45:52,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50 [2025-03-14 00:45:52,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:45:52,734 INFO L124 PetriNetUnfolderBase]: 5081/8851 cut-off events. [2025-03-14 00:45:52,734 INFO L125 PetriNetUnfolderBase]: For 556/556 co-relation queries the response was YES. [2025-03-14 00:45:52,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16061 conditions, 8851 events. 5081/8851 cut-off events. For 556/556 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 64593 event pairs, 2182 based on Foata normal form. 1060/9415 useless extension candidates. Maximal degree in co-relation 4306. Up to 3652 conditions per place. [2025-03-14 00:45:52,789 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 48 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2025-03-14 00:45:52,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 68 transitions, 266 flow [2025-03-14 00:45:52,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:45:52,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:45:52,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2025-03-14 00:45:52,791 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7533333333333333 [2025-03-14 00:45:52,791 INFO L175 Difference]: Start difference. First operand has 48 places, 50 transitions, 118 flow. Second operand 3 states and 113 transitions. [2025-03-14 00:45:52,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 68 transitions, 266 flow [2025-03-14 00:45:52,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 68 transitions, 262 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-03-14 00:45:52,793 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 122 flow [2025-03-14 00:45:52,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2025-03-14 00:45:52,794 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2025-03-14 00:45:52,794 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 122 flow [2025-03-14 00:45:52,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-14 00:45:52,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:45:52,794 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:45:52,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 00:45:52,794 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 00:45:52,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:45:52,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1947383955, now seen corresponding path program 1 times [2025-03-14 00:45:52,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:45:52,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145460154] [2025-03-14 00:45:52,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:45:52,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:45:52,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-14 00:45:52,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-14 00:45:52,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:45:52,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:52,859 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-14 00:45:52,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:45:52,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145460154] [2025-03-14 00:45:52,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145460154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:45:52,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:45:52,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:45:52,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047744052] [2025-03-14 00:45:52,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:45:52,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:45:52,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:45:52,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:45:52,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:45:52,869 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50 [2025-03-14 00:45:52,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-14 00:45:52,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:45:52,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50 [2025-03-14 00:45:52,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:45:53,721 INFO L124 PetriNetUnfolderBase]: 8199/14165 cut-off events. [2025-03-14 00:45:53,721 INFO L125 PetriNetUnfolderBase]: For 2609/2609 co-relation queries the response was YES. [2025-03-14 00:45:53,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27178 conditions, 14165 events. 8199/14165 cut-off events. For 2609/2609 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 109504 event pairs, 3517 based on Foata normal form. 0/13375 useless extension candidates. Maximal degree in co-relation 13385. Up to 5893 conditions per place. [2025-03-14 00:45:53,793 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 51 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2025-03-14 00:45:53,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 70 transitions, 291 flow [2025-03-14 00:45:53,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:45:53,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:45:53,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2025-03-14 00:45:53,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6933333333333334 [2025-03-14 00:45:53,795 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 122 flow. Second operand 3 states and 104 transitions. [2025-03-14 00:45:53,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 70 transitions, 291 flow [2025-03-14 00:45:53,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 70 transitions, 283 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 00:45:53,800 INFO L231 Difference]: Finished difference. Result has 53 places, 48 transitions, 132 flow [2025-03-14 00:45:53,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=53, PETRI_TRANSITIONS=48} [2025-03-14 00:45:53,801 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 5 predicate places. [2025-03-14 00:45:53,801 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 48 transitions, 132 flow [2025-03-14 00:45:53,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-14 00:45:53,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:45:53,801 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:45:53,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 00:45:53,801 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 00:45:53,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:45:53,802 INFO L85 PathProgramCache]: Analyzing trace with hash 60484803, now seen corresponding path program 1 times [2025-03-14 00:45:53,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:45:53,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581920538] [2025-03-14 00:45:53,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:45:53,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:45:53,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-14 00:45:53,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-14 00:45:53,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:45:53,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:53,840 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-14 00:45:53,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:45:53,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581920538] [2025-03-14 00:45:53,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581920538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:45:53,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:45:53,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:45:53,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922711654] [2025-03-14 00:45:53,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:45:53,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:45:53,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:45:53,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:45:53,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:45:53,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50 [2025-03-14 00:45:53,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 48 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-14 00:45:53,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:45:53,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50 [2025-03-14 00:45:53,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:45:54,644 INFO L124 PetriNetUnfolderBase]: 7283/12531 cut-off events. [2025-03-14 00:45:54,645 INFO L125 PetriNetUnfolderBase]: For 2823/2823 co-relation queries the response was YES. [2025-03-14 00:45:54,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24905 conditions, 12531 events. 7283/12531 cut-off events. For 2823/2823 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 92870 event pairs, 4758 based on Foata normal form. 267/11934 useless extension candidates. Maximal degree in co-relation 17780. Up to 7812 conditions per place. [2025-03-14 00:45:54,694 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 50 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2025-03-14 00:45:54,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 68 transitions, 296 flow [2025-03-14 00:45:54,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:45:54,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:45:54,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2025-03-14 00:45:54,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6866666666666666 [2025-03-14 00:45:54,696 INFO L175 Difference]: Start difference. First operand has 53 places, 48 transitions, 132 flow. Second operand 3 states and 103 transitions. [2025-03-14 00:45:54,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 68 transitions, 296 flow [2025-03-14 00:45:54,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 00:45:54,711 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 136 flow [2025-03-14 00:45:54,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2025-03-14 00:45:54,713 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 6 predicate places. [2025-03-14 00:45:54,714 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 136 flow [2025-03-14 00:45:54,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-14 00:45:54,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:45:54,714 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-03-14 00:45:54,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 00:45:54,714 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 00:45:54,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:45:54,715 INFO L85 PathProgramCache]: Analyzing trace with hash 52652293, now seen corresponding path program 1 times [2025-03-14 00:45:54,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:45:54,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988931307] [2025-03-14 00:45:54,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:45:54,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:45:54,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-14 00:45:54,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-14 00:45:54,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:45:54,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:45:54,725 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 00:45:54,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-14 00:45:54,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-14 00:45:54,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:45:54,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:45:54,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 00:45:54,739 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 00:45:54,739 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-14 00:45:54,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-03-14 00:45:54,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-03-14 00:45:54,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-03-14 00:45:54,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-03-14 00:45:54,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 00:45:54,740 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-14 00:45:54,741 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 00:45:54,742 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-14 00:45:54,770 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 00:45:54,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 65 transitions, 158 flow [2025-03-14 00:45:54,775 INFO L124 PetriNetUnfolderBase]: 12/76 cut-off events. [2025-03-14 00:45:54,775 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-14 00:45:54,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 76 events. 12/76 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 211 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 70. Up to 5 conditions per place. [2025-03-14 00:45:54,776 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 65 transitions, 158 flow [2025-03-14 00:45:54,776 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 65 transitions, 158 flow [2025-03-14 00:45:54,777 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:45:54,777 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;@4b2a258b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:45:54,777 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-14 00:45:54,778 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:45:54,778 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2025-03-14 00:45:54,778 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 00:45:54,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:45:54,779 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:45:54,779 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 00:45:54,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:45:54,779 INFO L85 PathProgramCache]: Analyzing trace with hash -336317194, now seen corresponding path program 1 times [2025-03-14 00:45:54,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:45:54,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200110835] [2025-03-14 00:45:54,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:45:54,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:45:54,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-14 00:45:54,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-14 00:45:54,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:45:54,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:54,818 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-14 00:45:54,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:45:54,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200110835] [2025-03-14 00:45:54,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200110835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:45:54,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:45:54,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:45:54,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398632575] [2025-03-14 00:45:54,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:45:54,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:45:54,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:45:54,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:45:54,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:45:54,824 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 65 [2025-03-14 00:45:54,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 65 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-14 00:45:54,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:45:54,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 65 [2025-03-14 00:45:54,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:45:58,368 INFO L124 PetriNetUnfolderBase]: 48782/75206 cut-off events. [2025-03-14 00:45:58,369 INFO L125 PetriNetUnfolderBase]: For 6782/6782 co-relation queries the response was YES. [2025-03-14 00:45:58,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139502 conditions, 75206 events. 48782/75206 cut-off events. For 6782/6782 co-relation queries the response was YES. Maximal size of possible extension queue 2869. Compared 620106 event pairs, 21439 based on Foata normal form. 11154/82862 useless extension candidates. Maximal degree in co-relation 16030. Up to 32758 conditions per place. [2025-03-14 00:45:58,938 INFO L140 encePairwiseOnDemand]: 57/65 looper letters, 64 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2025-03-14 00:45:58,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 90 transitions, 361 flow [2025-03-14 00:45:58,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:45:58,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:45:58,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2025-03-14 00:45:58,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.764102564102564 [2025-03-14 00:45:58,942 INFO L175 Difference]: Start difference. First operand has 62 places, 65 transitions, 158 flow. Second operand 3 states and 149 transitions. [2025-03-14 00:45:58,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 90 transitions, 361 flow [2025-03-14 00:45:58,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 90 transitions, 349 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-14 00:45:58,949 INFO L231 Difference]: Finished difference. Result has 65 places, 61 transitions, 156 flow [2025-03-14 00:45:58,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=65, PETRI_TRANSITIONS=61} [2025-03-14 00:45:58,950 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 3 predicate places. [2025-03-14 00:45:58,950 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 156 flow [2025-03-14 00:45:58,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-14 00:45:58,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:45:58,950 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:45:58,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 00:45:58,950 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 00:45:58,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:45:58,951 INFO L85 PathProgramCache]: Analyzing trace with hash 676229325, now seen corresponding path program 1 times [2025-03-14 00:45:58,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:45:58,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046141978] [2025-03-14 00:45:58,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:45:58,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:45:58,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-14 00:45:58,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-14 00:45:58,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:45:58,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:59,010 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-14 00:45:59,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:45:59,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046141978] [2025-03-14 00:45:59,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046141978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:45:59,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:45:59,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:45:59,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326162261] [2025-03-14 00:45:59,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:45:59,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:45:59,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:45:59,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:45:59,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:45:59,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 65 [2025-03-14 00:45:59,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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-14 00:45:59,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:45:59,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 65 [2025-03-14 00:45:59,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:46:05,776 INFO L124 PetriNetUnfolderBase]: 78489/120060 cut-off events. [2025-03-14 00:46:05,777 INFO L125 PetriNetUnfolderBase]: For 19505/19505 co-relation queries the response was YES. [2025-03-14 00:46:06,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232404 conditions, 120060 events. 78489/120060 cut-off events. For 19505/19505 co-relation queries the response was YES. Maximal size of possible extension queue 4441. Compared 1025916 event pairs, 34282 based on Foata normal form. 0/114539 useless extension candidates. Maximal degree in co-relation 116652. Up to 52513 conditions per place. [2025-03-14 00:46:06,685 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 67 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2025-03-14 00:46:06,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 92 transitions, 378 flow [2025-03-14 00:46:06,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:46:06,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:46:06,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2025-03-14 00:46:06,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7076923076923077 [2025-03-14 00:46:06,687 INFO L175 Difference]: Start difference. First operand has 65 places, 61 transitions, 156 flow. Second operand 3 states and 138 transitions. [2025-03-14 00:46:06,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 92 transitions, 378 flow [2025-03-14 00:46:06,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 92 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 00:46:06,705 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 166 flow [2025-03-14 00:46:06,705 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2025-03-14 00:46:06,706 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places. [2025-03-14 00:46:06,706 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 166 flow [2025-03-14 00:46:06,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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-14 00:46:06,706 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:46:06,706 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:46:06,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 00:46:06,706 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 00:46:06,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:46:06,707 INFO L85 PathProgramCache]: Analyzing trace with hash -2042191502, now seen corresponding path program 1 times [2025-03-14 00:46:06,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:46:06,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520287690] [2025-03-14 00:46:06,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:46:06,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:46:06,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-14 00:46:06,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-14 00:46:06,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:06,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:46:06,742 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-14 00:46:06,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:46:06,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520287690] [2025-03-14 00:46:06,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520287690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:46:06,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:46:06,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:46:06,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186231539] [2025-03-14 00:46:06,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:46:06,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:46:06,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:46:06,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:46:06,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:46:06,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 65 [2025-03-14 00:46:06,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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-14 00:46:06,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:46:06,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 65 [2025-03-14 00:46:06,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:46:12,443 INFO L124 PetriNetUnfolderBase]: 70133/104555 cut-off events. [2025-03-14 00:46:12,444 INFO L125 PetriNetUnfolderBase]: For 22139/22139 co-relation queries the response was YES. [2025-03-14 00:46:12,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210611 conditions, 104555 events. 70133/104555 cut-off events. For 22139/22139 co-relation queries the response was YES. Maximal size of possible extension queue 3543. Compared 831619 event pairs, 46317 based on Foata normal form. 1884/101469 useless extension candidates. Maximal degree in co-relation 149828. Up to 69972 conditions per place. [2025-03-14 00:46:13,017 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 66 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2025-03-14 00:46:13,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 90 transitions, 383 flow [2025-03-14 00:46:13,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:46:13,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:46:13,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2025-03-14 00:46:13,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7025641025641025 [2025-03-14 00:46:13,019 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 166 flow. Second operand 3 states and 137 transitions. [2025-03-14 00:46:13,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 90 transitions, 383 flow [2025-03-14 00:46:13,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 90 transitions, 375 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 00:46:13,118 INFO L231 Difference]: Finished difference. Result has 68 places, 62 transitions, 170 flow [2025-03-14 00:46:13,118 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=68, PETRI_TRANSITIONS=62} [2025-03-14 00:46:13,119 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 6 predicate places. [2025-03-14 00:46:13,119 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 170 flow [2025-03-14 00:46:13,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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-14 00:46:13,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:46:13,119 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:46:13,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 00:46:13,119 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 00:46:13,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:46:13,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1939583511, now seen corresponding path program 1 times [2025-03-14 00:46:13,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:46:13,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303606971] [2025-03-14 00:46:13,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:46:13,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:46:13,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-14 00:46:13,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-14 00:46:13,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:13,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:46:13,312 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-14 00:46:13,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:46:13,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303606971] [2025-03-14 00:46:13,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303606971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:46:13,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:46:13,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:46:13,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608038445] [2025-03-14 00:46:13,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:46:13,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:46:13,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:46:13,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:46:13,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:46:13,320 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 65 [2025-03-14 00:46:13,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 62 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-14 00:46:13,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:46:13,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 65 [2025-03-14 00:46:13,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:46:21,407 INFO L124 PetriNetUnfolderBase]: 100243/154284 cut-off events. [2025-03-14 00:46:21,407 INFO L125 PetriNetUnfolderBase]: For 38372/38372 co-relation queries the response was YES. [2025-03-14 00:46:21,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 313602 conditions, 154284 events. 100243/154284 cut-off events. For 38372/38372 co-relation queries the response was YES. Maximal size of possible extension queue 5421. Compared 1356468 event pairs, 44605 based on Foata normal form. 0/146917 useless extension candidates. Maximal degree in co-relation 242299. Up to 67612 conditions per place. [2025-03-14 00:46:22,366 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 70 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2025-03-14 00:46:22,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 94 transitions, 405 flow [2025-03-14 00:46:22,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:46:22,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:46:22,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2025-03-14 00:46:22,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7025641025641025 [2025-03-14 00:46:22,368 INFO L175 Difference]: Start difference. First operand has 68 places, 62 transitions, 170 flow. Second operand 3 states and 137 transitions. [2025-03-14 00:46:22,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 94 transitions, 405 flow [2025-03-14 00:46:22,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 94 transitions, 401 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 00:46:22,469 INFO L231 Difference]: Finished difference. Result has 71 places, 63 transitions, 182 flow [2025-03-14 00:46:22,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=71, PETRI_TRANSITIONS=63} [2025-03-14 00:46:22,470 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 9 predicate places. [2025-03-14 00:46:22,470 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 63 transitions, 182 flow [2025-03-14 00:46:22,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-14 00:46:22,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:46:22,471 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:46:22,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 00:46:22,471 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 00:46:22,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:46:22,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1613169647, now seen corresponding path program 1 times [2025-03-14 00:46:22,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:46:22,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660407406] [2025-03-14 00:46:22,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:46:22,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:46:22,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-14 00:46:22,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-14 00:46:22,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:22,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:46:22,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:46:22,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:46:22,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660407406] [2025-03-14 00:46:22,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660407406] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:46:22,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864276528] [2025-03-14 00:46:22,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:46:22,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:46:22,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:46:22,510 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:46:22,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 00:46:22,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-14 00:46:22,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-14 00:46:22,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:22,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:46:22,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-14 00:46:22,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:46:22,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:46:22,611 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:46:22,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:46:22,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864276528] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:46:22,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:46:22,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-14 00:46:22,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791441799] [2025-03-14 00:46:22,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:46:22,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:46:22,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:46:22,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:46:22,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-14 00:46:22,627 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 65 [2025-03-14 00:46:22,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 63 transitions, 182 flow. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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-14 00:46:22,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:46:22,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 65 [2025-03-14 00:46:22,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand