./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe019_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe019_rmo.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 2ad190c36ab064f1e4bfbebf06775e6b037058a5a86becabf7b70897d3619304 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:05:08,686 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:05:08,800 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 01:05:08,805 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:05:08,806 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:05:08,843 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:05:08,843 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:05:08,843 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:05:08,850 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:05:08,850 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:05:08,850 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:05:08,850 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:05:08,850 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:05:08,850 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:05:08,850 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:05:08,850 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:05:08,850 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:05:08,850 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:05:08,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:05:08,851 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:05:08,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:05:08,851 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:05:08,851 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:05:08,851 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:05:08,851 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:05:08,851 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:05:08,851 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:05:08,851 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:05:08,851 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:05:08,851 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:05:08,851 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:05:08,851 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:05:08,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:05:08,851 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:05:08,851 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:05:08,851 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:05:08,851 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:05:08,852 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:05:08,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:05:08,852 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:05:08,852 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:05:08,852 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:05:08,852 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:05:08,852 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-jdk21/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 -> 2ad190c36ab064f1e4bfbebf06775e6b037058a5a86becabf7b70897d3619304 [2025-02-08 01:05:09,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:05:09,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:05:09,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:05:09,351 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:05:09,351 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:05:09,352 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe019_rmo.opt.i [2025-02-08 01:05:10,568 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b48f99b8/0e367aebe4514b36bc1a07b012e622d5/FLAG9bcb76c5f [2025-02-08 01:05:11,031 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:05:11,032 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe019_rmo.opt.i [2025-02-08 01:05:11,060 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b48f99b8/0e367aebe4514b36bc1a07b012e622d5/FLAG9bcb76c5f [2025-02-08 01:05:11,097 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b48f99b8/0e367aebe4514b36bc1a07b012e622d5 [2025-02-08 01:05:11,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:05:11,106 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:05:11,107 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:05:11,108 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:05:11,117 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:05:11,118 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:05:11" (1/1) ... [2025-02-08 01:05:11,123 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bb9ad36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:05:11, skipping insertion in model container [2025-02-08 01:05:11,124 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:05:11" (1/1) ... [2025-02-08 01:05:11,184 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:05:11,422 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe019_rmo.opt.i[992,1005] [2025-02-08 01:05:11,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:05:11,621 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:05:11,632 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe019_rmo.opt.i[992,1005] [2025-02-08 01:05:11,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:05:11,723 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:05:11,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:05:11 WrapperNode [2025-02-08 01:05:11,725 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:05:11,726 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:05:11,726 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:05:11,727 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:05:11,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:05:11" (1/1) ... [2025-02-08 01:05:11,747 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:05:11" (1/1) ... [2025-02-08 01:05:11,778 INFO L138 Inliner]: procedures = 176, calls = 70, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 136 [2025-02-08 01:05:11,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:05:11,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:05:11,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:05:11,784 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:05:11,794 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:05:11" (1/1) ... [2025-02-08 01:05:11,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:05:11" (1/1) ... [2025-02-08 01:05:11,801 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:05:11" (1/1) ... [2025-02-08 01:05:11,832 INFO L175 MemorySlicer]: Split 25 memory accesses to 2 slices as follows [2, 23]. 92 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 9 writes are split as follows [0, 9]. [2025-02-08 01:05:11,833 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:05:11" (1/1) ... [2025-02-08 01:05:11,836 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:05:11" (1/1) ... [2025-02-08 01:05:11,847 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:05:11" (1/1) ... [2025-02-08 01:05:11,848 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:05:11" (1/1) ... [2025-02-08 01:05:11,853 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:05:11" (1/1) ... [2025-02-08 01:05:11,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:05:11" (1/1) ... [2025-02-08 01:05:11,861 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:05:11,862 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:05:11,865 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:05:11,865 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:05:11,866 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:05:11" (1/1) ... [2025-02-08 01:05:11,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:05:11,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:05:11,899 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 01:05:11,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 01:05:11,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 01:05:11,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 01:05:11,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 01:05:11,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 01:05:11,922 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 01:05:11,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:05:11,922 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-08 01:05:11,922 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-08 01:05:11,923 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-08 01:05:11,923 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-08 01:05:11,923 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-08 01:05:11,923 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-08 01:05:11,923 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-02-08 01:05:11,923 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-02-08 01:05:11,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:05:11,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:05:11,923 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 01:05:11,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:05:11,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:05:11,925 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 01:05:12,038 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:05:12,040 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:05:12,333 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:05:12,333 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:05:12,569 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:05:12,569 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:05:12,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:05:12 BoogieIcfgContainer [2025-02-08 01:05:12,570 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:05:12,572 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:05:12,573 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:05:12,576 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:05:12,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:05:11" (1/3) ... [2025-02-08 01:05:12,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@656b79d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:05:12, skipping insertion in model container [2025-02-08 01:05:12,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:05:11" (2/3) ... [2025-02-08 01:05:12,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@656b79d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:05:12, skipping insertion in model container [2025-02-08 01:05:12,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:05:12" (3/3) ... [2025-02-08 01:05:12,578 INFO L128 eAbstractionObserver]: Analyzing ICFG safe019_rmo.opt.i [2025-02-08 01:05:12,590 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:05:12,592 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe019_rmo.opt.i that has 5 procedures, 45 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-08 01:05:12,593 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:05:12,695 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 01:05:12,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 45 transitions, 106 flow [2025-02-08 01:05:12,776 INFO L124 PetriNetUnfolderBase]: 1/41 cut-off events. [2025-02-08 01:05:12,777 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 01:05:12,779 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 5. Compared 81 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-02-08 01:05:12,780 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 45 transitions, 106 flow [2025-02-08 01:05:12,781 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 38 transitions, 88 flow [2025-02-08 01:05:12,787 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:05:12,795 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;@24ff91d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:05:12,795 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-08 01:05:12,806 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:05:12,806 INFO L124 PetriNetUnfolderBase]: 0/37 cut-off events. [2025-02-08 01:05:12,806 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 01:05:12,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:05:12,807 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:05:12,807 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-02-08 01:05:12,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:05:12,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1655388003, now seen corresponding path program 1 times [2025-02-08 01:05:12,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:05:12,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389521790] [2025-02-08 01:05:12,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:05:12,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:05:12,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 01:05:12,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 01:05:12,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:05:12,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:05:13,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:05:13,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:05:13,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389521790] [2025-02-08 01:05:13,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389521790] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:05:13,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:05:13,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:05:13,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841122924] [2025-02-08 01:05:13,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:05:13,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:05:13,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:05:13,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:05:13,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:05:13,441 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-02-08 01:05:13,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:05:13,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:05:13,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-02-08 01:05:13,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:05:17,522 INFO L124 PetriNetUnfolderBase]: 28003/38145 cut-off events. [2025-02-08 01:05:17,523 INFO L125 PetriNetUnfolderBase]: For 186/186 co-relation queries the response was YES. [2025-02-08 01:05:17,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75841 conditions, 38145 events. 28003/38145 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 1326. Compared 222801 event pairs, 6795 based on Foata normal form. 900/38975 useless extension candidates. Maximal degree in co-relation 75829. Up to 28979 conditions per place. [2025-02-08 01:05:17,776 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 48 selfloop transitions, 3 changer transitions 63/119 dead transitions. [2025-02-08 01:05:17,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 119 transitions, 481 flow [2025-02-08 01:05:17,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:05:17,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:05:17,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 179 transitions. [2025-02-08 01:05:17,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5682539682539682 [2025-02-08 01:05:17,797 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 88 flow. Second operand 7 states and 179 transitions. [2025-02-08 01:05:17,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 119 transitions, 481 flow [2025-02-08 01:05:17,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 119 transitions, 476 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 01:05:17,817 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 119 flow [2025-02-08 01:05:17,820 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=119, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2025-02-08 01:05:17,824 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2025-02-08 01:05:17,824 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 119 flow [2025-02-08 01:05:17,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:05:17,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:05:17,824 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:05:17,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:05:17,825 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-02-08 01:05:17,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:05:17,826 INFO L85 PathProgramCache]: Analyzing trace with hash -475094658, now seen corresponding path program 1 times [2025-02-08 01:05:17,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:05:17,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896686352] [2025-02-08 01:05:17,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:05:17,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:05:17,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 01:05:17,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 01:05:17,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:05:17,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:05:18,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:05:18,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:05:18,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896686352] [2025-02-08 01:05:18,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896686352] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:05:18,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:05:18,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:05:18,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010528812] [2025-02-08 01:05:18,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:05:18,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:05:18,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:05:18,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:05:18,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:05:18,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-02-08 01:05:18,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-02-08 01:05:18,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:05:18,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-02-08 01:05:18,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:05:21,790 INFO L124 PetriNetUnfolderBase]: 26276/35701 cut-off events. [2025-02-08 01:05:21,791 INFO L125 PetriNetUnfolderBase]: For 18761/18761 co-relation queries the response was YES. [2025-02-08 01:05:21,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84313 conditions, 35701 events. 26276/35701 cut-off events. For 18761/18761 co-relation queries the response was YES. Maximal size of possible extension queue 1172. Compared 210900 event pairs, 3362 based on Foata normal form. 840/36527 useless extension candidates. Maximal degree in co-relation 84298. Up to 25961 conditions per place. [2025-02-08 01:05:21,984 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 58 selfloop transitions, 2 changer transitions 65/130 dead transitions. [2025-02-08 01:05:21,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 130 transitions, 631 flow [2025-02-08 01:05:21,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:05:21,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:05:21,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 186 transitions. [2025-02-08 01:05:21,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5904761904761905 [2025-02-08 01:05:21,988 INFO L175 Difference]: Start difference. First operand has 58 places, 40 transitions, 119 flow. Second operand 7 states and 186 transitions. [2025-02-08 01:05:21,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 130 transitions, 631 flow [2025-02-08 01:05:22,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 130 transitions, 618 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-02-08 01:05:22,307 INFO L231 Difference]: Finished difference. Result has 62 places, 40 transitions, 128 flow [2025-02-08 01:05:22,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=128, PETRI_PLACES=62, PETRI_TRANSITIONS=40} [2025-02-08 01:05:22,307 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2025-02-08 01:05:22,308 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 40 transitions, 128 flow [2025-02-08 01:05:22,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-02-08 01:05:22,309 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:05:22,309 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-02-08 01:05:22,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:05:22,309 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-02-08 01:05:22,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:05:22,313 INFO L85 PathProgramCache]: Analyzing trace with hash 630706111, now seen corresponding path program 1 times [2025-02-08 01:05:22,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:05:22,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298022207] [2025-02-08 01:05:22,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:05:22,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:05:22,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 01:05:22,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 01:05:22,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:05:22,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:05:22,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:05:22,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:05:22,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298022207] [2025-02-08 01:05:22,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298022207] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:05:22,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:05:22,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:05:22,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042086439] [2025-02-08 01:05:22,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:05:22,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:05:22,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:05:22,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:05:22,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:05:22,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-02-08 01:05:22,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 40 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:05:22,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:05:22,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-02-08 01:05:22,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:05:25,560 INFO L124 PetriNetUnfolderBase]: 23847/32409 cut-off events. [2025-02-08 01:05:25,561 INFO L125 PetriNetUnfolderBase]: For 19872/19872 co-relation queries the response was YES. [2025-02-08 01:05:25,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79590 conditions, 32409 events. 23847/32409 cut-off events. For 19872/19872 co-relation queries the response was YES. Maximal size of possible extension queue 968. Compared 178796 event pairs, 6007 based on Foata normal form. 600/32968 useless extension candidates. Maximal degree in co-relation 79571. Up to 24496 conditions per place. [2025-02-08 01:05:25,771 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 52 selfloop transitions, 2 changer transitions 57/116 dead transitions. [2025-02-08 01:05:25,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 116 transitions, 537 flow [2025-02-08 01:05:25,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:05:25,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:05:25,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2025-02-08 01:05:25,773 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5523809523809524 [2025-02-08 01:05:25,773 INFO L175 Difference]: Start difference. First operand has 62 places, 40 transitions, 128 flow. Second operand 7 states and 174 transitions. [2025-02-08 01:05:25,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 116 transitions, 537 flow [2025-02-08 01:05:26,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 116 transitions, 515 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-02-08 01:05:26,238 INFO L231 Difference]: Finished difference. Result has 63 places, 40 transitions, 132 flow [2025-02-08 01:05:26,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=132, PETRI_PLACES=63, PETRI_TRANSITIONS=40} [2025-02-08 01:05:26,238 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 12 predicate places. [2025-02-08 01:05:26,238 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 40 transitions, 132 flow [2025-02-08 01:05:26,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:05:26,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:05:26,239 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] [2025-02-08 01:05:26,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:05:26,239 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-02-08 01:05:26,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:05:26,240 INFO L85 PathProgramCache]: Analyzing trace with hash 48440450, now seen corresponding path program 1 times [2025-02-08 01:05:26,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:05:26,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307528623] [2025-02-08 01:05:26,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:05:26,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:05:26,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 01:05:26,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 01:05:26,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:05:26,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:05:26,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:05:26,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:05:26,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307528623] [2025-02-08 01:05:26,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307528623] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:05:26,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:05:26,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:05:26,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818148413] [2025-02-08 01:05:26,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:05:26,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:05:26,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:05:26,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:05:26,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:05:26,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-02-08 01:05:26,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 40 transitions, 132 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-02-08 01:05:26,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:05:26,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-02-08 01:05:26,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:05:31,081 INFO L124 PetriNetUnfolderBase]: 35112/47494 cut-off events. [2025-02-08 01:05:31,082 INFO L125 PetriNetUnfolderBase]: For 28779/28779 co-relation queries the response was YES. [2025-02-08 01:05:31,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114439 conditions, 47494 events. 35112/47494 cut-off events. For 28779/28779 co-relation queries the response was YES. Maximal size of possible extension queue 1382. Compared 278393 event pairs, 13830 based on Foata normal form. 900/48324 useless extension candidates. Maximal degree in co-relation 114419. Up to 22124 conditions per place. [2025-02-08 01:05:31,504 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 55 selfloop transitions, 3 changer transitions 61/124 dead transitions. [2025-02-08 01:05:31,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 124 transitions, 583 flow [2025-02-08 01:05:31,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:05:31,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:05:31,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 183 transitions. [2025-02-08 01:05:31,506 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.580952380952381 [2025-02-08 01:05:31,506 INFO L175 Difference]: Start difference. First operand has 63 places, 40 transitions, 132 flow. Second operand 7 states and 183 transitions. [2025-02-08 01:05:31,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 124 transitions, 583 flow [2025-02-08 01:05:32,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 124 transitions, 549 flow, removed 15 selfloop flow, removed 6 redundant places. [2025-02-08 01:05:32,484 INFO L231 Difference]: Finished difference. Result has 64 places, 40 transitions, 137 flow [2025-02-08 01:05:32,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=137, PETRI_PLACES=64, PETRI_TRANSITIONS=40} [2025-02-08 01:05:32,486 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2025-02-08 01:05:32,486 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 40 transitions, 137 flow [2025-02-08 01:05:32,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-02-08 01:05:32,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:05:32,486 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] [2025-02-08 01:05:32,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:05:32,487 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-02-08 01:05:32,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:05:32,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1367111904, now seen corresponding path program 1 times [2025-02-08 01:05:32,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:05:32,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766135882] [2025-02-08 01:05:32,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:05:32,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:05:32,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 01:05:32,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 01:05:32,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:05:32,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:05:32,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:05:32,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:05:32,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766135882] [2025-02-08 01:05:32,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766135882] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:05:32,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:05:32,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:05:32,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003019186] [2025-02-08 01:05:32,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:05:32,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:05:32,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:05:32,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:05:32,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:05:32,755 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-02-08 01:05:32,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 40 transitions, 137 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 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-02-08 01:05:32,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:05:32,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-02-08 01:05:32,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:05:39,754 INFO L124 PetriNetUnfolderBase]: 51907/70389 cut-off events. [2025-02-08 01:05:39,755 INFO L125 PetriNetUnfolderBase]: For 48917/48917 co-relation queries the response was YES. [2025-02-08 01:05:40,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166629 conditions, 70389 events. 51907/70389 cut-off events. For 48917/48917 co-relation queries the response was YES. Maximal size of possible extension queue 2162. Compared 432236 event pairs, 7505 based on Foata normal form. 900/71219 useless extension candidates. Maximal degree in co-relation 166609. Up to 34381 conditions per place. [2025-02-08 01:05:40,184 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 60 selfloop transitions, 4 changer transitions 42/111 dead transitions. [2025-02-08 01:05:40,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 111 transitions, 546 flow [2025-02-08 01:05:40,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:05:40,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:05:40,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2025-02-08 01:05:40,185 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5962962962962963 [2025-02-08 01:05:40,185 INFO L175 Difference]: Start difference. First operand has 64 places, 40 transitions, 137 flow. Second operand 6 states and 161 transitions. [2025-02-08 01:05:40,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 111 transitions, 546 flow [2025-02-08 01:05:41,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 111 transitions, 519 flow, removed 10 selfloop flow, removed 5 redundant places. [2025-02-08 01:05:41,305 INFO L231 Difference]: Finished difference. Result has 63 places, 40 transitions, 139 flow [2025-02-08 01:05:41,305 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=139, PETRI_PLACES=63, PETRI_TRANSITIONS=40} [2025-02-08 01:05:41,306 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 12 predicate places. [2025-02-08 01:05:41,306 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 40 transitions, 139 flow [2025-02-08 01:05:41,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 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-02-08 01:05:41,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:05:41,306 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] [2025-02-08 01:05:41,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:05:41,306 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-02-08 01:05:41,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:05:41,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1463021408, now seen corresponding path program 2 times [2025-02-08 01:05:41,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:05:41,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634774580] [2025-02-08 01:05:41,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:05:41,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:05:41,318 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-02-08 01:05:41,335 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 01:05:41,336 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:05:41,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:05:42,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:05:42,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:05:42,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634774580] [2025-02-08 01:05:42,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634774580] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:05:42,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:05:42,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:05:42,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798636955] [2025-02-08 01:05:42,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:05:42,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:05:42,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:05:42,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:05:42,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:05:42,150 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-02-08 01:05:42,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 40 transitions, 139 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:05:42,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:05:42,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-02-08 01:05:42,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand