./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe019_pso.oepc_pso.opt_tso.oepc_tso.opt.i --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/pthread-wmm/safe019_pso.oepc_pso.opt_tso.oepc_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4633300b13c3e317f8d3cd1cc05f3f76ba271ffedabaa8599cd9617354fa2b7b --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:34:47,293 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:34:47,351 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:34:47,360 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:34:47,360 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:34:47,376 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:34:47,377 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:34:47,377 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:34:47,378 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:34:47,378 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:34:47,378 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:34:47,378 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:34:47,378 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:34:47,379 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:34:47,379 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:34:47,379 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:34:47,379 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:34:47,379 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:34:47,379 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:34:47,379 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:34:47,379 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:34:47,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:34:47,380 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:34:47,380 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:34:47,380 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:34:47,380 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:34:47,380 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:34:47,380 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:34:47,380 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:34:47,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:34:47,380 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:34:47,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:34:47,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:34:47,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:34:47,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:34:47,380 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:34:47,380 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:34:47,380 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:34:47,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:34:47,380 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:34:47,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:34:47,381 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:34:47,381 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:34:47,381 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 -> 4633300b13c3e317f8d3cd1cc05f3f76ba271ffedabaa8599cd9617354fa2b7b [2025-03-13 21:34:47,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:34:47,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:34:47,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:34:47,633 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:34:47,634 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:34:47,635 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe019_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2025-03-13 21:34:48,817 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/873deb0aa/1a7d22ead1704c9e98386761145abb59/FLAG59ed8bce5 [2025-03-13 21:34:49,107 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:34:49,107 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe019_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2025-03-13 21:34:49,117 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/873deb0aa/1a7d22ead1704c9e98386761145abb59/FLAG59ed8bce5 [2025-03-13 21:34:49,126 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/873deb0aa/1a7d22ead1704c9e98386761145abb59 [2025-03-13 21:34:49,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:34:49,129 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:34:49,131 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:34:49,131 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:34:49,134 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:34:49,134 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:34:49" (1/1) ... [2025-03-13 21:34:49,135 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c2e90f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:34:49, skipping insertion in model container [2025-03-13 21:34:49,135 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:34:49" (1/1) ... [2025-03-13 21:34:49,159 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:34:49,274 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe019_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2025-03-13 21:34:49,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:34:49,422 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:34:49,430 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe019_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2025-03-13 21:34:49,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:34:49,492 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:34:49,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:34:49 WrapperNode [2025-03-13 21:34:49,493 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:34:49,494 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:34:49,494 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:34:49,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:34:49,499 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:34:49" (1/1) ... [2025-03-13 21:34:49,511 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:34:49" (1/1) ... [2025-03-13 21:34:49,526 INFO L138 Inliner]: procedures = 176, calls = 46, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65 [2025-03-13 21:34:49,526 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:34:49,527 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:34:49,527 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:34:49,528 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:34:49,532 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:34:49" (1/1) ... [2025-03-13 21:34:49,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:34:49" (1/1) ... [2025-03-13 21:34:49,534 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:34:49" (1/1) ... [2025-03-13 21:34:49,549 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:34:49,549 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:34:49" (1/1) ... [2025-03-13 21:34:49,550 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:34:49" (1/1) ... [2025-03-13 21:34:49,552 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:34:49" (1/1) ... [2025-03-13 21:34:49,557 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:34:49" (1/1) ... [2025-03-13 21:34:49,558 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:34:49" (1/1) ... [2025-03-13 21:34:49,558 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:34:49" (1/1) ... [2025-03-13 21:34:49,561 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:34:49,561 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:34:49,563 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:34:49,563 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:34:49,564 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:34:49" (1/1) ... [2025-03-13 21:34:49,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:34:49,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:34:49,588 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:34:49,591 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:34:49,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 21:34:49,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:34:49,606 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-13 21:34:49,606 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-13 21:34:49,606 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-13 21:34:49,606 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-13 21:34:49,606 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-13 21:34:49,606 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-13 21:34:49,606 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-03-13 21:34:49,606 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-03-13 21:34:49,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:34:49,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 21:34:49,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:34:49,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:34:49,607 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:34:49,689 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:34:49,690 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:34:49,815 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:34:49,816 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:34:49,816 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:34:49,901 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:34:49,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:34:49 BoogieIcfgContainer [2025-03-13 21:34:49,902 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:34:49,904 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:34:49,904 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:34:49,908 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:34:49,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:34:49" (1/3) ... [2025-03-13 21:34:49,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a34654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:34:49, skipping insertion in model container [2025-03-13 21:34:49,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:34:49" (2/3) ... [2025-03-13 21:34:49,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a34654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:34:49, skipping insertion in model container [2025-03-13 21:34:49,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:34:49" (3/3) ... [2025-03-13 21:34:49,911 INFO L128 eAbstractionObserver]: Analyzing ICFG safe019_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2025-03-13 21:34:49,922 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:34:49,923 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe019_pso.oepc_pso.opt_tso.oepc_tso.opt.i that has 5 procedures, 45 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-13 21:34:49,923 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:34:49,960 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:34:49,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 45 transitions, 106 flow [2025-03-13 21:34:50,009 INFO L124 PetriNetUnfolderBase]: 1/41 cut-off events. [2025-03-13 21:34:50,011 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:34:50,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 41 events. 1/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2025-03-13 21:34:50,016 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 45 transitions, 106 flow [2025-03-13 21:34:50,019 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 38 transitions, 88 flow [2025-03-13 21:34:50,024 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:34:50,031 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;@576c4ff7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:34:50,032 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-13 21:34:50,043 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:34:50,043 INFO L124 PetriNetUnfolderBase]: 0/37 cut-off events. [2025-03-13 21:34:50,043 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:34:50,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:34:50,044 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:34:50,044 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:34:50,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:34:50,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1488636979, now seen corresponding path program 1 times [2025-03-13 21:34:50,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:34:50,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781700693] [2025-03-13 21:34:50,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:34:50,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:34:50,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-13 21:34:50,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-13 21:34:50,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:34:50,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:34:50,539 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:34:50,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:34:50,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781700693] [2025-03-13 21:34:50,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781700693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:34:50,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:34:50,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:34:50,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123272574] [2025-03-13 21:34:50,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:34:50,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:34:50,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:34:50,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:34:50,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:34:50,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2025-03-13 21:34:50,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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:34:50,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:34:50,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2025-03-13 21:34:50,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:34:52,398 INFO L124 PetriNetUnfolderBase]: 19981/28439 cut-off events. [2025-03-13 21:34:52,398 INFO L125 PetriNetUnfolderBase]: For 186/186 co-relation queries the response was YES. [2025-03-13 21:34:52,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55773 conditions, 28439 events. 19981/28439 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 1063. Compared 178117 event pairs, 2463 based on Foata normal form. 900/29325 useless extension candidates. Maximal degree in co-relation 55761. Up to 15601 conditions per place. [2025-03-13 21:34:52,601 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 65 selfloop transitions, 6 changer transitions 1/78 dead transitions. [2025-03-13 21:34:52,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 78 transitions, 321 flow [2025-03-13 21:34:52,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:34:52,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:34:52,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2025-03-13 21:34:52,615 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6555555555555556 [2025-03-13 21:34:52,616 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 88 flow. Second operand 4 states and 118 transitions. [2025-03-13 21:34:52,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 78 transitions, 321 flow [2025-03-13 21:34:52,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 78 transitions, 314 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-13 21:34:52,631 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 126 flow [2025-03-13 21:34:52,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2025-03-13 21:34:52,639 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 1 predicate places. [2025-03-13 21:34:52,639 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 126 flow [2025-03-13 21:34:52,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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:34:52,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:34:52,640 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:34:52,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:34:52,640 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:34:52,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:34:52,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1922238337, now seen corresponding path program 1 times [2025-03-13 21:34:52,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:34:52,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780591971] [2025-03-13 21:34:52,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:34:52,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:34:52,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 21:34:52,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:34:52,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:34:52,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:34:52,800 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:34:52,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:34:52,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780591971] [2025-03-13 21:34:52,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780591971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:34:52,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:34:52,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:34:52,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720567791] [2025-03-13 21:34:52,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:34:52,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:34:52,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:34:52,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:34:52,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:34:52,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2025-03-13 21:34:52,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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:34:52,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:34:52,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2025-03-13 21:34:52,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:34:54,033 INFO L124 PetriNetUnfolderBase]: 13861/19823 cut-off events. [2025-03-13 21:34:54,035 INFO L125 PetriNetUnfolderBase]: For 4080/4080 co-relation queries the response was YES. [2025-03-13 21:34:54,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45025 conditions, 19823 events. 13861/19823 cut-off events. For 4080/4080 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 116901 event pairs, 1337 based on Foata normal form. 756/20565 useless extension candidates. Maximal degree in co-relation 45013. Up to 8041 conditions per place. [2025-03-13 21:34:54,142 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 84 selfloop transitions, 10 changer transitions 1/101 dead transitions. [2025-03-13 21:34:54,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 101 transitions, 463 flow [2025-03-13 21:34:54,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:34:54,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:34:54,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2025-03-13 21:34:54,146 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6755555555555556 [2025-03-13 21:34:54,146 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 126 flow. Second operand 5 states and 152 transitions. [2025-03-13 21:34:54,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 101 transitions, 463 flow [2025-03-13 21:34:54,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 101 transitions, 452 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-13 21:34:54,155 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 178 flow [2025-03-13 21:34:54,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2025-03-13 21:34:54,157 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places. [2025-03-13 21:34:54,157 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 178 flow [2025-03-13 21:34:54,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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:34:54,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:34:54,157 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] [2025-03-13 21:34:54,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:34:54,158 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:34:54,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:34:54,160 INFO L85 PathProgramCache]: Analyzing trace with hash 701476521, now seen corresponding path program 1 times [2025-03-13 21:34:54,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:34:54,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691160700] [2025-03-13 21:34:54,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:34:54,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:34:54,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:34:54,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:34:54,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:34:54,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:34:54,311 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:34:54,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:34:54,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691160700] [2025-03-13 21:34:54,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691160700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:34:54,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:34:54,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:34:54,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027785616] [2025-03-13 21:34:54,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:34:54,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:34:54,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:34:54,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:34:54,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:34:54,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2025-03-13 21:34:54,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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:34:54,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:34:54,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2025-03-13 21:34:54,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:34:54,916 INFO L124 PetriNetUnfolderBase]: 8597/12179 cut-off events. [2025-03-13 21:34:54,916 INFO L125 PetriNetUnfolderBase]: For 7798/7798 co-relation queries the response was YES. [2025-03-13 21:34:54,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30639 conditions, 12179 events. 8597/12179 cut-off events. For 7798/7798 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 64455 event pairs, 1091 based on Foata normal form. 420/12585 useless extension candidates. Maximal degree in co-relation 30625. Up to 3644 conditions per place. [2025-03-13 21:34:54,968 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 101 selfloop transitions, 14 changer transitions 1/122 dead transitions. [2025-03-13 21:34:54,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 122 transitions, 610 flow [2025-03-13 21:34:54,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:34:54,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:34:54,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 184 transitions. [2025-03-13 21:34:54,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6814814814814815 [2025-03-13 21:34:54,970 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 178 flow. Second operand 6 states and 184 transitions. [2025-03-13 21:34:54,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 122 transitions, 610 flow [2025-03-13 21:34:55,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 122 transitions, 580 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-13 21:34:55,022 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 228 flow [2025-03-13 21:34:55,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=228, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2025-03-13 21:34:55,023 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 8 predicate places. [2025-03-13 21:34:55,023 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 228 flow [2025-03-13 21:34:55,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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:34:55,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:34:55,023 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:34:55,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:34:55,023 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:34:55,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:34:55,024 INFO L85 PathProgramCache]: Analyzing trace with hash 11299919, now seen corresponding path program 1 times [2025-03-13 21:34:55,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:34:55,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214824040] [2025-03-13 21:34:55,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:34:55,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:34:55,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-13 21:34:55,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:34:55,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:34:55,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:34:55,139 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:34:55,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:34:55,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214824040] [2025-03-13 21:34:55,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214824040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:34:55,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:34:55,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 21:34:55,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423823549] [2025-03-13 21:34:55,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:34:55,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:34:55,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:34:55,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:34:55,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:34:55,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2025-03-13 21:34:55,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 228 flow. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:34:55,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:34:55,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2025-03-13 21:34:55,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:34:55,715 INFO L124 PetriNetUnfolderBase]: 6433/8939 cut-off events. [2025-03-13 21:34:55,716 INFO L125 PetriNetUnfolderBase]: For 7858/7858 co-relation queries the response was YES. [2025-03-13 21:34:55,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23640 conditions, 8939 events. 6433/8939 cut-off events. For 7858/7858 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 44634 event pairs, 977 based on Foata normal form. 128/9053 useless extension candidates. Maximal degree in co-relation 23625. Up to 3076 conditions per place. [2025-03-13 21:34:55,763 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 88 selfloop transitions, 18 changer transitions 1/113 dead transitions. [2025-03-13 21:34:55,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 113 transitions, 584 flow [2025-03-13 21:34:55,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:34:55,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:34:55,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 186 transitions. [2025-03-13 21:34:55,766 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5904761904761905 [2025-03-13 21:34:55,766 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 228 flow. Second operand 7 states and 186 transitions. [2025-03-13 21:34:55,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 113 transitions, 584 flow [2025-03-13 21:34:55,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 113 transitions, 538 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-03-13 21:34:55,915 INFO L231 Difference]: Finished difference. Result has 62 places, 50 transitions, 238 flow [2025-03-13 21:34:55,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=238, PETRI_PLACES=62, PETRI_TRANSITIONS=50} [2025-03-13 21:34:55,915 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2025-03-13 21:34:55,916 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 238 flow [2025-03-13 21:34:55,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:34:55,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:34:55,916 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:34:55,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:34:55,916 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:34:55,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:34:55,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1423199274, now seen corresponding path program 1 times [2025-03-13 21:34:55,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:34:55,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199739403] [2025-03-13 21:34:55,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:34:55,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:34:55,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 21:34:55,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 21:34:55,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:34:55,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:34:56,055 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:34:56,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:34:56,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199739403] [2025-03-13 21:34:56,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199739403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:34:56,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:34:56,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:34:56,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863707310] [2025-03-13 21:34:56,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:34:56,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:34:56,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:34:56,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:34:56,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:34:56,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-13 21:34:56,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 238 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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:34:56,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:34:56,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-13 21:34:56,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:34:56,592 INFO L124 PetriNetUnfolderBase]: 8857/12289 cut-off events. [2025-03-13 21:34:56,593 INFO L125 PetriNetUnfolderBase]: For 11038/11038 co-relation queries the response was YES. [2025-03-13 21:34:56,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32543 conditions, 12289 events. 8857/12289 cut-off events. For 11038/11038 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 63805 event pairs, 3721 based on Foata normal form. 16/12279 useless extension candidates. Maximal degree in co-relation 32527. Up to 6635 conditions per place. [2025-03-13 21:34:56,635 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 64 selfloop transitions, 2 changer transitions 23/94 dead transitions. [2025-03-13 21:34:56,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 94 transitions, 632 flow [2025-03-13 21:34:56,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:34:56,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:34:56,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2025-03-13 21:34:56,636 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5155555555555555 [2025-03-13 21:34:56,637 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 238 flow. Second operand 5 states and 116 transitions. [2025-03-13 21:34:56,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 94 transitions, 632 flow [2025-03-13 21:34:56,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 94 transitions, 443 flow, removed 34 selfloop flow, removed 10 redundant places. [2025-03-13 21:34:56,719 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 154 flow [2025-03-13 21:34:56,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=154, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2025-03-13 21:34:56,720 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 8 predicate places. [2025-03-13 21:34:56,720 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 154 flow [2025-03-13 21:34:56,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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:34:56,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:34:56,720 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:34:56,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:34:56,721 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:34:56,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:34:56,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1416021352, now seen corresponding path program 2 times [2025-03-13 21:34:56,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:34:56,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474060776] [2025-03-13 21:34:56,721 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:34:56,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:34:56,728 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 1 equivalence classes. [2025-03-13 21:34:56,735 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 21:34:56,735 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:34:56,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:34:56,861 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:34:56,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:34:56,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474060776] [2025-03-13 21:34:56,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474060776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:34:56,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:34:56,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 21:34:56,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908463621] [2025-03-13 21:34:56,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:34:56,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:34:56,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:34:56,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:34:56,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:34:56,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-13 21:34:56,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 154 flow. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:34:56,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:34:56,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-13 21:34:56,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:34:57,414 INFO L124 PetriNetUnfolderBase]: 7945/11137 cut-off events. [2025-03-13 21:34:57,414 INFO L125 PetriNetUnfolderBase]: For 2002/2002 co-relation queries the response was YES. [2025-03-13 21:34:57,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26152 conditions, 11137 events. 7945/11137 cut-off events. For 2002/2002 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 56874 event pairs, 1309 based on Foata normal form. 16/11141 useless extension candidates. Maximal degree in co-relation 26139. Up to 5256 conditions per place. [2025-03-13 21:34:57,453 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 69 selfloop transitions, 3 changer transitions 30/107 dead transitions. [2025-03-13 21:34:57,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 107 transitions, 524 flow [2025-03-13 21:34:57,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:34:57,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:34:57,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2025-03-13 21:34:57,454 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5074074074074074 [2025-03-13 21:34:57,454 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 154 flow. Second operand 6 states and 137 transitions. [2025-03-13 21:34:57,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 107 transitions, 524 flow [2025-03-13 21:34:57,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 107 transitions, 508 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-13 21:34:57,458 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 158 flow [2025-03-13 21:34:57,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=158, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2025-03-13 21:34:57,459 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2025-03-13 21:34:57,459 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 158 flow [2025-03-13 21:34:57,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:34:57,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:34:57,459 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:34:57,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:34:57,459 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:34:57,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:34:57,460 INFO L85 PathProgramCache]: Analyzing trace with hash -651531486, now seen corresponding path program 3 times [2025-03-13 21:34:57,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:34:57,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269505535] [2025-03-13 21:34:57,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:34:57,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:34:57,467 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 1 equivalence classes. [2025-03-13 21:34:57,472 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 21:34:57,472 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:34:57,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:34:57,570 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:34:57,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:34:57,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269505535] [2025-03-13 21:34:57,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269505535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:34:57,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:34:57,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 21:34:57,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360940784] [2025-03-13 21:34:57,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:34:57,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:34:57,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:34:57,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:34:57,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:34:57,577 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-13 21:34:57,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 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:34:57,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:34:57,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-13 21:34:57,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:34:58,050 INFO L124 PetriNetUnfolderBase]: 6135/8593 cut-off events. [2025-03-13 21:34:58,050 INFO L125 PetriNetUnfolderBase]: For 1630/1630 co-relation queries the response was YES. [2025-03-13 21:34:58,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20017 conditions, 8593 events. 6135/8593 cut-off events. For 1630/1630 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 42562 event pairs, 1063 based on Foata normal form. 16/8608 useless extension candidates. Maximal degree in co-relation 20003. Up to 4616 conditions per place. [2025-03-13 21:34:58,079 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 63 selfloop transitions, 1 changer transitions 47/116 dead transitions. [2025-03-13 21:34:58,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 116 transitions, 582 flow [2025-03-13 21:34:58,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:34:58,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:34:58,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2025-03-13 21:34:58,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5259259259259259 [2025-03-13 21:34:58,080 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 158 flow. Second operand 6 states and 142 transitions. [2025-03-13 21:34:58,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 116 transitions, 582 flow [2025-03-13 21:34:58,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 116 transitions, 562 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-13 21:34:58,083 INFO L231 Difference]: Finished difference. Result has 63 places, 50 transitions, 157 flow [2025-03-13 21:34:58,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=157, PETRI_PLACES=63, PETRI_TRANSITIONS=50} [2025-03-13 21:34:58,084 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 12 predicate places. [2025-03-13 21:34:58,084 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 50 transitions, 157 flow [2025-03-13 21:34:58,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 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:34:58,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:34:58,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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:34:58,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:34:58,084 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:34:58,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:34:58,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1734769676, now seen corresponding path program 4 times [2025-03-13 21:34:58,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:34:58,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252329279] [2025-03-13 21:34:58,085 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:34:58,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:34:58,091 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-03-13 21:34:58,097 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 21:34:58,097 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:34:58,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:34:58,200 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:34:58,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:34:58,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252329279] [2025-03-13 21:34:58,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252329279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:34:58,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:34:58,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 21:34:58,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830034386] [2025-03-13 21:34:58,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:34:58,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:34:58,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:34:58,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:34:58,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:34:58,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-13 21:34:58,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 50 transitions, 157 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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:34:58,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:34:58,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-13 21:34:58,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:34:58,649 INFO L124 PetriNetUnfolderBase]: 5975/8472 cut-off events. [2025-03-13 21:34:58,649 INFO L125 PetriNetUnfolderBase]: For 2786/2786 co-relation queries the response was YES. [2025-03-13 21:34:58,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19714 conditions, 8472 events. 5975/8472 cut-off events. For 2786/2786 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 41597 event pairs, 1367 based on Foata normal form. 16/8485 useless extension candidates. Maximal degree in co-relation 19700. Up to 3584 conditions per place. [2025-03-13 21:34:58,670 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 55 selfloop transitions, 3 changer transitions 46/109 dead transitions. [2025-03-13 21:34:58,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 109 transitions, 549 flow [2025-03-13 21:34:58,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:34:58,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:34:58,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2025-03-13 21:34:58,672 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2025-03-13 21:34:58,672 INFO L175 Difference]: Start difference. First operand has 63 places, 50 transitions, 157 flow. Second operand 6 states and 129 transitions. [2025-03-13 21:34:58,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 109 transitions, 549 flow [2025-03-13 21:34:58,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 109 transitions, 536 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-13 21:34:58,674 INFO L231 Difference]: Finished difference. Result has 64 places, 50 transitions, 164 flow [2025-03-13 21:34:58,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=164, PETRI_PLACES=64, PETRI_TRANSITIONS=50} [2025-03-13 21:34:58,675 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2025-03-13 21:34:58,675 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 50 transitions, 164 flow [2025-03-13 21:34:58,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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:34:58,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:34:58,675 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:34:58,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:34:58,676 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:34:58,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:34:58,676 INFO L85 PathProgramCache]: Analyzing trace with hash 646634036, now seen corresponding path program 5 times [2025-03-13 21:34:58,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:34:58,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940158113] [2025-03-13 21:34:58,676 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:34:58,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:34:58,682 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 1 equivalence classes. [2025-03-13 21:34:58,687 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 21:34:58,692 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:34:58,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:34:58,793 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:34:58,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:34:58,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940158113] [2025-03-13 21:34:58,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940158113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:34:58,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:34:58,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 21:34:58,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989968973] [2025-03-13 21:34:58,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:34:58,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:34:58,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:34:58,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:34:58,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:34:58,801 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-13 21:34:58,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 50 transitions, 164 flow. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:34:58,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:34:58,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-13 21:34:58,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:34:59,043 INFO L124 PetriNetUnfolderBase]: 3487/5001 cut-off events. [2025-03-13 21:34:59,044 INFO L125 PetriNetUnfolderBase]: For 1992/1992 co-relation queries the response was YES. [2025-03-13 21:34:59,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12228 conditions, 5001 events. 3487/5001 cut-off events. For 1992/1992 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 23671 event pairs, 783 based on Foata normal form. 16/5016 useless extension candidates. Maximal degree in co-relation 12221. Up to 3240 conditions per place. [2025-03-13 21:34:59,054 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 0 selfloop transitions, 0 changer transitions 112/112 dead transitions. [2025-03-13 21:34:59,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 112 transitions, 574 flow [2025-03-13 21:34:59,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:34:59,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:34:59,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 153 transitions. [2025-03-13 21:34:59,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2025-03-13 21:34:59,056 INFO L175 Difference]: Start difference. First operand has 64 places, 50 transitions, 164 flow. Second operand 7 states and 153 transitions. [2025-03-13 21:34:59,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 112 transitions, 574 flow [2025-03-13 21:34:59,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 112 transitions, 550 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-03-13 21:34:59,059 INFO L231 Difference]: Finished difference. Result has 61 places, 0 transitions, 0 flow [2025-03-13 21:34:59,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=61, PETRI_TRANSITIONS=0} [2025-03-13 21:34:59,059 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2025-03-13 21:34:59,059 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 0 transitions, 0 flow [2025-03-13 21:34:59,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:34:59,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-03-13 21:34:59,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-03-13 21:34:59,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-03-13 21:34:59,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-03-13 21:34:59,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-03-13 21:34:59,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:34:59,063 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1] [2025-03-13 21:34:59,065 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 21:34:59,065 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 21:34:59,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 09:34:59 BasicIcfg [2025-03-13 21:34:59,069 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 21:34:59,070 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 21:34:59,070 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 21:34:59,070 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 21:34:59,071 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:34:49" (3/4) ... [2025-03-13 21:34:59,072 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-13 21:34:59,074 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P0 [2025-03-13 21:34:59,074 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P1 [2025-03-13 21:34:59,074 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P2 [2025-03-13 21:34:59,074 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P3 [2025-03-13 21:34:59,077 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2025-03-13 21:34:59,077 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-13 21:34:59,077 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-13 21:34:59,077 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-13 21:34:59,131 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 21:34:59,131 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 21:34:59,131 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 21:34:59,132 INFO L158 Benchmark]: Toolchain (without parser) took 10002.61ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 110.9MB in the beginning and 686.6MB in the end (delta: -575.6MB). Peak memory consumption was 539.9MB. Max. memory is 16.1GB. [2025-03-13 21:34:59,133 INFO L158 Benchmark]: CDTParser took 0.70ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:34:59,133 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.05ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 90.3MB in the end (delta: 20.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 21:34:59,133 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.08ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 88.7MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 21:34:59,133 INFO L158 Benchmark]: Boogie Preprocessor took 33.75ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 87.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:34:59,134 INFO L158 Benchmark]: IcfgBuilder took 340.56ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 64.0MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-13 21:34:59,134 INFO L158 Benchmark]: TraceAbstraction took 9165.25ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 63.5MB in the beginning and 690.9MB in the end (delta: -627.4MB). Peak memory consumption was 481.2MB. Max. memory is 16.1GB. [2025-03-13 21:34:59,134 INFO L158 Benchmark]: Witness Printer took 61.67ms. Allocated memory is still 1.3GB. Free memory was 690.9MB in the beginning and 686.6MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 21:34:59,136 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.70ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 363.05ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 90.3MB in the end (delta: 20.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.08ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 88.7MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.75ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 87.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 340.56ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 64.0MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9165.25ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 63.5MB in the beginning and 690.9MB in the end (delta: -627.4MB). Peak memory consumption was 481.2MB. Max. memory is 16.1GB. * Witness Printer took 61.67ms. Allocated memory is still 1.3GB. Free memory was 690.9MB in the beginning and 686.6MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 75 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 764 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 752 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1483 IncrementalHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 15 mSDtfsCounter, 1483 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=238occurred in iteration=4, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 259 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 929 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-13 21:34:59,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE