./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 981eae178b9cad0bb64b87dda8360f4f1e2e23d7b9d396f9db2ad5a6977098c4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:46:42,658 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:46:42,702 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:46:42,707 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:46:42,707 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:46:42,729 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:46:42,730 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:46:42,730 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:46:42,731 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:46:42,731 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:46:42,731 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:46:42,731 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:46:42,731 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:46:42,731 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:46:42,731 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:46:42,734 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:46:42,734 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:46:42,735 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:46:42,735 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:46:42,735 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:46:42,735 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:46:42,735 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:46:42,735 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:46:42,735 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:46:42,735 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:46:42,735 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:46:42,735 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:46:42,735 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:46:42,735 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:46:42,735 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:46:42,735 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:46:42,735 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:46:42,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:46:42,735 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:46:42,735 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:46:42,735 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:46:42,735 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:46:42,735 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:46:42,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:46:42,735 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:46:42,735 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:46:42,736 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:46:42,736 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:46:42,736 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 -> 981eae178b9cad0bb64b87dda8360f4f1e2e23d7b9d396f9db2ad5a6977098c4 [2025-03-13 21:46:42,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:46:42,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:46:42,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:46:42,957 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:46:42,957 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:46:42,958 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c [2025-03-13 21:46:44,108 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73a0b90a2/fbbd28e3361a4978b84ff68c9d539b2f/FLAG380ca8a49 [2025-03-13 21:46:44,366 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:46:44,370 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c [2025-03-13 21:46:44,378 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73a0b90a2/fbbd28e3361a4978b84ff68c9d539b2f/FLAG380ca8a49 [2025-03-13 21:46:44,394 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73a0b90a2/fbbd28e3361a4978b84ff68c9d539b2f [2025-03-13 21:46:44,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:46:44,397 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:46:44,399 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:46:44,400 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:46:44,403 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:46:44,403 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:46:44" (1/1) ... [2025-03-13 21:46:44,404 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bfc908c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:44, skipping insertion in model container [2025-03-13 21:46:44,405 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:46:44" (1/1) ... [2025-03-13 21:46:44,418 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:46:44,544 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c[2218,2231] [2025-03-13 21:46:44,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:46:44,554 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:46:44,571 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c[2218,2231] [2025-03-13 21:46:44,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:46:44,584 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:46:44,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:44 WrapperNode [2025-03-13 21:46:44,586 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:46:44,586 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:46:44,586 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:46:44,586 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:46:44,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:44" (1/1) ... [2025-03-13 21:46:44,594 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:44" (1/1) ... [2025-03-13 21:46:44,610 INFO L138 Inliner]: procedures = 20, calls = 13, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 88 [2025-03-13 21:46:44,611 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:46:44,612 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:46:44,612 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:46:44,612 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:46:44,618 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:44" (1/1) ... [2025-03-13 21:46:44,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:44" (1/1) ... [2025-03-13 21:46:44,620 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:44" (1/1) ... [2025-03-13 21:46:44,629 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-13 21:46:44,632 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:44" (1/1) ... [2025-03-13 21:46:44,632 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:44" (1/1) ... [2025-03-13 21:46:44,635 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:44" (1/1) ... [2025-03-13 21:46:44,639 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:44" (1/1) ... [2025-03-13 21:46:44,640 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:44" (1/1) ... [2025-03-13 21:46:44,640 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:44" (1/1) ... [2025-03-13 21:46:44,644 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:46:44,645 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:46:44,645 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:46:44,645 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:46:44,646 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:44" (1/1) ... [2025-03-13 21:46:44,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:46:44,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:46:44,674 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-13 21:46:44,679 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-13 21:46:44,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:46:44,693 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:46:44,693 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:46:44,693 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:46:44,693 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:46:44,693 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 21:46:44,693 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 21:46:44,693 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-13 21:46:44,693 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-13 21:46:44,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:46:44,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:46:44,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:46:44,694 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:46:44,759 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:46:44,760 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:46:44,911 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:46:44,912 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:46:44,912 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:46:45,007 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:46:45,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:46:45 BoogieIcfgContainer [2025-03-13 21:46:45,008 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:46:45,009 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:46:45,009 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:46:45,013 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:46:45,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:46:44" (1/3) ... [2025-03-13 21:46:45,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e41c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:46:45, skipping insertion in model container [2025-03-13 21:46:45,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:44" (2/3) ... [2025-03-13 21:46:45,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e41c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:46:45, skipping insertion in model container [2025-03-13 21:46:45,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:46:45" (3/3) ... [2025-03-13 21:46:45,015 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-counter-determinism.wvr.c [2025-03-13 21:46:45,024 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:46:45,025 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-counter-determinism.wvr.c that has 5 procedures, 37 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-13 21:46:45,025 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:46:45,079 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-13 21:46:45,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 40 transitions, 108 flow [2025-03-13 21:46:45,133 INFO L124 PetriNetUnfolderBase]: 4/36 cut-off events. [2025-03-13 21:46:45,136 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 21:46:45,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 36 events. 4/36 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 46 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-03-13 21:46:45,141 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 40 transitions, 108 flow [2025-03-13 21:46:45,143 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 35 transitions, 94 flow [2025-03-13 21:46:45,148 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:46:45,157 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;@607d2e37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:46:45,157 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-13 21:46:45,166 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:46:45,167 INFO L124 PetriNetUnfolderBase]: 4/34 cut-off events. [2025-03-13 21:46:45,167 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 21:46:45,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:46:45,170 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:46:45,171 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:46:45,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:46:45,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1384190007, now seen corresponding path program 1 times [2025-03-13 21:46:45,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:46:45,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438435667] [2025-03-13 21:46:45,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:46:45,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:46:45,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 21:46:45,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:46:45,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:46:45,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:45,472 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-13 21:46:45,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:46:45,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438435667] [2025-03-13 21:46:45,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438435667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:46:45,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:46:45,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:46:45,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158844041] [2025-03-13 21:46:45,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:46:45,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:46:45,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:46:45,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:46:45,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:46:45,499 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-13 21:46:45,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-13 21:46:45,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:46:45,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-13 21:46:45,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:46:45,960 INFO L124 PetriNetUnfolderBase]: 4206/5681 cut-off events. [2025-03-13 21:46:45,961 INFO L125 PetriNetUnfolderBase]: For 464/464 co-relation queries the response was YES. [2025-03-13 21:46:45,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11669 conditions, 5681 events. 4206/5681 cut-off events. For 464/464 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 23985 event pairs, 1080 based on Foata normal form. 1/5291 useless extension candidates. Maximal degree in co-relation 10306. Up to 4714 conditions per place. [2025-03-13 21:46:45,993 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 48 selfloop transitions, 3 changer transitions 2/56 dead transitions. [2025-03-13 21:46:45,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 56 transitions, 263 flow [2025-03-13 21:46:45,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:46:45,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:46:46,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-03-13 21:46:46,002 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6416666666666667 [2025-03-13 21:46:46,003 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 94 flow. Second operand 3 states and 77 transitions. [2025-03-13 21:46:46,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 56 transitions, 263 flow [2025-03-13 21:46:46,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 56 transitions, 233 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-13 21:46:46,015 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 101 flow [2025-03-13 21:46:46,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=39, PETRI_TRANSITIONS=37} [2025-03-13 21:46:46,019 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -5 predicate places. [2025-03-13 21:46:46,020 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 101 flow [2025-03-13 21:46:46,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-13 21:46:46,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:46:46,020 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:46:46,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:46:46,021 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:46:46,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:46:46,021 INFO L85 PathProgramCache]: Analyzing trace with hash -633679508, now seen corresponding path program 1 times [2025-03-13 21:46:46,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:46:46,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970532119] [2025-03-13 21:46:46,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:46:46,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:46:46,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-13 21:46:46,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:46:46,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:46:46,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:46,170 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-13 21:46:46,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:46:46,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970532119] [2025-03-13 21:46:46,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970532119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:46:46,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:46:46,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:46:46,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54579895] [2025-03-13 21:46:46,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:46:46,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:46:46,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:46:46,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:46:46,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:46:46,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-03-13 21:46:46,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 101 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-13 21:46:46,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:46:46,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-03-13 21:46:46,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:46:46,964 INFO L124 PetriNetUnfolderBase]: 9567/12493 cut-off events. [2025-03-13 21:46:46,964 INFO L125 PetriNetUnfolderBase]: For 1519/1534 co-relation queries the response was YES. [2025-03-13 21:46:46,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27903 conditions, 12493 events. 9567/12493 cut-off events. For 1519/1534 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 58550 event pairs, 2918 based on Foata normal form. 0/11821 useless extension candidates. Maximal degree in co-relation 4319. Up to 6920 conditions per place. [2025-03-13 21:46:47,021 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 94 selfloop transitions, 10 changer transitions 0/106 dead transitions. [2025-03-13 21:46:47,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 106 transitions, 491 flow [2025-03-13 21:46:47,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:46:47,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:46:47,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2025-03-13 21:46:47,023 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.64 [2025-03-13 21:46:47,023 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 101 flow. Second operand 5 states and 128 transitions. [2025-03-13 21:46:47,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 106 transitions, 491 flow [2025-03-13 21:46:47,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 106 transitions, 483 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:46:47,026 INFO L231 Difference]: Finished difference. Result has 45 places, 46 transitions, 161 flow [2025-03-13 21:46:47,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=161, PETRI_PLACES=45, PETRI_TRANSITIONS=46} [2025-03-13 21:46:47,027 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2025-03-13 21:46:47,027 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 46 transitions, 161 flow [2025-03-13 21:46:47,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-13 21:46:47,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:46:47,027 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:46:47,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:46:47,027 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:46:47,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:46:47,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1402862136, now seen corresponding path program 2 times [2025-03-13 21:46:47,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:46:47,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286449751] [2025-03-13 21:46:47,029 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:46:47,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:46:47,040 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:46:47,045 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:46:47,045 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:46:47,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:47,121 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-13 21:46:47,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:46:47,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286449751] [2025-03-13 21:46:47,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286449751] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:46:47,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097568112] [2025-03-13 21:46:47,122 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:46:47,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:46:47,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:46:47,124 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-13 21:46:47,125 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-13 21:46:47,163 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:46:47,180 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:46:47,180 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:46:47,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:47,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 21:46:47,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:46:47,227 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-13 21:46:47,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:46:47,262 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-13 21:46:47,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097568112] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:46:47,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:46:47,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-03-13 21:46:47,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263953478] [2025-03-13 21:46:47,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:46:47,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 21:46:47,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:46:47,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 21:46:47,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-13 21:46:47,277 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-03-13 21:46:47,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 46 transitions, 161 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-13 21:46:47,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:46:47,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-03-13 21:46:47,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:46:48,431 INFO L124 PetriNetUnfolderBase]: 13384/17569 cut-off events. [2025-03-13 21:46:48,432 INFO L125 PetriNetUnfolderBase]: For 6402/6402 co-relation queries the response was YES. [2025-03-13 21:46:48,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45668 conditions, 17569 events. 13384/17569 cut-off events. For 6402/6402 co-relation queries the response was YES. Maximal size of possible extension queue 697. Compared 87618 event pairs, 1029 based on Foata normal form. 332/17895 useless extension candidates. Maximal degree in co-relation 25863. Up to 3569 conditions per place. [2025-03-13 21:46:48,513 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 239 selfloop transitions, 36 changer transitions 0/277 dead transitions. [2025-03-13 21:46:48,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 277 transitions, 1362 flow [2025-03-13 21:46:48,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-13 21:46:48,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-13 21:46:48,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 346 transitions. [2025-03-13 21:46:48,516 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6178571428571429 [2025-03-13 21:46:48,516 INFO L175 Difference]: Start difference. First operand has 45 places, 46 transitions, 161 flow. Second operand 14 states and 346 transitions. [2025-03-13 21:46:48,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 277 transitions, 1362 flow [2025-03-13 21:46:48,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 277 transitions, 1362 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:46:48,523 INFO L231 Difference]: Finished difference. Result has 64 places, 74 transitions, 411 flow [2025-03-13 21:46:48,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=411, PETRI_PLACES=64, PETRI_TRANSITIONS=74} [2025-03-13 21:46:48,524 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 20 predicate places. [2025-03-13 21:46:48,524 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 74 transitions, 411 flow [2025-03-13 21:46:48,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-13 21:46:48,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:46:48,525 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:46:48,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-13 21:46:48,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:46:48,729 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:46:48,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:46:48,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1013562230, now seen corresponding path program 1 times [2025-03-13 21:46:48,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:46:48,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965041386] [2025-03-13 21:46:48,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:46:48,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:46:48,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-13 21:46:48,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:46:48,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:46:48,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:48,811 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-13 21:46:48,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:46:48,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965041386] [2025-03-13 21:46:48,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965041386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:46:48,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:46:48,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:46:48,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753987840] [2025-03-13 21:46:48,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:46:48,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:46:48,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:46:48,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:46:48,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:46:48,817 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-03-13 21:46:48,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 74 transitions, 411 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-13 21:46:48,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:46:48,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-03-13 21:46:48,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:46:50,014 INFO L124 PetriNetUnfolderBase]: 21370/28214 cut-off events. [2025-03-13 21:46:50,014 INFO L125 PetriNetUnfolderBase]: For 32385/32385 co-relation queries the response was YES. [2025-03-13 21:46:50,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85224 conditions, 28214 events. 21370/28214 cut-off events. For 32385/32385 co-relation queries the response was YES. Maximal size of possible extension queue 959. Compared 146053 event pairs, 6342 based on Foata normal form. 0/26830 useless extension candidates. Maximal degree in co-relation 66902. Up to 12488 conditions per place. [2025-03-13 21:46:50,218 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 137 selfloop transitions, 19 changer transitions 2/162 dead transitions. [2025-03-13 21:46:50,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 162 transitions, 1100 flow [2025-03-13 21:46:50,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:46:50,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:46:50,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2025-03-13 21:46:50,224 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.635 [2025-03-13 21:46:50,224 INFO L175 Difference]: Start difference. First operand has 64 places, 74 transitions, 411 flow. Second operand 5 states and 127 transitions. [2025-03-13 21:46:50,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 162 transitions, 1100 flow [2025-03-13 21:46:50,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 162 transitions, 1053 flow, removed 12 selfloop flow, removed 1 redundant places. [2025-03-13 21:46:50,379 INFO L231 Difference]: Finished difference. Result has 70 places, 82 transitions, 500 flow [2025-03-13 21:46:50,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=500, PETRI_PLACES=70, PETRI_TRANSITIONS=82} [2025-03-13 21:46:50,379 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 26 predicate places. [2025-03-13 21:46:50,380 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 82 transitions, 500 flow [2025-03-13 21:46:50,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-13 21:46:50,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:46:50,380 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:46:50,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:46:50,380 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:46:50,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:46:50,380 INFO L85 PathProgramCache]: Analyzing trace with hash -851360294, now seen corresponding path program 3 times [2025-03-13 21:46:50,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:46:50,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823481861] [2025-03-13 21:46:50,380 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:46:50,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:46:50,387 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:46:50,396 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:46:50,397 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:46:50,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:50,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:46:50,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:46:50,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823481861] [2025-03-13 21:46:50,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823481861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:46:50,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:46:50,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:46:50,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012120919] [2025-03-13 21:46:50,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:46:50,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:46:50,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:46:50,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:46:50,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:46:50,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-03-13 21:46:50,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 82 transitions, 500 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-13 21:46:50,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:46:50,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-03-13 21:46:50,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:46:52,204 INFO L124 PetriNetUnfolderBase]: 23392/30994 cut-off events. [2025-03-13 21:46:52,205 INFO L125 PetriNetUnfolderBase]: For 55714/57117 co-relation queries the response was YES. [2025-03-13 21:46:52,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101647 conditions, 30994 events. 23392/30994 cut-off events. For 55714/57117 co-relation queries the response was YES. Maximal size of possible extension queue 1090. Compared 165141 event pairs, 7705 based on Foata normal form. 32/31001 useless extension candidates. Maximal degree in co-relation 88909. Up to 17519 conditions per place. [2025-03-13 21:46:52,341 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 138 selfloop transitions, 35 changer transitions 4/179 dead transitions. [2025-03-13 21:46:52,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 179 transitions, 1442 flow [2025-03-13 21:46:52,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:46:52,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:46:52,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2025-03-13 21:46:52,342 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-03-13 21:46:52,342 INFO L175 Difference]: Start difference. First operand has 70 places, 82 transitions, 500 flow. Second operand 5 states and 125 transitions. [2025-03-13 21:46:52,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 179 transitions, 1442 flow [2025-03-13 21:46:52,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 179 transitions, 1381 flow, removed 17 selfloop flow, removed 1 redundant places. [2025-03-13 21:46:52,577 INFO L231 Difference]: Finished difference. Result has 76 places, 104 transitions, 747 flow [2025-03-13 21:46:52,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=747, PETRI_PLACES=76, PETRI_TRANSITIONS=104} [2025-03-13 21:46:52,578 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 32 predicate places. [2025-03-13 21:46:52,579 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 104 transitions, 747 flow [2025-03-13 21:46:52,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-13 21:46:52,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:46:52,580 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:46:52,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:46:52,580 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:46:52,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:46:52,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1283275840, now seen corresponding path program 4 times [2025-03-13 21:46:52,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:46:52,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32215484] [2025-03-13 21:46:52,581 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:46:52,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:46:52,588 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:46:52,598 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 26 statements. [2025-03-13 21:46:52,603 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-13 21:46:52,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:52,667 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-13 21:46:52,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:46:52,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32215484] [2025-03-13 21:46:52,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32215484] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:46:52,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822862100] [2025-03-13 21:46:52,668 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:46:52,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:46:52,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:46:52,673 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:46:52,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-13 21:46:52,705 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:46:52,717 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 26 statements. [2025-03-13 21:46:52,717 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-13 21:46:52,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:52,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 21:46:52,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:46:52,761 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-13 21:46:52,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:46:52,796 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-13 21:46:52,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822862100] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:46:52,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:46:52,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-13 21:46:52,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092735018] [2025-03-13 21:46:52,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:46:52,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:46:52,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:46:52,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:46:52,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:46:52,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-03-13 21:46:52,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 104 transitions, 747 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:46:52,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:46:52,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-03-13 21:46:52,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:46:54,422 INFO L124 PetriNetUnfolderBase]: 25372/33270 cut-off events. [2025-03-13 21:46:54,422 INFO L125 PetriNetUnfolderBase]: For 73270/75160 co-relation queries the response was YES. [2025-03-13 21:46:54,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117074 conditions, 33270 events. 25372/33270 cut-off events. For 73270/75160 co-relation queries the response was YES. Maximal size of possible extension queue 1185. Compared 173451 event pairs, 5968 based on Foata normal form. 396/33657 useless extension candidates. Maximal degree in co-relation 101207. Up to 12180 conditions per place. [2025-03-13 21:46:54,572 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 223 selfloop transitions, 49 changer transitions 1/275 dead transitions. [2025-03-13 21:46:54,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 275 transitions, 2103 flow [2025-03-13 21:46:54,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:46:54,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:46:54,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 225 transitions. [2025-03-13 21:46:54,573 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-03-13 21:46:54,573 INFO L175 Difference]: Start difference. First operand has 76 places, 104 transitions, 747 flow. Second operand 9 states and 225 transitions. [2025-03-13 21:46:54,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 275 transitions, 2103 flow [2025-03-13 21:46:54,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 275 transitions, 2058 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:46:54,703 INFO L231 Difference]: Finished difference. Result has 88 places, 126 transitions, 1061 flow [2025-03-13 21:46:54,703 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=717, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1061, PETRI_PLACES=88, PETRI_TRANSITIONS=126} [2025-03-13 21:46:54,704 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 44 predicate places. [2025-03-13 21:46:54,704 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 126 transitions, 1061 flow [2025-03-13 21:46:54,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:46:54,704 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:46:54,704 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:46:54,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-13 21:46:54,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-13 21:46:54,905 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:46:54,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:46:54,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1471030394, now seen corresponding path program 5 times [2025-03-13 21:46:54,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:46:54,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234998163] [2025-03-13 21:46:54,906 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:46:54,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:46:54,911 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:46:54,914 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:46:54,914 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:46:54,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:54,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:46:54,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:46:54,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234998163] [2025-03-13 21:46:54,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234998163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:46:54,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:46:54,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:46:54,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375497955] [2025-03-13 21:46:54,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:46:54,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:46:54,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:46:54,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:46:54,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:46:54,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-03-13 21:46:54,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 126 transitions, 1061 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-13 21:46:54,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:46:54,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-03-13 21:46:54,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:46:56,976 INFO L124 PetriNetUnfolderBase]: 25476/33519 cut-off events. [2025-03-13 21:46:56,976 INFO L125 PetriNetUnfolderBase]: For 95292/97097 co-relation queries the response was YES. [2025-03-13 21:46:57,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126248 conditions, 33519 events. 25476/33519 cut-off events. For 95292/97097 co-relation queries the response was YES. Maximal size of possible extension queue 1207. Compared 176630 event pairs, 7238 based on Foata normal form. 78/33588 useless extension candidates. Maximal degree in co-relation 121295. Up to 16697 conditions per place. [2025-03-13 21:46:57,159 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 182 selfloop transitions, 22 changer transitions 6/212 dead transitions. [2025-03-13 21:46:57,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 212 transitions, 1926 flow [2025-03-13 21:46:57,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:46:57,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:46:57,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2025-03-13 21:46:57,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.635 [2025-03-13 21:46:57,160 INFO L175 Difference]: Start difference. First operand has 88 places, 126 transitions, 1061 flow. Second operand 5 states and 127 transitions. [2025-03-13 21:46:57,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 212 transitions, 1926 flow [2025-03-13 21:46:57,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 212 transitions, 1884 flow, removed 11 selfloop flow, removed 1 redundant places. [2025-03-13 21:46:57,599 INFO L231 Difference]: Finished difference. Result has 93 places, 128 transitions, 1100 flow [2025-03-13 21:46:57,601 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1019, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1100, PETRI_PLACES=93, PETRI_TRANSITIONS=128} [2025-03-13 21:46:57,601 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 49 predicate places. [2025-03-13 21:46:57,602 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 128 transitions, 1100 flow [2025-03-13 21:46:57,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-13 21:46:57,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:46:57,603 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:46:57,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:46:57,603 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:46:57,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:46:57,603 INFO L85 PathProgramCache]: Analyzing trace with hash 951134518, now seen corresponding path program 2 times [2025-03-13 21:46:57,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:46:57,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976596674] [2025-03-13 21:46:57,604 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:46:57,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:46:57,609 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-03-13 21:46:57,614 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:46:57,615 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:46:57,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:57,654 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-13 21:46:57,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:46:57,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976596674] [2025-03-13 21:46:57,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976596674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:46:57,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:46:57,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:46:57,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897425158] [2025-03-13 21:46:57,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:46:57,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:46:57,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:46:57,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:46:57,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:46:57,661 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-03-13 21:46:57,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 128 transitions, 1100 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-13 21:46:57,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:46:57,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-03-13 21:46:57,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:46:59,616 INFO L124 PetriNetUnfolderBase]: 27858/36866 cut-off events. [2025-03-13 21:46:59,616 INFO L125 PetriNetUnfolderBase]: For 113264/113612 co-relation queries the response was YES. [2025-03-13 21:46:59,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140251 conditions, 36866 events. 27858/36866 cut-off events. For 113264/113612 co-relation queries the response was YES. Maximal size of possible extension queue 1280. Compared 199575 event pairs, 8636 based on Foata normal form. 80/36840 useless extension candidates. Maximal degree in co-relation 135353. Up to 17596 conditions per place. [2025-03-13 21:46:59,864 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 130 selfloop transitions, 38 changer transitions 19/193 dead transitions. [2025-03-13 21:46:59,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 193 transitions, 1757 flow [2025-03-13 21:46:59,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:46:59,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:46:59,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2025-03-13 21:46:59,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.63 [2025-03-13 21:46:59,865 INFO L175 Difference]: Start difference. First operand has 93 places, 128 transitions, 1100 flow. Second operand 5 states and 126 transitions. [2025-03-13 21:46:59,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 193 transitions, 1757 flow [2025-03-13 21:47:00,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 193 transitions, 1708 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-13 21:47:00,371 INFO L231 Difference]: Finished difference. Result has 97 places, 128 transitions, 1160 flow [2025-03-13 21:47:00,371 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1059, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1160, PETRI_PLACES=97, PETRI_TRANSITIONS=128} [2025-03-13 21:47:00,372 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 53 predicate places. [2025-03-13 21:47:00,372 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 128 transitions, 1160 flow [2025-03-13 21:47:00,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-13 21:47:00,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:47:00,372 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:47:00,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:47:00,372 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:47:00,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:47:00,373 INFO L85 PathProgramCache]: Analyzing trace with hash -309263340, now seen corresponding path program 6 times [2025-03-13 21:47:00,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:47:00,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54761692] [2025-03-13 21:47:00,373 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:47:00,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:47:00,379 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:47:00,382 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:47:00,382 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-13 21:47:00,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:47:00,433 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-13 21:47:00,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:47:00,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54761692] [2025-03-13 21:47:00,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54761692] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:47:00,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752721866] [2025-03-13 21:47:00,434 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:47:00,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:47:00,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:47:00,436 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:47:00,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-13 21:47:00,469 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:47:00,483 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:47:00,484 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-13 21:47:00,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:47:00,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 21:47:00,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:47:00,523 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-13 21:47:00,523 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:47:00,558 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-13 21:47:00,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752721866] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:47:00,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:47:00,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2025-03-13 21:47:00,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016859567] [2025-03-13 21:47:00,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:47:00,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:47:00,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:47:00,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:47:00,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:47:00,572 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-03-13 21:47:00,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 128 transitions, 1160 flow. Second operand has 11 states, 11 states have (on average 10.0) internal successors, (110), 11 states have internal predecessors, (110), 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-13 21:47:00,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:47:00,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-03-13 21:47:00,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:47:03,081 INFO L124 PetriNetUnfolderBase]: 28146/37076 cut-off events. [2025-03-13 21:47:03,082 INFO L125 PetriNetUnfolderBase]: For 115327/119247 co-relation queries the response was YES. [2025-03-13 21:47:03,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141343 conditions, 37076 events. 28146/37076 cut-off events. For 115327/119247 co-relation queries the response was YES. Maximal size of possible extension queue 1366. Compared 202609 event pairs, 2448 based on Foata normal form. 492/37553 useless extension candidates. Maximal degree in co-relation 136145. Up to 7515 conditions per place. [2025-03-13 21:47:03,247 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 279 selfloop transitions, 88 changer transitions 1/370 dead transitions. [2025-03-13 21:47:03,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 370 transitions, 2837 flow [2025-03-13 21:47:03,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-13 21:47:03,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-13 21:47:03,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 382 transitions. [2025-03-13 21:47:03,248 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6366666666666667 [2025-03-13 21:47:03,248 INFO L175 Difference]: Start difference. First operand has 97 places, 128 transitions, 1160 flow. Second operand 15 states and 382 transitions. [2025-03-13 21:47:03,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 370 transitions, 2837 flow [2025-03-13 21:47:03,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 370 transitions, 2730 flow, removed 24 selfloop flow, removed 3 redundant places. [2025-03-13 21:47:03,774 INFO L231 Difference]: Finished difference. Result has 113 places, 140 transitions, 1451 flow [2025-03-13 21:47:03,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1037, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1451, PETRI_PLACES=113, PETRI_TRANSITIONS=140} [2025-03-13 21:47:03,775 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 69 predicate places. [2025-03-13 21:47:03,775 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 140 transitions, 1451 flow [2025-03-13 21:47:03,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.0) internal successors, (110), 11 states have internal predecessors, (110), 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-13 21:47:03,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:47:03,775 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:47:03,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-13 21:47:03,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:47:03,975 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:47:03,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:47:03,976 INFO L85 PathProgramCache]: Analyzing trace with hash -981566080, now seen corresponding path program 3 times [2025-03-13 21:47:03,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:47:03,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146526813] [2025-03-13 21:47:03,976 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:47:03,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:47:03,982 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 1 equivalence classes. [2025-03-13 21:47:03,987 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:47:03,987 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:47:03,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:47:04,034 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-13 21:47:04,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:47:04,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146526813] [2025-03-13 21:47:04,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146526813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:47:04,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:47:04,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:47:04,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36552697] [2025-03-13 21:47:04,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:47:04,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:47:04,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:47:04,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:47:04,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:47:04,042 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 40 [2025-03-13 21:47:04,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 140 transitions, 1451 flow. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:47:04,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:47:04,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 40 [2025-03-13 21:47:04,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:47:08,216 INFO L124 PetriNetUnfolderBase]: 51788/67406 cut-off events. [2025-03-13 21:47:08,216 INFO L125 PetriNetUnfolderBase]: For 263406/263406 co-relation queries the response was YES. [2025-03-13 21:47:08,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264486 conditions, 67406 events. 51788/67406 cut-off events. For 263406/263406 co-relation queries the response was YES. Maximal size of possible extension queue 1831. Compared 362086 event pairs, 20771 based on Foata normal form. 412/67818 useless extension candidates. Maximal degree in co-relation 254762. Up to 42916 conditions per place. [2025-03-13 21:47:08,747 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 272 selfloop transitions, 37 changer transitions 1/311 dead transitions. [2025-03-13 21:47:08,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 311 transitions, 3747 flow [2025-03-13 21:47:08,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:47:08,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:47:08,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2025-03-13 21:47:08,748 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.615 [2025-03-13 21:47:08,748 INFO L175 Difference]: Start difference. First operand has 113 places, 140 transitions, 1451 flow. Second operand 5 states and 123 transitions. [2025-03-13 21:47:08,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 311 transitions, 3747 flow [2025-03-13 21:47:10,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 311 transitions, 3655 flow, removed 26 selfloop flow, removed 1 redundant places. [2025-03-13 21:47:10,083 INFO L231 Difference]: Finished difference. Result has 119 places, 169 transitions, 1958 flow [2025-03-13 21:47:10,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1411, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1958, PETRI_PLACES=119, PETRI_TRANSITIONS=169} [2025-03-13 21:47:10,084 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 75 predicate places. [2025-03-13 21:47:10,084 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 169 transitions, 1958 flow [2025-03-13 21:47:10,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:47:10,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:47:10,084 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:47:10,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 21:47:10,084 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:47:10,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:47:10,085 INFO L85 PathProgramCache]: Analyzing trace with hash -716682956, now seen corresponding path program 4 times [2025-03-13 21:47:10,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:47:10,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744931976] [2025-03-13 21:47:10,085 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:47:10,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:47:10,089 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:47:10,092 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 26 statements. [2025-03-13 21:47:10,092 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-13 21:47:10,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:47:10,119 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-13 21:47:10,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:47:10,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744931976] [2025-03-13 21:47:10,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744931976] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:47:10,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697052441] [2025-03-13 21:47:10,120 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:47:10,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:47:10,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:47:10,122 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:47:10,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-13 21:47:10,157 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:47:10,168 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 26 statements. [2025-03-13 21:47:10,169 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-13 21:47:10,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:47:10,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 21:47:10,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:47:10,185 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-13 21:47:10,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:47:10,200 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-13 21:47:10,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697052441] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:47:10,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:47:10,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-03-13 21:47:10,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132503894] [2025-03-13 21:47:10,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:47:10,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:47:10,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:47:10,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:47:10,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:47:10,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 40 [2025-03-13 21:47:10,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 169 transitions, 1958 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:47:10,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:47:10,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 40 [2025-03-13 21:47:10,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:47:15,583 INFO L124 PetriNetUnfolderBase]: 63376/82952 cut-off events. [2025-03-13 21:47:15,583 INFO L125 PetriNetUnfolderBase]: For 392063/392063 co-relation queries the response was YES. [2025-03-13 21:47:15,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348850 conditions, 82952 events. 63376/82952 cut-off events. For 392063/392063 co-relation queries the response was YES. Maximal size of possible extension queue 2329. Compared 467533 event pairs, 7713 based on Foata normal form. 768/83720 useless extension candidates. Maximal degree in co-relation 329562. Up to 23087 conditions per place. [2025-03-13 21:47:16,192 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 495 selfloop transitions, 134 changer transitions 15/645 dead transitions. [2025-03-13 21:47:16,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 645 transitions, 7949 flow [2025-03-13 21:47:16,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:47:16,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:47:16,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 255 transitions. [2025-03-13 21:47:16,194 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5795454545454546 [2025-03-13 21:47:16,194 INFO L175 Difference]: Start difference. First operand has 119 places, 169 transitions, 1958 flow. Second operand 11 states and 255 transitions. [2025-03-13 21:47:16,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 645 transitions, 7949 flow [2025-03-13 21:47:18,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 645 transitions, 7915 flow, removed 17 selfloop flow, removed 0 redundant places. [2025-03-13 21:47:18,682 INFO L231 Difference]: Finished difference. Result has 135 places, 260 transitions, 3611 flow [2025-03-13 21:47:18,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1902, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3611, PETRI_PLACES=135, PETRI_TRANSITIONS=260} [2025-03-13 21:47:18,683 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 91 predicate places. [2025-03-13 21:47:18,683 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 260 transitions, 3611 flow [2025-03-13 21:47:18,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:47:18,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:47:18,683 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:47:18,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-13 21:47:18,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:47:18,884 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:47:18,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:47:18,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1519592250, now seen corresponding path program 5 times [2025-03-13 21:47:18,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:47:18,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637882752] [2025-03-13 21:47:18,884 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:47:18,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:47:18,890 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:47:18,893 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:47:18,894 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:47:18,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:47:18,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:47:18,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:47:18,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637882752] [2025-03-13 21:47:18,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637882752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:47:18,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:47:18,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:47:18,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881317767] [2025-03-13 21:47:18,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:47:18,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:47:18,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:47:18,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:47:18,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:47:18,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-03-13 21:47:18,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 260 transitions, 3611 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-13 21:47:18,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:47:18,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-03-13 21:47:18,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand