./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version e2fb8bed
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/mix053_tso.oepc.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 9a8131f8693d82039b4018f716a17d0a3e1038ace11c7bb21b12bc911efac3c1
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 17:19:33,411 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 17:19:33,466 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-08 17:19:33,472 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 17:19:33,472 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 17:19:33,494 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 17:19:33,495 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 17:19:33,495 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 17:19:33,495 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 17:19:33,495 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 17:19:33,495 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 17:19:33,496 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 17:19:33,496 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 17:19:33,496 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 17:19:33,496 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 17:19:33,496 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 17:19:33,496 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 17:19:33,496 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 17:19:33,496 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-08 17:19:33,496 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 17:19:33,496 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 17:19:33,496 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 17:19:33,496 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 17:19:33,496 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 17:19:33,496 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 17:19:33,496 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 17:19:33,496 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 17:19:33,497 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 17:19:33,497 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 17:19:33,497 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 17:19:33,497 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 17:19:33,497 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 17:19:33,497 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 17:19:33,497 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 17:19:33,497 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 17:19:33,497 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 17:19:33,497 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 17:19:33,497 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-08 17:19:33,497 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-08 17:19:33,497 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 17:19:33,497 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 17:19:33,497 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 17:19:33,497 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 17:19:33,497 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 -> 9a8131f8693d82039b4018f716a17d0a3e1038ace11c7bb21b12bc911efac3c1
[2025-03-08 17:19:33,719 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 17:19:33,724 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 17:19:33,725 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 17:19:33,726 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 17:19:33,726 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 17:19:33,726 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i
[2025-03-08 17:19:34,838 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/156e55683/e25d832b93604cc19a8726e54596cc90/FLAGe06868475
[2025-03-08 17:19:35,105 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 17:19:35,107 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i
[2025-03-08 17:19:35,121 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/156e55683/e25d832b93604cc19a8726e54596cc90/FLAGe06868475
[2025-03-08 17:19:35,138 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/156e55683/e25d832b93604cc19a8726e54596cc90
[2025-03-08 17:19:35,141 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 17:19:35,142 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 17:19:35,143 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 17:19:35,144 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 17:19:35,147 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 17:19:35,148 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:19:35" (1/1) ...
[2025-03-08 17:19:35,149 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@502fee3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:35, skipping insertion in model container
[2025-03-08 17:19:35,149 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:19:35" (1/1) ...
[2025-03-08 17:19:35,181 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 17:19:35,315 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/mix053_tso.oepc.i[949,962]
[2025-03-08 17:19:35,471 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 17:19:35,479 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 17:19:35,490 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/mix053_tso.oepc.i[949,962]
[2025-03-08 17:19:35,532 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 17:19:35,564 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 17:19:35,564 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:35 WrapperNode
[2025-03-08 17:19:35,565 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 17:19:35,566 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 17:19:35,566 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 17:19:35,566 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 17:19:35,570 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:35" (1/1) ...
[2025-03-08 17:19:35,585 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:35" (1/1) ...
[2025-03-08 17:19:35,608 INFO  L138                Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145
[2025-03-08 17:19:35,609 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 17:19:35,609 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 17:19:35,610 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 17:19:35,610 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 17:19:35,620 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:35" (1/1) ...
[2025-03-08 17:19:35,620 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:35" (1/1) ...
[2025-03-08 17:19:35,622 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:35" (1/1) ...
[2025-03-08 17:19:35,638 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-08 17:19:35,639 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:35" (1/1) ...
[2025-03-08 17:19:35,639 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:35" (1/1) ...
[2025-03-08 17:19:35,649 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:35" (1/1) ...
[2025-03-08 17:19:35,651 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:35" (1/1) ...
[2025-03-08 17:19:35,652 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:35" (1/1) ...
[2025-03-08 17:19:35,657 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:35" (1/1) ...
[2025-03-08 17:19:35,659 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 17:19:35,664 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 17:19:35,664 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 17:19:35,664 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 17:19:35,666 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:35" (1/1) ...
[2025-03-08 17:19:35,670 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 17:19:35,681 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 17:19:35,693 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-08 17:19:35,696 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-08 17:19:35,715 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2025-03-08 17:19:35,715 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 17:19:35,715 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2025-03-08 17:19:35,715 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2025-03-08 17:19:35,716 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2025-03-08 17:19:35,716 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2025-03-08 17:19:35,716 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2025-03-08 17:19:35,717 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2025-03-08 17:19:35,717 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2025-03-08 17:19:35,717 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2025-03-08 17:19:35,717 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 17:19:35,717 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2025-03-08 17:19:35,717 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 17:19:35,717 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 17:19:35,718 WARN  L225             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2025-03-08 17:19:35,823 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 17:19:35,825 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 17:19:36,086 INFO  L303             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2025-03-08 17:19:36,087 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 17:19:36,265 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 17:19:36,265 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 17:19:36,266 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:19:36 BoogieIcfgContainer
[2025-03-08 17:19:36,266 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 17:19:36,268 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 17:19:36,268 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 17:19:36,271 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 17:19:36,271 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:19:35" (1/3) ...
[2025-03-08 17:19:36,272 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a82570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:19:36, skipping insertion in model container
[2025-03-08 17:19:36,272 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:35" (2/3) ...
[2025-03-08 17:19:36,273 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a82570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:19:36, skipping insertion in model container
[2025-03-08 17:19:36,273 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:19:36" (3/3) ...
[2025-03-08 17:19:36,274 INFO  L128   eAbstractionObserver]: Analyzing ICFG mix053_tso.oepc.i
[2025-03-08 17:19:36,285 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 17:19:36,288 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG mix053_tso.oepc.i that has 5 procedures, 48 locations, 1 initial locations, 0 loop locations, and 2 error locations.
[2025-03-08 17:19:36,289 INFO  L491   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2025-03-08 17:19:36,339 INFO  L143    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2025-03-08 17:19:36,369 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 60 places, 48 transitions, 112 flow
[2025-03-08 17:19:36,397 INFO  L124   PetriNetUnfolderBase]: 1/44 cut-off events.
[2025-03-08 17:19:36,399 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-03-08 17:19:36,403 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 57 conditions, 44 events. 1/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 90 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. 
[2025-03-08 17:19:36,404 INFO  L82        GeneralOperation]: Start removeDead. Operand has 60 places, 48 transitions, 112 flow
[2025-03-08 17:19:36,406 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 56 places, 44 transitions, 100 flow
[2025-03-08 17:19:36,412 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 17:19:36,424 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;@6b66a1b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 17:19:36,425 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2025-03-08 17:19:36,431 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2025-03-08 17:19:36,431 INFO  L124   PetriNetUnfolderBase]: 0/17 cut-off events.
[2025-03-08 17:19:36,431 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-03-08 17:19:36,431 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-08 17:19:36,432 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 17:19:36,432 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-03-08 17:19:36,436 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:19:36,437 INFO  L85        PathProgramCache]: Analyzing trace with hash 257480423, now seen corresponding path program 1 times
[2025-03-08 17:19:36,442 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 17:19:36,444 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431032452]
[2025-03-08 17:19:36,444 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 17:19:36,445 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 17:19:36,534 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes.
[2025-03-08 17:19:36,566 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements.
[2025-03-08 17:19:36,568 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 17:19:36,568 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:19:36,831 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-08 17:19:36,831 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 17:19:36,831 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431032452]
[2025-03-08 17:19:36,831 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431032452] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 17:19:36,831 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 17:19:36,832 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2025-03-08 17:19:36,834 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576691538]
[2025-03-08 17:19:36,834 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 17:19:36,838 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 17:19:36,842 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 17:19:36,857 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 17:19:36,857 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 17:19:36,858 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2025-03-08 17:19:36,860 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 flow. Second operand  has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-08 17:19:36,860 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-08 17:19:36,860 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2025-03-08 17:19:36,860 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-08 17:19:40,121 INFO  L124   PetriNetUnfolderBase]: 34475/45924 cut-off events.
[2025-03-08 17:19:40,121 INFO  L125   PetriNetUnfolderBase]: For 244/244 co-relation queries the response was YES.
[2025-03-08 17:19:40,189 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 91808 conditions, 45924 events. 34475/45924 cut-off events. For 244/244 co-relation queries the response was YES. Maximal size of possible extension queue 1418. Compared 269294 event pairs, 4355 based on Foata normal form. 1260/46940 useless extension candidates. Maximal degree in co-relation 91796. Up to 39121 conditions per place. 
[2025-03-08 17:19:40,344 INFO  L140   encePairwiseOnDemand]: 44/48 looper letters, 55 selfloop transitions, 2 changer transitions 2/66 dead transitions.
[2025-03-08 17:19:40,345 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 66 transitions, 265 flow
[2025-03-08 17:19:40,346 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 17:19:40,348 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-08 17:19:40,355 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions.
[2025-03-08 17:19:40,357 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.6597222222222222
[2025-03-08 17:19:40,358 INFO  L175             Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 3 states and 95 transitions.
[2025-03-08 17:19:40,359 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 66 transitions, 265 flow
[2025-03-08 17:19:40,364 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 66 transitions, 260 flow, removed 0 selfloop flow, removed 4 redundant places.
[2025-03-08 17:19:40,368 INFO  L231             Difference]: Finished difference. Result has 53 places, 41 transitions, 94 flow
[2025-03-08 17:19:40,370 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=53, PETRI_TRANSITIONS=41}
[2025-03-08 17:19:40,374 INFO  L279   CegarLoopForPetriNet]: 56 programPoint places, -3 predicate places.
[2025-03-08 17:19:40,374 INFO  L471      AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 94 flow
[2025-03-08 17:19:40,375 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-08 17:19:40,375 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-08 17:19:40,375 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 17:19:40,375 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-08 17:19:40,375 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-03-08 17:19:40,376 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:19:40,377 INFO  L85        PathProgramCache]: Analyzing trace with hash 1887319244, now seen corresponding path program 1 times
[2025-03-08 17:19:40,377 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 17:19:40,377 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105275432]
[2025-03-08 17:19:40,377 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 17:19:40,377 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 17:19:40,394 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-03-08 17:19:40,453 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-03-08 17:19:40,456 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 17:19:40,456 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:19:40,639 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-08 17:19:40,640 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 17:19:40,640 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105275432]
[2025-03-08 17:19:40,640 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105275432] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 17:19:40,640 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 17:19:40,640 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 17:19:40,640 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616644909]
[2025-03-08 17:19:40,640 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 17:19:40,641 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 17:19:40,641 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 17:19:40,641 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 17:19:40,642 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 17:19:40,642 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2025-03-08 17:19:40,642 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 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-08 17:19:40,643 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-08 17:19:40,643 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2025-03-08 17:19:40,643 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-08 17:19:43,064 INFO  L124   PetriNetUnfolderBase]: 28315/41073 cut-off events.
[2025-03-08 17:19:43,064 INFO  L125   PetriNetUnfolderBase]: For 1480/1480 co-relation queries the response was YES.
[2025-03-08 17:19:43,142 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 80995 conditions, 41073 events. 28315/41073 cut-off events. For 1480/1480 co-relation queries the response was YES. Maximal size of possible extension queue 1408. Compared 277305 event pairs, 3739 based on Foata normal form. 1296/41280 useless extension candidates. Maximal degree in co-relation 80985. Up to 21681 conditions per place. 
[2025-03-08 17:19:43,233 INFO  L140   encePairwiseOnDemand]: 41/48 looper letters, 71 selfloop transitions, 6 changer transitions 1/85 dead transitions.
[2025-03-08 17:19:43,234 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 85 transitions, 348 flow
[2025-03-08 17:19:43,234 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 17:19:43,234 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2025-03-08 17:19:43,235 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions.
[2025-03-08 17:19:43,235 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.6458333333333334
[2025-03-08 17:19:43,235 INFO  L175             Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 4 states and 124 transitions.
[2025-03-08 17:19:43,235 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 85 transitions, 348 flow
[2025-03-08 17:19:43,238 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 85 transitions, 340 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-08 17:19:43,240 INFO  L231             Difference]: Finished difference. Result has 55 places, 45 transitions, 132 flow
[2025-03-08 17:19:43,240 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=55, PETRI_TRANSITIONS=45}
[2025-03-08 17:19:43,240 INFO  L279   CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places.
[2025-03-08 17:19:43,241 INFO  L471      AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 132 flow
[2025-03-08 17:19:43,241 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-08 17:19:43,241 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-08 17:19:43,241 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-03-08 17:19:43,241 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 17:19:43,241 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-03-08 17:19:43,242 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:19:43,242 INFO  L85        PathProgramCache]: Analyzing trace with hash 2014740957, now seen corresponding path program 1 times
[2025-03-08 17:19:43,243 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 17:19:43,243 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309993466]
[2025-03-08 17:19:43,243 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 17:19:43,243 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 17:19:43,254 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes.
[2025-03-08 17:19:43,280 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements.
[2025-03-08 17:19:43,281 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 17:19:43,281 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:19:43,439 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-08 17:19:43,439 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 17:19:43,439 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309993466]
[2025-03-08 17:19:43,440 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309993466] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 17:19:43,440 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 17:19:43,440 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 17:19:43,440 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133269415]
[2025-03-08 17:19:43,440 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 17:19:43,441 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 17:19:43,441 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 17:19:43,441 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 17:19:43,442 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 17:19:43,442 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2025-03-08 17:19:43,442 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 132 flow. Second operand  has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 17:19:43,442 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-08 17:19:43,442 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2025-03-08 17:19:43,443 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-08 17:19:44,787 INFO  L124   PetriNetUnfolderBase]: 18843/27249 cut-off events.
[2025-03-08 17:19:44,787 INFO  L125   PetriNetUnfolderBase]: For 5234/5234 co-relation queries the response was YES.
[2025-03-08 17:19:44,851 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 60865 conditions, 27249 events. 18843/27249 cut-off events. For 5234/5234 co-relation queries the response was YES. Maximal size of possible extension queue 785. Compared 169603 event pairs, 2151 based on Foata normal form. 1040/27712 useless extension candidates. Maximal degree in co-relation 60853. Up to 10161 conditions per place. 
[2025-03-08 17:19:44,908 INFO  L140   encePairwiseOnDemand]: 41/48 looper letters, 92 selfloop transitions, 10 changer transitions 1/110 dead transitions.
[2025-03-08 17:19:44,908 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 110 transitions, 497 flow
[2025-03-08 17:19:44,909 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 17:19:44,909 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2025-03-08 17:19:44,909 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions.
[2025-03-08 17:19:44,909 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.6666666666666666
[2025-03-08 17:19:44,909 INFO  L175             Difference]: Start difference. First operand has 55 places, 45 transitions, 132 flow. Second operand 5 states and 160 transitions.
[2025-03-08 17:19:44,909 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 110 transitions, 497 flow
[2025-03-08 17:19:44,918 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 110 transitions, 486 flow, removed 1 selfloop flow, removed 2 redundant places.
[2025-03-08 17:19:44,919 INFO  L231             Difference]: Finished difference. Result has 59 places, 49 transitions, 184 flow
[2025-03-08 17:19:44,919 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=184, PETRI_PLACES=59, PETRI_TRANSITIONS=49}
[2025-03-08 17:19:44,920 INFO  L279   CegarLoopForPetriNet]: 56 programPoint places, 3 predicate places.
[2025-03-08 17:19:44,921 INFO  L471      AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 184 flow
[2025-03-08 17:19:44,921 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 17:19:44,921 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-08 17:19:44,921 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 17:19:44,921 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 17:19:44,921 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-03-08 17:19:44,922 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:19:44,922 INFO  L85        PathProgramCache]: Analyzing trace with hash -1685076794, now seen corresponding path program 1 times
[2025-03-08 17:19:44,922 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 17:19:44,922 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683544341]
[2025-03-08 17:19:44,922 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 17:19:44,922 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 17:19:44,933 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes.
[2025-03-08 17:19:44,971 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements.
[2025-03-08 17:19:44,974 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 17:19:44,975 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:19:45,151 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-08 17:19:45,151 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 17:19:45,151 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683544341]
[2025-03-08 17:19:45,151 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683544341] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 17:19:45,151 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 17:19:45,151 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 17:19:45,151 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745576660]
[2025-03-08 17:19:45,151 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 17:19:45,152 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 17:19:45,152 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 17:19:45,152 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 17:19:45,152 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-08 17:19:45,152 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2025-03-08 17:19:45,152 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 184 flow. Second operand  has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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-08 17:19:45,153 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-08 17:19:45,153 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2025-03-08 17:19:45,153 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-08 17:19:45,988 INFO  L124   PetriNetUnfolderBase]: 11675/16497 cut-off events.
[2025-03-08 17:19:45,988 INFO  L125   PetriNetUnfolderBase]: For 9934/9934 co-relation queries the response was YES.
[2025-03-08 17:19:46,012 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40749 conditions, 16497 events. 11675/16497 cut-off events. For 9934/9934 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 89774 event pairs, 1839 based on Foata normal form. 528/16832 useless extension candidates. Maximal degree in co-relation 40735. Up to 4800 conditions per place. 
[2025-03-08 17:19:46,046 INFO  L140   encePairwiseOnDemand]: 41/48 looper letters, 111 selfloop transitions, 14 changer transitions 1/133 dead transitions.
[2025-03-08 17:19:46,046 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 133 transitions, 652 flow
[2025-03-08 17:19:46,046 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 17:19:46,046 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-03-08 17:19:46,047 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions.
[2025-03-08 17:19:46,047 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.6736111111111112
[2025-03-08 17:19:46,047 INFO  L175             Difference]: Start difference. First operand has 59 places, 49 transitions, 184 flow. Second operand 6 states and 194 transitions.
[2025-03-08 17:19:46,047 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 133 transitions, 652 flow
[2025-03-08 17:19:46,145 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 133 transitions, 622 flow, removed 5 selfloop flow, removed 4 redundant places.
[2025-03-08 17:19:46,146 INFO  L231             Difference]: Finished difference. Result has 62 places, 53 transitions, 234 flow
[2025-03-08 17:19:46,146 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=234, PETRI_PLACES=62, PETRI_TRANSITIONS=53}
[2025-03-08 17:19:46,146 INFO  L279   CegarLoopForPetriNet]: 56 programPoint places, 6 predicate places.
[2025-03-08 17:19:46,146 INFO  L471      AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 234 flow
[2025-03-08 17:19:46,147 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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-08 17:19:46,147 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-08 17:19:46,147 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]
[2025-03-08 17:19:46,147 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 17:19:46,147 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-03-08 17:19:46,147 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:19:46,147 INFO  L85        PathProgramCache]: Analyzing trace with hash -1498034861, now seen corresponding path program 1 times
[2025-03-08 17:19:46,147 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 17:19:46,147 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066651609]
[2025-03-08 17:19:46,147 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 17:19:46,147 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 17:19:46,155 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes.
[2025-03-08 17:19:46,186 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements.
[2025-03-08 17:19:46,187 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 17:19:46,187 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:19:46,375 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-08 17:19:46,375 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 17:19:46,375 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066651609]
[2025-03-08 17:19:46,375 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066651609] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 17:19:46,375 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 17:19:46,375 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 17:19:46,375 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48479861]
[2025-03-08 17:19:46,375 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 17:19:46,376 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 17:19:46,376 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 17:19:46,377 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 17:19:46,377 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-08 17:19:46,378 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2025-03-08 17:19:46,378 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 234 flow. Second operand  has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 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-08 17:19:46,378 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-08 17:19:46,378 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2025-03-08 17:19:46,378 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-08 17:19:47,100 INFO  L124   PetriNetUnfolderBase]: 9051/12465 cut-off events.
[2025-03-08 17:19:47,100 INFO  L125   PetriNetUnfolderBase]: For 9846/9846 co-relation queries the response was YES.
[2025-03-08 17:19:47,122 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32142 conditions, 12465 events. 9051/12465 cut-off events. For 9846/9846 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 63712 event pairs, 1687 based on Foata normal form. 144/12544 useless extension candidates. Maximal degree in co-relation 32127. Up to 4608 conditions per place. 
[2025-03-08 17:19:47,153 INFO  L140   encePairwiseOnDemand]: 41/48 looper letters, 96 selfloop transitions, 18 changer transitions 1/122 dead transitions.
[2025-03-08 17:19:47,153 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 122 transitions, 618 flow
[2025-03-08 17:19:47,155 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 17:19:47,156 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2025-03-08 17:19:47,156 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 194 transitions.
[2025-03-08 17:19:47,156 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.5773809523809523
[2025-03-08 17:19:47,156 INFO  L175             Difference]: Start difference. First operand has 62 places, 53 transitions, 234 flow. Second operand 7 states and 194 transitions.
[2025-03-08 17:19:47,156 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 122 transitions, 618 flow
[2025-03-08 17:19:47,278 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 122 transitions, 572 flow, removed 9 selfloop flow, removed 5 redundant places.
[2025-03-08 17:19:47,279 INFO  L231             Difference]: Finished difference. Result has 65 places, 53 transitions, 244 flow
[2025-03-08 17:19:47,279 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=244, PETRI_PLACES=65, PETRI_TRANSITIONS=53}
[2025-03-08 17:19:47,280 INFO  L279   CegarLoopForPetriNet]: 56 programPoint places, 9 predicate places.
[2025-03-08 17:19:47,280 INFO  L471      AbstractCegarLoop]: Abstraction has has 65 places, 53 transitions, 244 flow
[2025-03-08 17:19:47,280 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 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-08 17:19:47,280 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-08 17:19:47,280 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 17:19:47,280 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-08 17:19:47,280 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-03-08 17:19:47,281 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:19:47,281 INFO  L85        PathProgramCache]: Analyzing trace with hash 1870875143, now seen corresponding path program 1 times
[2025-03-08 17:19:47,281 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 17:19:47,281 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973900171]
[2025-03-08 17:19:47,281 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 17:19:47,281 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 17:19:47,291 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes.
[2025-03-08 17:19:47,364 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements.
[2025-03-08 17:19:47,364 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 17:19:47,365 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:19:48,134 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-08 17:19:48,134 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 17:19:48,135 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973900171]
[2025-03-08 17:19:48,135 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973900171] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 17:19:48,135 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 17:19:48,135 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-08 17:19:48,135 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980803695]
[2025-03-08 17:19:48,135 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 17:19:48,135 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 17:19:48,135 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 17:19:48,136 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 17:19:48,136 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-03-08 17:19:48,143 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48
[2025-03-08 17:19:48,143 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 53 transitions, 244 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-08 17:19:48,143 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-08 17:19:48,143 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48
[2025-03-08 17:19:48,144 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-08 17:19:50,057 INFO  L124   PetriNetUnfolderBase]: 18335/25273 cut-off events.
[2025-03-08 17:19:50,057 INFO  L125   PetriNetUnfolderBase]: For 21938/21938 co-relation queries the response was YES.
[2025-03-08 17:19:50,168 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 65687 conditions, 25273 events. 18335/25273 cut-off events. For 21938/21938 co-relation queries the response was YES. Maximal size of possible extension queue 843. Compared 139094 event pairs, 1115 based on Foata normal form. 16/25174 useless extension candidates. Maximal degree in co-relation 65671. Up to 9710 conditions per place. 
[2025-03-08 17:19:50,237 INFO  L140   encePairwiseOnDemand]: 34/48 looper letters, 109 selfloop transitions, 16 changer transitions 49/180 dead transitions.
[2025-03-08 17:19:50,237 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 180 transitions, 1210 flow
[2025-03-08 17:19:50,238 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 17:19:50,238 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2025-03-08 17:19:50,238 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 207 transitions.
[2025-03-08 17:19:50,239 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.5390625
[2025-03-08 17:19:50,239 INFO  L175             Difference]: Start difference. First operand has 65 places, 53 transitions, 244 flow. Second operand 8 states and 207 transitions.
[2025-03-08 17:19:50,239 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 180 transitions, 1210 flow
[2025-03-08 17:19:50,580 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 180 transitions, 856 flow, removed 51 selfloop flow, removed 10 redundant places.
[2025-03-08 17:19:50,582 INFO  L231             Difference]: Finished difference. Result has 68 places, 67 transitions, 268 flow
[2025-03-08 17:19:50,582 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=268, PETRI_PLACES=68, PETRI_TRANSITIONS=67}
[2025-03-08 17:19:50,582 INFO  L279   CegarLoopForPetriNet]: 56 programPoint places, 12 predicate places.
[2025-03-08 17:19:50,582 INFO  L471      AbstractCegarLoop]: Abstraction has has 68 places, 67 transitions, 268 flow
[2025-03-08 17:19:50,583 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-08 17:19:50,583 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-08 17:19:50,583 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 17:19:50,583 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-08 17:19:50,583 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-03-08 17:19:50,583 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:19:50,583 INFO  L85        PathProgramCache]: Analyzing trace with hash 852975967, now seen corresponding path program 2 times
[2025-03-08 17:19:50,583 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 17:19:50,583 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148058891]
[2025-03-08 17:19:50,583 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-03-08 17:19:50,583 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 17:19:50,594 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 1 equivalence classes.
[2025-03-08 17:19:50,692 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 36 statements.
[2025-03-08 17:19:50,692 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-03-08 17:19:50,692 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:19:50,962 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-08 17:19:50,963 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 17:19:50,963 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148058891]
[2025-03-08 17:19:50,963 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148058891] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 17:19:50,963 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 17:19:50,963 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 17:19:50,963 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98253903]
[2025-03-08 17:19:50,963 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 17:19:50,963 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 17:19:50,964 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 17:19:50,964 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 17:19:50,964 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-08 17:19:50,970 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48
[2025-03-08 17:19:50,970 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 67 transitions, 268 flow. Second operand  has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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-08 17:19:50,970 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-08 17:19:50,971 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48
[2025-03-08 17:19:50,971 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-08 17:19:52,442 INFO  L124   PetriNetUnfolderBase]: 19947/27954 cut-off events.
[2025-03-08 17:19:52,442 INFO  L125   PetriNetUnfolderBase]: For 18428/18438 co-relation queries the response was YES.
[2025-03-08 17:19:52,572 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 77597 conditions, 27954 events. 19947/27954 cut-off events. For 18428/18438 co-relation queries the response was YES. Maximal size of possible extension queue 938. Compared 162208 event pairs, 4355 based on Foata normal form. 16/27957 useless extension candidates. Maximal degree in co-relation 77580. Up to 16500 conditions per place. 
[2025-03-08 17:19:52,614 INFO  L140   encePairwiseOnDemand]: 43/48 looper letters, 71 selfloop transitions, 1 changer transitions 69/147 dead transitions.
[2025-03-08 17:19:52,614 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 147 transitions, 862 flow
[2025-03-08 17:19:52,615 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 17:19:52,615 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-03-08 17:19:52,615 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions.
[2025-03-08 17:19:52,615 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.5138888888888888
[2025-03-08 17:19:52,615 INFO  L175             Difference]: Start difference. First operand has 68 places, 67 transitions, 268 flow. Second operand 6 states and 148 transitions.
[2025-03-08 17:19:52,616 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 147 transitions, 862 flow
[2025-03-08 17:19:52,628 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 147 transitions, 852 flow, removed 5 selfloop flow, removed 3 redundant places.
[2025-03-08 17:19:52,629 INFO  L231             Difference]: Finished difference. Result has 71 places, 60 transitions, 237 flow
[2025-03-08 17:19:52,629 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=71, PETRI_TRANSITIONS=60}
[2025-03-08 17:19:52,630 INFO  L279   CegarLoopForPetriNet]: 56 programPoint places, 15 predicate places.
[2025-03-08 17:19:52,630 INFO  L471      AbstractCegarLoop]: Abstraction has has 71 places, 60 transitions, 237 flow
[2025-03-08 17:19:52,630 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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-08 17:19:52,630 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-08 17:19:52,630 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 17:19:52,630 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-08 17:19:52,630 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-03-08 17:19:52,631 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:19:52,631 INFO  L85        PathProgramCache]: Analyzing trace with hash -30447609, now seen corresponding path program 3 times
[2025-03-08 17:19:52,631 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 17:19:52,631 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636286401]
[2025-03-08 17:19:52,631 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-03-08 17:19:52,631 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 17:19:52,642 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 1 equivalence classes.
[2025-03-08 17:19:52,690 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 36 statements.
[2025-03-08 17:19:52,690 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2025-03-08 17:19:52,690 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:19:53,153 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-08 17:19:53,154 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 17:19:53,154 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636286401]
[2025-03-08 17:19:53,154 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636286401] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 17:19:53,154 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 17:19:53,154 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 17:19:53,154 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569587443]
[2025-03-08 17:19:53,154 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 17:19:53,155 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 17:19:53,156 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 17:19:53,156 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 17:19:53,157 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 17:19:53,161 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48
[2025-03-08 17:19:53,163 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 60 transitions, 237 flow. Second operand  has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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-08 17:19:53,163 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-08 17:19:53,163 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48
[2025-03-08 17:19:53,163 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-08 17:19:54,020 INFO  L124   PetriNetUnfolderBase]: 11325/16277 cut-off events.
[2025-03-08 17:19:54,020 INFO  L125   PetriNetUnfolderBase]: For 11076/11076 co-relation queries the response was YES.
[2025-03-08 17:19:54,079 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43976 conditions, 16277 events. 11325/16277 cut-off events. For 11076/11076 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 91875 event pairs, 3183 based on Foata normal form. 16/16290 useless extension candidates. Maximal degree in co-relation 43957. Up to 8946 conditions per place. 
[2025-03-08 17:19:54,101 INFO  L140   encePairwiseOnDemand]: 41/48 looper letters, 64 selfloop transitions, 5 changer transitions 32/107 dead transitions.
[2025-03-08 17:19:54,101 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 107 transitions, 597 flow
[2025-03-08 17:19:54,101 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 17:19:54,101 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-03-08 17:19:54,102 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions.
[2025-03-08 17:19:54,102 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.4618055555555556
[2025-03-08 17:19:54,102 INFO  L175             Difference]: Start difference. First operand has 71 places, 60 transitions, 237 flow. Second operand 6 states and 133 transitions.
[2025-03-08 17:19:54,102 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 107 transitions, 597 flow
[2025-03-08 17:19:54,111 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 107 transitions, 585 flow, removed 5 selfloop flow, removed 4 redundant places.
[2025-03-08 17:19:54,112 INFO  L231             Difference]: Finished difference. Result has 72 places, 56 transitions, 226 flow
[2025-03-08 17:19:54,112 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=226, PETRI_PLACES=72, PETRI_TRANSITIONS=56}
[2025-03-08 17:19:54,112 INFO  L279   CegarLoopForPetriNet]: 56 programPoint places, 16 predicate places.
[2025-03-08 17:19:54,113 INFO  L471      AbstractCegarLoop]: Abstraction has has 72 places, 56 transitions, 226 flow
[2025-03-08 17:19:54,113 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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-08 17:19:54,113 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-08 17:19:54,113 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 17:19:54,113 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-08 17:19:54,113 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-03-08 17:19:54,113 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:19:54,113 INFO  L85        PathProgramCache]: Analyzing trace with hash 1511363127, now seen corresponding path program 4 times
[2025-03-08 17:19:54,113 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 17:19:54,113 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095932723]
[2025-03-08 17:19:54,113 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-03-08 17:19:54,113 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 17:19:54,121 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes.
[2025-03-08 17:19:54,181 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements.
[2025-03-08 17:19:54,182 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s)
[2025-03-08 17:19:54,182 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:19:55,111 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-08 17:19:55,112 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 17:19:55,112 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095932723]
[2025-03-08 17:19:55,112 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095932723] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 17:19:55,112 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 17:19:55,112 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-03-08 17:19:55,112 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902061696]
[2025-03-08 17:19:55,112 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 17:19:55,113 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-08 17:19:55,113 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 17:19:55,113 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-08 17:19:55,113 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2025-03-08 17:19:55,119 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48
[2025-03-08 17:19:55,120 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 56 transitions, 226 flow. Second operand  has 10 states, 10 states have (on average 13.1) internal successors, (131), 10 states have internal predecessors, (131), 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-08 17:19:55,120 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-08 17:19:55,120 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48
[2025-03-08 17:19:55,120 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-08 17:19:55,640 INFO  L124   PetriNetUnfolderBase]: 5271/7699 cut-off events.
[2025-03-08 17:19:55,640 INFO  L125   PetriNetUnfolderBase]: For 5066/5066 co-relation queries the response was YES.
[2025-03-08 17:19:55,656 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21029 conditions, 7699 events. 5271/7699 cut-off events. For 5066/5066 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 38855 event pairs, 877 based on Foata normal form. 16/7714 useless extension candidates. Maximal degree in co-relation 21009. Up to 4756 conditions per place. 
[2025-03-08 17:19:55,667 INFO  L140   encePairwiseOnDemand]: 40/48 looper letters, 78 selfloop transitions, 10 changer transitions 20/114 dead transitions.
[2025-03-08 17:19:55,667 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 114 transitions, 652 flow
[2025-03-08 17:19:55,667 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 17:19:55,667 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2025-03-08 17:19:55,668 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions.
[2025-03-08 17:19:55,668 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.4166666666666667
[2025-03-08 17:19:55,668 INFO  L175             Difference]: Start difference. First operand has 72 places, 56 transitions, 226 flow. Second operand 8 states and 160 transitions.
[2025-03-08 17:19:55,669 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 114 transitions, 652 flow
[2025-03-08 17:19:55,671 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 114 transitions, 629 flow, removed 7 selfloop flow, removed 5 redundant places.
[2025-03-08 17:19:55,673 INFO  L231             Difference]: Finished difference. Result has 75 places, 61 transitions, 267 flow
[2025-03-08 17:19:55,673 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=267, PETRI_PLACES=75, PETRI_TRANSITIONS=61}
[2025-03-08 17:19:55,674 INFO  L279   CegarLoopForPetriNet]: 56 programPoint places, 19 predicate places.
[2025-03-08 17:19:55,674 INFO  L471      AbstractCegarLoop]: Abstraction has has 75 places, 61 transitions, 267 flow
[2025-03-08 17:19:55,674 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.1) internal successors, (131), 10 states have internal predecessors, (131), 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-08 17:19:55,674 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-08 17:19:55,674 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 17:19:55,674 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-08 17:19:55,675 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-03-08 17:19:55,675 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:19:55,675 INFO  L85        PathProgramCache]: Analyzing trace with hash -1102089867, now seen corresponding path program 5 times
[2025-03-08 17:19:55,675 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 17:19:55,676 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134033781]
[2025-03-08 17:19:55,676 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-03-08 17:19:55,676 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 17:19:55,683 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 1 equivalence classes.
[2025-03-08 17:19:55,725 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 36 statements.
[2025-03-08 17:19:55,725 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-03-08 17:19:55,725 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:19:56,843 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-08 17:19:56,843 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 17:19:56,844 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134033781]
[2025-03-08 17:19:56,844 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134033781] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 17:19:56,844 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 17:19:56,844 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-08 17:19:56,844 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867951726]
[2025-03-08 17:19:56,844 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 17:19:56,845 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-03-08 17:19:56,845 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 17:19:56,845 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-03-08 17:19:56,845 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2025-03-08 17:19:56,860 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48
[2025-03-08 17:19:56,860 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 61 transitions, 267 flow. Second operand  has 11 states, 11 states have (on average 12.818181818181818) internal successors, (141), 11 states have internal predecessors, (141), 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-08 17:19:56,860 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-08 17:19:56,861 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48
[2025-03-08 17:19:56,861 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-08 17:19:57,548 INFO  L124   PetriNetUnfolderBase]: 5991/8755 cut-off events.
[2025-03-08 17:19:57,549 INFO  L125   PetriNetUnfolderBase]: For 6998/6998 co-relation queries the response was YES.
[2025-03-08 17:19:57,572 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24373 conditions, 8755 events. 5991/8755 cut-off events. For 6998/6998 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 44732 event pairs, 1531 based on Foata normal form. 16/8770 useless extension candidates. Maximal degree in co-relation 24353. Up to 3572 conditions per place. 
[2025-03-08 17:19:57,585 INFO  L140   encePairwiseOnDemand]: 41/48 looper letters, 67 selfloop transitions, 4 changer transitions 49/126 dead transitions.
[2025-03-08 17:19:57,585 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 126 transitions, 741 flow
[2025-03-08 17:19:57,585 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 17:19:57,586 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2025-03-08 17:19:57,586 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions.
[2025-03-08 17:19:57,586 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.4244791666666667
[2025-03-08 17:19:57,586 INFO  L175             Difference]: Start difference. First operand has 75 places, 61 transitions, 267 flow. Second operand 8 states and 163 transitions.
[2025-03-08 17:19:57,586 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 126 transitions, 741 flow
[2025-03-08 17:19:57,591 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 126 transitions, 732 flow, removed 3 selfloop flow, removed 4 redundant places.
[2025-03-08 17:19:57,592 INFO  L231             Difference]: Finished difference. Result has 80 places, 59 transitions, 262 flow
[2025-03-08 17:19:57,592 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=262, PETRI_PLACES=80, PETRI_TRANSITIONS=59}
[2025-03-08 17:19:57,593 INFO  L279   CegarLoopForPetriNet]: 56 programPoint places, 24 predicate places.
[2025-03-08 17:19:57,593 INFO  L471      AbstractCegarLoop]: Abstraction has has 80 places, 59 transitions, 262 flow
[2025-03-08 17:19:57,593 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 12.818181818181818) internal successors, (141), 11 states have internal predecessors, (141), 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-08 17:19:57,593 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-08 17:19:57,593 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 17:19:57,593 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-08 17:19:57,594 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-03-08 17:19:57,594 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:19:57,594 INFO  L85        PathProgramCache]: Analyzing trace with hash 2046547661, now seen corresponding path program 6 times
[2025-03-08 17:19:57,594 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 17:19:57,594 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685343702]
[2025-03-08 17:19:57,594 INFO  L95    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2025-03-08 17:19:57,594 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 17:19:57,601 INFO  L108    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 1 equivalence classes.
[2025-03-08 17:19:57,634 INFO  L111    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 36 of 36 statements.
[2025-03-08 17:19:57,634 INFO  L114    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s)
[2025-03-08 17:19:57,634 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-08 17:19:57,634 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-03-08 17:19:57,640 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes.
[2025-03-08 17:19:57,679 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements.
[2025-03-08 17:19:57,679 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 17:19:57,679 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-08 17:19:57,709 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-03-08 17:19:57,710 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-03-08 17:19:57,710 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining)
[2025-03-08 17:19:57,712 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining)
[2025-03-08 17:19:57,712 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining)
[2025-03-08 17:19:57,712 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining)
[2025-03-08 17:19:57,712 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining)
[2025-03-08 17:19:57,712 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining)
[2025-03-08 17:19:57,712 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining)
[2025-03-08 17:19:57,713 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-08 17:19:57,713 INFO  L422         BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1]
[2025-03-08 17:19:57,778 INFO  L241   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2025-03-08 17:19:57,779 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-08 17:19:57,784 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:19:57 BasicIcfg
[2025-03-08 17:19:57,784 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-08 17:19:57,785 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-08 17:19:57,785 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-08 17:19:57,785 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-08 17:19:57,786 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:19:36" (3/4) ...
[2025-03-08 17:19:57,786 INFO  L140         WitnessPrinter]: Generating witness for reachability counterexample
[2025-03-08 17:19:57,872 INFO  L127   tionWitnessGenerator]: Generated YAML witness of length 9.
[2025-03-08 17:19:57,911 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-03-08 17:19:57,912 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-03-08 17:19:57,912 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-08 17:19:57,912 INFO  L158              Benchmark]: Toolchain (without parser) took 22770.74ms. Allocated memory was 201.3MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 158.3MB in the beginning and 1.0GB in the end (delta: -882.8MB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB.
[2025-03-08 17:19:57,913 INFO  L158              Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 114.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 17:19:57,913 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 422.07ms. Allocated memory is still 201.3MB. Free memory was 158.3MB in the beginning and 134.5MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2025-03-08 17:19:57,913 INFO  L158              Benchmark]: Boogie Procedure Inliner took 43.06ms. Allocated memory is still 201.3MB. Free memory was 134.5MB in the beginning and 131.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 17:19:57,913 INFO  L158              Benchmark]: Boogie Preprocessor took 49.86ms. Allocated memory is still 201.3MB. Free memory was 131.9MB in the beginning and 128.8MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 17:19:57,913 INFO  L158              Benchmark]: IcfgBuilder took 602.33ms. Allocated memory is still 201.3MB. Free memory was 128.8MB in the beginning and 72.9MB in the end (delta: 55.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB.
[2025-03-08 17:19:57,914 INFO  L158              Benchmark]: TraceAbstraction took 21516.47ms. Allocated memory was 201.3MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 72.2MB in the beginning and 1.1GB in the end (delta: -994.0MB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB.
[2025-03-08 17:19:57,914 INFO  L158              Benchmark]: Witness Printer took 127.19ms. Allocated memory is still 3.4GB. Free memory was 1.1GB in the beginning and 1.0GB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2025-03-08 17:19:57,915 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.19ms. Allocated memory is still 201.3MB. Free memory is still 114.9MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 422.07ms. Allocated memory is still 201.3MB. Free memory was 158.3MB in the beginning and 134.5MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 43.06ms. Allocated memory is still 201.3MB. Free memory was 134.5MB in the beginning and 131.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 49.86ms. Allocated memory is still 201.3MB. Free memory was 131.9MB in the beginning and 128.8MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB.
 * IcfgBuilder took 602.33ms. Allocated memory is still 201.3MB. Free memory was 128.8MB in the beginning and 72.9MB in the end (delta: 55.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB.
 * TraceAbstraction took 21516.47ms. Allocated memory was 201.3MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 72.2MB in the beginning and 1.1GB in the end (delta: -994.0MB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB.
 * Witness Printer took 127.19ms. Allocated memory is still 3.4GB. Free memory was 1.1GB in the beginning and 1.0GB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - CounterExampleResult [Line: 18]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L710]               0  int __unbuffered_cnt = 0;
[L712]               0  int __unbuffered_p2_EAX = 0;
[L714]               0  int __unbuffered_p3_EAX = 0;
[L716]               0  int a = 0;
[L717]               0  _Bool main$tmp_guard0;
[L718]               0  _Bool main$tmp_guard1;
[L720]               0  int x = 0;
[L722]               0  int y = 0;
[L723]               0  _Bool y$flush_delayed;
[L724]               0  int y$mem_tmp;
[L725]               0  _Bool y$r_buff0_thd0;
[L726]               0  _Bool y$r_buff0_thd1;
[L727]               0  _Bool y$r_buff0_thd2;
[L728]               0  _Bool y$r_buff0_thd3;
[L729]               0  _Bool y$r_buff0_thd4;
[L730]               0  _Bool y$r_buff1_thd0;
[L731]               0  _Bool y$r_buff1_thd1;
[L732]               0  _Bool y$r_buff1_thd2;
[L733]               0  _Bool y$r_buff1_thd3;
[L734]               0  _Bool y$r_buff1_thd4;
[L735]               0  _Bool y$read_delayed;
[L736]               0  int *y$read_delayed_var;
[L737]               0  int y$w_buff0;
[L738]               0  _Bool y$w_buff0_used;
[L739]               0  int y$w_buff1;
[L740]               0  _Bool y$w_buff1_used;
[L742]               0  int z = 0;
[L743]               0  _Bool weak$$choice0;
[L744]               0  _Bool weak$$choice2;
[L841]               0  pthread_t t1433;
[L842]  FCALL, FORK  0  pthread_create(&t1433, ((void *)0), P0, ((void *)0))
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1433=-3, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L843]               0  pthread_t t1434;
[L844]  FCALL, FORK  0  pthread_create(&t1434, ((void *)0), P1, ((void *)0))
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1433=-3, t1434=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L845]               0  pthread_t t1435;
[L846]  FCALL, FORK  0  pthread_create(&t1435, ((void *)0), P2, ((void *)0))
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1433=-3, t1434=-2, t1435=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L847]               0  pthread_t t1436;
[L848]  FCALL, FORK  0  pthread_create(&t1436, ((void *)0), P3, ((void *)0))
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1433=-3, t1434=-2, t1435=-1, t1436=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L783]               3  y$w_buff1 = y$w_buff0
[L784]               3  y$w_buff0 = 2
[L785]               3  y$w_buff1_used = y$w_buff0_used
[L786]               3  y$w_buff0_used = (_Bool)1
[L787]  CALL         3  __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L18]   COND FALSE   3  !(!expression)
[L787]  RET          3  __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L788]               3  y$r_buff1_thd0 = y$r_buff0_thd0
[L789]               3  y$r_buff1_thd1 = y$r_buff0_thd1
[L790]               3  y$r_buff1_thd2 = y$r_buff0_thd2
[L791]               3  y$r_buff1_thd3 = y$r_buff0_thd3
[L792]               3  y$r_buff1_thd4 = y$r_buff0_thd4
[L793]               3  y$r_buff0_thd3 = (_Bool)1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L796]               3  __unbuffered_p2_EAX = z
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L813]               4  z = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L816]               4  __unbuffered_p3_EAX = a
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L748]               1  a = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L819]               4  y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L820]               4  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used
[L821]               4  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used
[L822]               4  y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4
[L823]               4  y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L751]               1  x = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L763]               2  x = 2
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L766]               2  y = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L769]               2  y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L770]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L771]               2  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L772]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L773]               2  y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L799]               3  y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L800]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L801]               3  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L802]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L803]               3  y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1]
[L806]               3  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1]
[L826]               4  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1]
[L756]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1]
[L776]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1]
[L850]               0  main$tmp_guard0 = __unbuffered_cnt == 4
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1433=-3, t1434=-2, t1435=-1, t1436=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1]
[L852]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L3]    COND FALSE   0  !(!cond)
[L852]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L854]               0  y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L855]               0  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L856]               0  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L857]               0  y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L858]               0  y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1433=-3, t1434=-2, t1435=-1, t1436=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1]
[L861]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L862]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L863]               0  y$flush_delayed = weak$$choice2
[L864]               0  y$mem_tmp = y
[L865]               0  y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L866]               0  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L867]               0  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L868]               0  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L869]               0  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L870]               0  y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L871]               0  y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L872]               0  main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0)
[L873]               0  y = y$flush_delayed ? y$mem_tmp : y
[L874]               0  y$flush_delayed = (_Bool)0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1433=-3, t1434=-2, t1435=-1, t1436=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1]
[L876]  CALL         0  __VERIFIER_assert(main$tmp_guard1)
[L18]   COND TRUE    0  !expression
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1]
[L18]                0  reach_error()
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1]

  - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable
    Unable to prove that a call to reach_error is unreachable
 Reason: Not analyzed. 
  - UnprovableResult [Line: 848]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 844]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 842]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 846]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 9 procedures, 81 locations, 77 edges, 7 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: 21.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 15.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 954 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 941 mSDsluCounter, 133 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 122 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2232 IncrementalHoareTripleChecker+Invalid, 2295 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 11 mSDtfsCounter, 2232 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=268occurred in iteration=6, InterpolantAutomatonStates: 61, 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.6s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 318 NumberOfCodeBlocks, 318 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 272 ConstructedInterpolants, 0 QuantifiedInterpolants, 1965 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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
RESULT: Ultimate proved your program to be incorrect!
[2025-03-08 17:19:57,932 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE