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


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


Checking for ERROR reachability
Using default analysis
Version 48c9605d
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix046.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f69f777f524a62a415fc7cacc9442c44e05883e29c36815b4e0d58199826b331
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-48c9605-m
[2025-02-08 01:01:54,439 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-08 01:01:54,497 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-02-08 01:01:54,502 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-08 01:01:54,502 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-08 01:01:54,527 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-08 01:01:54,527 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-08 01:01:54,527 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-08 01:01:54,528 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-08 01:01:54,528 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-08 01:01:54,528 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-08 01:01:54,528 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-08 01:01:54,528 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-08 01:01:54,528 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-08 01:01:54,528 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-08 01:01:54,528 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-08 01:01:54,528 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-08 01:01:54,528 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-08 01:01:54,528 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-08 01:01:54,528 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-08 01:01:54,528 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-08 01:01:54,528 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-08 01:01:54,528 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-08 01:01:54,529 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-08 01:01:54,529 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-08 01:01:54,529 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-08 01:01:54,529 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-08 01:01:54,529 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-08 01:01:54,529 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-08 01:01:54,529 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-08 01:01:54,529 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-08 01:01:54,529 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-08 01:01:54,529 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-08 01:01:54,529 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-08 01:01:54,529 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-08 01:01:54,529 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-08 01:01:54,529 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-08 01:01:54,529 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-08 01:01:54,529 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-08 01:01:54,529 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-08 01:01:54,529 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-08 01:01:54,530 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-08 01:01:54,530 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-08 01:01:54,530 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f69f777f524a62a415fc7cacc9442c44e05883e29c36815b4e0d58199826b331
[2025-02-08 01:01:54,765 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-08 01:01:54,771 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-08 01:01:54,773 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-08 01:01:54,774 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-08 01:01:54,774 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-08 01:01:54,775 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix046.opt.i
[2025-02-08 01:01:55,975 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d1534d3f4/a4fd9c87d4e649f3bfd97b9d87ef1a33/FLAG054d59b3d
[2025-02-08 01:01:56,335 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-08 01:01:56,339 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix046.opt.i
[2025-02-08 01:01:56,355 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d1534d3f4/a4fd9c87d4e649f3bfd97b9d87ef1a33/FLAG054d59b3d
[2025-02-08 01:01:56,551 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d1534d3f4/a4fd9c87d4e649f3bfd97b9d87ef1a33
[2025-02-08 01:01:56,553 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-08 01:01:56,554 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-08 01:01:56,555 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-08 01:01:56,555 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-08 01:01:56,558 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-08 01:01:56,558 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:01:56" (1/1) ...
[2025-02-08 01:01:56,559 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d0846f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:01:56, skipping insertion in model container
[2025-02-08 01:01:56,559 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:01:56" (1/1) ...
[2025-02-08 01:01:56,595 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-08 01:01:56,714 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix046.opt.i[944,957]
[2025-02-08 01:01:56,882 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-08 01:01:56,891 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-08 01:01:56,898 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix046.opt.i[944,957]
[2025-02-08 01:01:56,937 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-08 01:01:56,964 INFO  L204         MainTranslator]: Completed translation
[2025-02-08 01:01:56,965 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:01:56 WrapperNode
[2025-02-08 01:01:56,966 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-08 01:01:56,967 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-08 01:01:56,967 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-08 01:01:56,967 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-08 01:01:56,971 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:01:56" (1/1) ...
[2025-02-08 01:01:56,986 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:01:56" (1/1) ...
[2025-02-08 01:01:57,014 INFO  L138                Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 153
[2025-02-08 01:01:57,014 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-08 01:01:57,015 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-08 01:01:57,015 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-08 01:01:57,015 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-08 01:01:57,021 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:01:56" (1/1) ...
[2025-02-08 01:01:57,021 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:01:56" (1/1) ...
[2025-02-08 01:01:57,023 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:01:56" (1/1) ...
[2025-02-08 01:01:57,033 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-02-08 01:01:57,034 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:01:56" (1/1) ...
[2025-02-08 01:01:57,034 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:01:56" (1/1) ...
[2025-02-08 01:01:57,038 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:01:56" (1/1) ...
[2025-02-08 01:01:57,039 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:01:56" (1/1) ...
[2025-02-08 01:01:57,040 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:01:56" (1/1) ...
[2025-02-08 01:01:57,040 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:01:56" (1/1) ...
[2025-02-08 01:01:57,042 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-08 01:01:57,046 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-08 01:01:57,046 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-08 01:01:57,046 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-08 01:01:57,047 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:01:56" (1/1) ...
[2025-02-08 01:01:57,054 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-08 01:01:57,064 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 01:01:57,077 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-08 01:01:57,082 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-08 01:01:57,100 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2025-02-08 01:01:57,100 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-08 01:01:57,100 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2025-02-08 01:01:57,100 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2025-02-08 01:01:57,101 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2025-02-08 01:01:57,101 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2025-02-08 01:01:57,102 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2025-02-08 01:01:57,102 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2025-02-08 01:01:57,102 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2025-02-08 01:01:57,102 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2025-02-08 01:01:57,102 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-08 01:01:57,102 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2025-02-08 01:01:57,102 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-08 01:01:57,102 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-08 01:01:57,103 WARN  L227             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2025-02-08 01:01:57,219 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-08 01:01:57,220 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-08 01:01:57,470 INFO  L304             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2025-02-08 01:01:57,470 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-08 01:01:57,605 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-08 01:01:57,605 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-08 01:01:57,605 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:01:57 BoogieIcfgContainer
[2025-02-08 01:01:57,605 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-08 01:01:57,607 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-08 01:01:57,607 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-08 01:01:57,610 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-08 01:01:57,610 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:01:56" (1/3) ...
[2025-02-08 01:01:57,611 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77c40c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:01:57, skipping insertion in model container
[2025-02-08 01:01:57,611 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:01:56" (2/3) ...
[2025-02-08 01:01:57,611 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77c40c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:01:57, skipping insertion in model container
[2025-02-08 01:01:57,611 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:01:57" (3/3) ...
[2025-02-08 01:01:57,612 INFO  L128   eAbstractionObserver]: Analyzing ICFG mix046.opt.i
[2025-02-08 01:01:57,622 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-08 01:01:57,623 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG mix046.opt.i that has 5 procedures, 50 locations, 1 initial locations, 0 loop locations, and 2 error locations.
[2025-02-08 01:01:57,624 INFO  L491   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2025-02-08 01:01:57,659 INFO  L143    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2025-02-08 01:01:57,703 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 116 flow
[2025-02-08 01:01:57,749 INFO  L124   PetriNetUnfolderBase]: 1/46 cut-off events.
[2025-02-08 01:01:57,751 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-02-08 01:01:57,757 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 101 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. 
[2025-02-08 01:01:57,757 INFO  L82        GeneralOperation]: Start removeDead. Operand has 62 places, 50 transitions, 116 flow
[2025-02-08 01:01:57,758 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 58 places, 46 transitions, 104 flow
[2025-02-08 01:01:57,767 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-08 01:01:57,781 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;@2e7dd9a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-08 01:01:57,781 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2025-02-08 01:01:57,790 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2025-02-08 01:01:57,793 INFO  L124   PetriNetUnfolderBase]: 0/26 cut-off events.
[2025-02-08 01:01:57,793 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-02-08 01:01:57,794 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 01:01:57,794 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 01:01:57,794 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-02-08 01:01:57,801 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 01:01:57,801 INFO  L85        PathProgramCache]: Analyzing trace with hash 883989884, now seen corresponding path program 1 times
[2025-02-08 01:01:57,809 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 01:01:57,813 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819735271]
[2025-02-08 01:01:57,813 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 01:01:57,813 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 01:01:57,914 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes.
[2025-02-08 01:01:57,958 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements.
[2025-02-08 01:01:57,958 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 01:01:57,958 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 01:01:58,280 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 01:01:58,281 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 01:01:58,281 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819735271]
[2025-02-08 01:01:58,281 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819735271] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 01:01:58,281 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 01:01:58,282 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2025-02-08 01:01:58,284 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355884521]
[2025-02-08 01:01:58,285 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 01:01:58,292 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-08 01:01:58,296 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 01:01:58,313 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 01:01:58,314 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 01:01:58,315 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50
[2025-02-08 01:01:58,317 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand  has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 01:01:58,317 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 01:01:58,318 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50
[2025-02-08 01:01:58,318 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 01:02:02,242 INFO  L124   PetriNetUnfolderBase]: 46139/61167 cut-off events.
[2025-02-08 01:02:02,243 INFO  L125   PetriNetUnfolderBase]: For 236/236 co-relation queries the response was YES.
[2025-02-08 01:02:02,368 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 122171 conditions, 61167 events. 46139/61167 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 1752. Compared 350733 event pairs, 5315 based on Foata normal form. 1728/62613 useless extension candidates. Maximal degree in co-relation 122159. Up to 52921 conditions per place. 
[2025-02-08 01:02:02,581 INFO  L140   encePairwiseOnDemand]: 46/50 looper letters, 55 selfloop transitions, 2 changer transitions 2/66 dead transitions.
[2025-02-08 01:02:02,581 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 66 transitions, 262 flow
[2025-02-08 01:02:02,582 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 01:02:02,584 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-08 01:02:02,588 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions.
[2025-02-08 01:02:02,589 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.6333333333333333
[2025-02-08 01:02:02,590 INFO  L175             Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 95 transitions.
[2025-02-08 01:02:02,591 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 66 transitions, 262 flow
[2025-02-08 01:02:02,596 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 66 transitions, 258 flow, removed 0 selfloop flow, removed 4 redundant places.
[2025-02-08 01:02:02,597 INFO  L231             Difference]: Finished difference. Result has 55 places, 43 transitions, 98 flow
[2025-02-08 01:02:02,599 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=55, PETRI_TRANSITIONS=43}
[2025-02-08 01:02:02,601 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places.
[2025-02-08 01:02:02,601 INFO  L471      AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 98 flow
[2025-02-08 01:02:02,601 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 01:02:02,601 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 01:02:02,601 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 01:02:02,602 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-08 01:02:02,602 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-02-08 01:02:02,603 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 01:02:02,603 INFO  L85        PathProgramCache]: Analyzing trace with hash 541881173, now seen corresponding path program 1 times
[2025-02-08 01:02:02,603 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 01:02:02,603 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147120716]
[2025-02-08 01:02:02,603 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 01:02:02,603 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 01:02:02,615 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-02-08 01:02:02,658 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-02-08 01:02:02,658 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 01:02:02,658 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 01:02:02,820 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 01:02:02,820 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 01:02:02,821 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147120716]
[2025-02-08 01:02:02,821 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147120716] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 01:02:02,821 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 01:02:02,821 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-08 01:02:02,821 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756876711]
[2025-02-08 01:02:02,821 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 01:02:02,822 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-08 01:02:02,822 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 01:02:02,822 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-08 01:02:02,822 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-08 01:02:02,823 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50
[2025-02-08 01:02:02,823 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 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-02-08 01:02:02,823 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 01:02:02,823 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50
[2025-02-08 01:02:02,823 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 01:02:05,383 INFO  L124   PetriNetUnfolderBase]: 37115/53601 cut-off events.
[2025-02-08 01:02:05,383 INFO  L125   PetriNetUnfolderBase]: For 1408/1408 co-relation queries the response was YES.
[2025-02-08 01:02:05,504 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 105067 conditions, 53601 events. 37115/53601 cut-off events. For 1408/1408 co-relation queries the response was YES. Maximal size of possible extension queue 1708. Compared 370037 event pairs, 5075 based on Foata normal form. 1728/53936 useless extension candidates. Maximal degree in co-relation 105057. Up to 28201 conditions per place. 
[2025-02-08 01:02:05,657 INFO  L140   encePairwiseOnDemand]: 43/50 looper letters, 77 selfloop transitions, 6 changer transitions 1/91 dead transitions.
[2025-02-08 01:02:05,657 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 91 transitions, 372 flow
[2025-02-08 01:02:05,657 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-08 01:02:05,658 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2025-02-08 01:02:05,658 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions.
[2025-02-08 01:02:05,659 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.65
[2025-02-08 01:02:05,659 INFO  L175             Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 4 states and 130 transitions.
[2025-02-08 01:02:05,659 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 91 transitions, 372 flow
[2025-02-08 01:02:05,670 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 91 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-02-08 01:02:05,672 INFO  L231             Difference]: Finished difference. Result has 57 places, 47 transitions, 136 flow
[2025-02-08 01:02:05,672 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=57, PETRI_TRANSITIONS=47}
[2025-02-08 01:02:05,673 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, -1 predicate places.
[2025-02-08 01:02:05,673 INFO  L471      AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 136 flow
[2025-02-08 01:02:05,673 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-02-08 01:02:05,673 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 01:02:05,673 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 01:02:05,673 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-08 01:02:05,674 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-02-08 01:02:05,676 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 01:02:05,676 INFO  L85        PathProgramCache]: Analyzing trace with hash 348265129, now seen corresponding path program 1 times
[2025-02-08 01:02:05,676 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 01:02:05,676 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498950147]
[2025-02-08 01:02:05,676 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 01:02:05,676 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 01:02:05,695 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes.
[2025-02-08 01:02:05,735 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements.
[2025-02-08 01:02:05,736 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 01:02:05,736 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 01:02:05,923 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 01:02:05,924 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 01:02:05,924 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498950147]
[2025-02-08 01:02:05,924 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498950147] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 01:02:05,924 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 01:02:05,924 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-08 01:02:05,925 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050312787]
[2025-02-08 01:02:05,925 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 01:02:05,925 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-08 01:02:05,925 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 01:02:05,926 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-08 01:02:05,926 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-08 01:02:05,926 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50
[2025-02-08 01:02:05,927 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 136 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-02-08 01:02:05,927 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 01:02:05,927 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50
[2025-02-08 01:02:05,927 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 01:02:07,928 INFO  L124   PetriNetUnfolderBase]: 23963/34433 cut-off events.
[2025-02-08 01:02:07,928 INFO  L125   PetriNetUnfolderBase]: For 6758/6758 co-relation queries the response was YES.
[2025-02-08 01:02:07,977 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 76593 conditions, 34433 events. 23963/34433 cut-off events. For 6758/6758 co-relation queries the response was YES. Maximal size of possible extension queue 906. Compared 217534 event pairs, 2975 based on Foata normal form. 1344/35088 useless extension candidates. Maximal degree in co-relation 76581. Up to 12361 conditions per place. 
[2025-02-08 01:02:08,049 INFO  L140   encePairwiseOnDemand]: 43/50 looper letters, 100 selfloop transitions, 10 changer transitions 1/118 dead transitions.
[2025-02-08 01:02:08,050 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 118 transitions, 529 flow
[2025-02-08 01:02:08,050 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-08 01:02:08,050 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2025-02-08 01:02:08,051 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions.
[2025-02-08 01:02:08,051 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.672
[2025-02-08 01:02:08,051 INFO  L175             Difference]: Start difference. First operand has 57 places, 47 transitions, 136 flow. Second operand 5 states and 168 transitions.
[2025-02-08 01:02:08,051 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 118 transitions, 529 flow
[2025-02-08 01:02:08,063 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 118 transitions, 518 flow, removed 1 selfloop flow, removed 2 redundant places.
[2025-02-08 01:02:08,065 INFO  L231             Difference]: Finished difference. Result has 61 places, 51 transitions, 188 flow
[2025-02-08 01:02:08,065 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=61, PETRI_TRANSITIONS=51}
[2025-02-08 01:02:08,066 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places.
[2025-02-08 01:02:08,066 INFO  L471      AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 188 flow
[2025-02-08 01:02:08,066 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-02-08 01:02:08,066 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 01:02:08,066 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-02-08 01:02:08,066 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-08 01:02:08,066 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-02-08 01:02:08,067 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 01:02:08,067 INFO  L85        PathProgramCache]: Analyzing trace with hash -1991410905, now seen corresponding path program 1 times
[2025-02-08 01:02:08,067 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 01:02:08,067 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336019352]
[2025-02-08 01:02:08,067 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 01:02:08,068 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 01:02:08,077 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes.
[2025-02-08 01:02:08,126 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements.
[2025-02-08 01:02:08,126 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 01:02:08,126 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 01:02:08,280 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 01:02:08,281 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 01:02:08,281 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336019352]
[2025-02-08 01:02:08,281 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336019352] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 01:02:08,281 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 01:02:08,281 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-08 01:02:08,281 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016825981]
[2025-02-08 01:02:08,281 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 01:02:08,281 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-08 01:02:08,281 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 01:02:08,281 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-08 01:02:08,281 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-08 01:02:08,282 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50
[2025-02-08 01:02:08,282 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 188 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-02-08 01:02:08,282 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 01:02:08,282 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50
[2025-02-08 01:02:08,282 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 01:02:09,283 INFO  L124   PetriNetUnfolderBase]: 14779/20705 cut-off events.
[2025-02-08 01:02:09,284 INFO  L125   PetriNetUnfolderBase]: For 12790/12790 co-relation queries the response was YES.
[2025-02-08 01:02:09,321 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50685 conditions, 20705 events. 14779/20705 cut-off events. For 12790/12790 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 114060 event pairs, 2591 based on Foata normal form. 640/21136 useless extension candidates. Maximal degree in co-relation 50671. Up to 6144 conditions per place. 
[2025-02-08 01:02:09,368 INFO  L140   encePairwiseOnDemand]: 43/50 looper letters, 121 selfloop transitions, 14 changer transitions 1/143 dead transitions.
[2025-02-08 01:02:09,368 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 143 transitions, 692 flow
[2025-02-08 01:02:09,369 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-08 01:02:09,369 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-02-08 01:02:09,370 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 204 transitions.
[2025-02-08 01:02:09,370 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.68
[2025-02-08 01:02:09,370 INFO  L175             Difference]: Start difference. First operand has 61 places, 51 transitions, 188 flow. Second operand 6 states and 204 transitions.
[2025-02-08 01:02:09,370 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 143 transitions, 692 flow
[2025-02-08 01:02:09,496 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 143 transitions, 662 flow, removed 5 selfloop flow, removed 4 redundant places.
[2025-02-08 01:02:09,497 INFO  L231             Difference]: Finished difference. Result has 64 places, 55 transitions, 238 flow
[2025-02-08 01:02:09,498 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=64, PETRI_TRANSITIONS=55}
[2025-02-08 01:02:09,498 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places.
[2025-02-08 01:02:09,499 INFO  L471      AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 238 flow
[2025-02-08 01:02:09,499 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-02-08 01:02:09,499 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 01:02:09,499 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-02-08 01:02:09,499 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-08 01:02:09,499 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-02-08 01:02:09,500 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 01:02:09,500 INFO  L85        PathProgramCache]: Analyzing trace with hash 1295282367, now seen corresponding path program 1 times
[2025-02-08 01:02:09,500 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 01:02:09,500 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534146064]
[2025-02-08 01:02:09,500 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 01:02:09,500 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 01:02:09,509 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes.
[2025-02-08 01:02:09,548 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements.
[2025-02-08 01:02:09,548 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 01:02:09,548 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 01:02:09,704 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 01:02:09,705 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 01:02:09,705 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534146064]
[2025-02-08 01:02:09,705 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534146064] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 01:02:09,705 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 01:02:09,705 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-08 01:02:09,705 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485164298]
[2025-02-08 01:02:09,705 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 01:02:09,706 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-08 01:02:09,706 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 01:02:09,706 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-08 01:02:09,706 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-02-08 01:02:09,707 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50
[2025-02-08 01:02:09,707 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 238 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-02-08 01:02:09,707 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 01:02:09,707 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50
[2025-02-08 01:02:09,708 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 01:02:10,611 INFO  L124   PetriNetUnfolderBase]: 11683/15977 cut-off events.
[2025-02-08 01:02:10,612 INFO  L125   PetriNetUnfolderBase]: For 12398/12398 co-relation queries the response was YES.
[2025-02-08 01:02:10,636 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40542 conditions, 15977 events. 11683/15977 cut-off events. For 12398/12398 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 83218 event pairs, 2399 based on Foata normal form. 160/16072 useless extension candidates. Maximal degree in co-relation 40527. Up to 6144 conditions per place. 
[2025-02-08 01:02:10,676 INFO  L140   encePairwiseOnDemand]: 43/50 looper letters, 104 selfloop transitions, 18 changer transitions 1/130 dead transitions.
[2025-02-08 01:02:10,676 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 130 transitions, 650 flow
[2025-02-08 01:02:10,678 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-02-08 01:02:10,678 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2025-02-08 01:02:10,679 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 202 transitions.
[2025-02-08 01:02:10,679 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.5771428571428572
[2025-02-08 01:02:10,679 INFO  L175             Difference]: Start difference. First operand has 64 places, 55 transitions, 238 flow. Second operand 7 states and 202 transitions.
[2025-02-08 01:02:10,679 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 130 transitions, 650 flow
[2025-02-08 01:02:10,858 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 130 transitions, 604 flow, removed 9 selfloop flow, removed 5 redundant places.
[2025-02-08 01:02:10,859 INFO  L231             Difference]: Finished difference. Result has 67 places, 55 transitions, 248 flow
[2025-02-08 01:02:10,859 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=248, PETRI_PLACES=67, PETRI_TRANSITIONS=55}
[2025-02-08 01:02:10,860 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places.
[2025-02-08 01:02:10,860 INFO  L471      AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 248 flow
[2025-02-08 01:02:10,860 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-02-08 01:02:10,860 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 01:02:10,860 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, 1, 1]
[2025-02-08 01:02:10,861 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-08 01:02:10,861 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-02-08 01:02:10,861 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 01:02:10,861 INFO  L85        PathProgramCache]: Analyzing trace with hash -199634992, now seen corresponding path program 1 times
[2025-02-08 01:02:10,861 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 01:02:10,861 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962978777]
[2025-02-08 01:02:10,861 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 01:02:10,862 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 01:02:10,870 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes.
[2025-02-08 01:02:10,943 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements.
[2025-02-08 01:02:10,944 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 01:02:10,944 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 01:02:11,450 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 01:02:11,450 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 01:02:11,450 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962978777]
[2025-02-08 01:02:11,450 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962978777] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 01:02:11,450 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 01:02:11,450 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-08 01:02:11,450 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527040495]
[2025-02-08 01:02:11,450 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 01:02:11,451 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-08 01:02:11,451 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 01:02:11,451 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-08 01:02:11,451 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-02-08 01:02:11,457 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50
[2025-02-08 01:02:11,458 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 248 flow. Second operand  has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 01:02:11,458 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 01:02:11,458 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50
[2025-02-08 01:02:11,458 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 01:02:12,653 INFO  L124   PetriNetUnfolderBase]: 17367/23735 cut-off events.
[2025-02-08 01:02:12,653 INFO  L125   PetriNetUnfolderBase]: For 18476/18476 co-relation queries the response was YES.
[2025-02-08 01:02:12,741 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 60581 conditions, 23735 events. 17367/23735 cut-off events. For 18476/18476 co-relation queries the response was YES. Maximal size of possible extension queue 747. Compared 129895 event pairs, 4075 based on Foata normal form. 16/23744 useless extension candidates. Maximal degree in co-relation 60565. Up to 13313 conditions per place. 
[2025-02-08 01:02:12,792 INFO  L140   encePairwiseOnDemand]: 42/50 looper letters, 81 selfloop transitions, 6 changer transitions 25/118 dead transitions.
[2025-02-08 01:02:12,792 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 118 transitions, 734 flow
[2025-02-08 01:02:12,792 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-08 01:02:12,792 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-02-08 01:02:12,793 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions.
[2025-02-08 01:02:12,793 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.49666666666666665
[2025-02-08 01:02:12,793 INFO  L175             Difference]: Start difference. First operand has 67 places, 55 transitions, 248 flow. Second operand 6 states and 149 transitions.
[2025-02-08 01:02:12,793 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 118 transitions, 734 flow
[2025-02-08 01:02:13,117 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 118 transitions, 545 flow, removed 34 selfloop flow, removed 10 redundant places.
[2025-02-08 01:02:13,118 INFO  L231             Difference]: Finished difference. Result has 66 places, 58 transitions, 187 flow
[2025-02-08 01:02:13,118 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=66, PETRI_TRANSITIONS=58}
[2025-02-08 01:02:13,118 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, 8 predicate places.
[2025-02-08 01:02:13,118 INFO  L471      AbstractCegarLoop]: Abstraction has has 66 places, 58 transitions, 187 flow
[2025-02-08 01:02:13,119 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 01:02:13,119 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 01:02:13,119 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, 1, 1]
[2025-02-08 01:02:13,119 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-08 01:02:13,119 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-02-08 01:02:13,119 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 01:02:13,119 INFO  L85        PathProgramCache]: Analyzing trace with hash -1426540580, now seen corresponding path program 2 times
[2025-02-08 01:02:13,119 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 01:02:13,119 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992691896]
[2025-02-08 01:02:13,119 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-08 01:02:13,120 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 01:02:13,133 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 1 equivalence classes.
[2025-02-08 01:02:13,180 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 38 statements.
[2025-02-08 01:02:13,181 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-02-08 01:02:13,181 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 01:02:13,590 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 01:02:13,590 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 01:02:13,590 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992691896]
[2025-02-08 01:02:13,590 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992691896] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 01:02:13,590 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 01:02:13,590 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-02-08 01:02:13,590 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846979476]
[2025-02-08 01:02:13,590 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 01:02:13,590 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-08 01:02:13,590 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 01:02:13,591 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-08 01:02:13,591 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-02-08 01:02:13,597 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50
[2025-02-08 01:02:13,598 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 58 transitions, 187 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-02-08 01:02:13,598 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 01:02:13,598 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50
[2025-02-08 01:02:13,598 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 01:02:14,906 INFO  L124   PetriNetUnfolderBase]: 13887/19187 cut-off events.
[2025-02-08 01:02:14,906 INFO  L125   PetriNetUnfolderBase]: For 4410/4413 co-relation queries the response was YES.
[2025-02-08 01:02:14,992 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45904 conditions, 19187 events. 13887/19187 cut-off events. For 4410/4413 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 99673 event pairs, 2899 based on Foata normal form. 18/19200 useless extension candidates. Maximal degree in co-relation 45889. Up to 10176 conditions per place. 
[2025-02-08 01:02:15,032 INFO  L140   encePairwiseOnDemand]: 38/50 looper letters, 91 selfloop transitions, 10 changer transitions 57/164 dead transitions.
[2025-02-08 01:02:15,032 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 164 transitions, 821 flow
[2025-02-08 01:02:15,032 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-08 01:02:15,033 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2025-02-08 01:02:15,033 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 205 transitions.
[2025-02-08 01:02:15,034 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.5125
[2025-02-08 01:02:15,034 INFO  L175             Difference]: Start difference. First operand has 66 places, 58 transitions, 187 flow. Second operand 8 states and 205 transitions.
[2025-02-08 01:02:15,034 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 164 transitions, 821 flow
[2025-02-08 01:02:15,043 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 164 transitions, 805 flow, removed 5 selfloop flow, removed 3 redundant places.
[2025-02-08 01:02:15,045 INFO  L231             Difference]: Finished difference. Result has 73 places, 62 transitions, 240 flow
[2025-02-08 01:02:15,046 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=240, PETRI_PLACES=73, PETRI_TRANSITIONS=62}
[2025-02-08 01:02:15,047 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, 15 predicate places.
[2025-02-08 01:02:15,048 INFO  L471      AbstractCegarLoop]: Abstraction has has 73 places, 62 transitions, 240 flow
[2025-02-08 01:02:15,048 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-02-08 01:02:15,048 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 01:02:15,048 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, 1, 1]
[2025-02-08 01:02:15,048 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-08 01:02:15,049 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-02-08 01:02:15,049 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 01:02:15,049 INFO  L85        PathProgramCache]: Analyzing trace with hash 877167690, now seen corresponding path program 3 times
[2025-02-08 01:02:15,049 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 01:02:15,049 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713601070]
[2025-02-08 01:02:15,049 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-02-08 01:02:15,049 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 01:02:15,061 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 1 equivalence classes.
[2025-02-08 01:02:15,118 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 38 of 38 statements.
[2025-02-08 01:02:15,119 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2025-02-08 01:02:15,119 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 01:02:16,278 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 01:02:16,279 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 01:02:16,279 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713601070]
[2025-02-08 01:02:16,279 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713601070] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 01:02:16,279 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 01:02:16,279 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-08 01:02:16,279 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529247463]
[2025-02-08 01:02:16,279 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 01:02:16,280 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-02-08 01:02:16,280 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 01:02:16,280 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-02-08 01:02:16,280 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2025-02-08 01:02:16,286 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50
[2025-02-08 01:02:16,287 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 240 flow. Second operand  has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 01:02:16,287 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 01:02:16,287 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50
[2025-02-08 01:02:16,287 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 01:02:17,421 INFO  L124   PetriNetUnfolderBase]: 10715/15019 cut-off events.
[2025-02-08 01:02:17,424 INFO  L125   PetriNetUnfolderBase]: For 6606/6609 co-relation queries the response was YES.
[2025-02-08 01:02:17,549 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37646 conditions, 15019 events. 10715/15019 cut-off events. For 6606/6609 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 78114 event pairs, 665 based on Foata normal form. 18/15030 useless extension candidates. Maximal degree in co-relation 37627. Up to 7302 conditions per place. 
[2025-02-08 01:02:17,600 INFO  L140   encePairwiseOnDemand]: 38/50 looper letters, 109 selfloop transitions, 16 changer transitions 31/162 dead transitions.
[2025-02-08 01:02:17,600 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 162 transitions, 881 flow
[2025-02-08 01:02:17,600 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-02-08 01:02:17,600 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2025-02-08 01:02:17,601 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 206 transitions.
[2025-02-08 01:02:17,601 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.4577777777777778
[2025-02-08 01:02:17,601 INFO  L175             Difference]: Start difference. First operand has 73 places, 62 transitions, 240 flow. Second operand 9 states and 206 transitions.
[2025-02-08 01:02:17,601 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 162 transitions, 881 flow
[2025-02-08 01:02:17,606 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 162 transitions, 844 flow, removed 6 selfloop flow, removed 6 redundant places.
[2025-02-08 01:02:17,607 INFO  L231             Difference]: Finished difference. Result has 77 places, 68 transitions, 315 flow
[2025-02-08 01:02:17,608 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=315, PETRI_PLACES=77, PETRI_TRANSITIONS=68}
[2025-02-08 01:02:17,608 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, 19 predicate places.
[2025-02-08 01:02:17,608 INFO  L471      AbstractCegarLoop]: Abstraction has has 77 places, 68 transitions, 315 flow
[2025-02-08 01:02:17,609 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 01:02:17,609 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 01:02:17,609 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, 1, 1]
[2025-02-08 01:02:17,609 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-08 01:02:17,612 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-02-08 01:02:17,613 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 01:02:17,613 INFO  L85        PathProgramCache]: Analyzing trace with hash 359589486, now seen corresponding path program 4 times
[2025-02-08 01:02:17,613 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 01:02:17,613 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084525683]
[2025-02-08 01:02:17,613 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-02-08 01:02:17,613 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 01:02:17,628 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes.
[2025-02-08 01:02:17,673 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements.
[2025-02-08 01:02:17,673 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s)
[2025-02-08 01:02:17,673 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 01:02:17,953 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 01:02:17,954 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 01:02:17,954 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084525683]
[2025-02-08 01:02:17,954 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084525683] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 01:02:17,954 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 01:02:17,954 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-02-08 01:02:17,954 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091262973]
[2025-02-08 01:02:17,954 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 01:02:17,955 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-08 01:02:17,955 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 01:02:17,956 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-08 01:02:17,956 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-02-08 01:02:17,966 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50
[2025-02-08 01:02:17,967 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 68 transitions, 315 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-02-08 01:02:17,967 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 01:02:17,967 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50
[2025-02-08 01:02:17,967 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 01:02:19,585 INFO  L124   PetriNetUnfolderBase]: 13915/19648 cut-off events.
[2025-02-08 01:02:19,586 INFO  L125   PetriNetUnfolderBase]: For 16451/16451 co-relation queries the response was YES.
[2025-02-08 01:02:19,683 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51547 conditions, 19648 events. 13915/19648 cut-off events. For 16451/16451 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 107490 event pairs, 3202 based on Foata normal form. 16/19662 useless extension candidates. Maximal degree in co-relation 51526. Up to 10588 conditions per place. 
[2025-02-08 01:02:19,709 INFO  L140   encePairwiseOnDemand]: 39/50 looper letters, 55 selfloop transitions, 5 changer transitions 111/177 dead transitions.
[2025-02-08 01:02:19,710 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 177 transitions, 1071 flow
[2025-02-08 01:02:19,710 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-08 01:02:19,710 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2025-02-08 01:02:19,711 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions.
[2025-02-08 01:02:19,712 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.5075
[2025-02-08 01:02:19,712 INFO  L175             Difference]: Start difference. First operand has 77 places, 68 transitions, 315 flow. Second operand 8 states and 203 transitions.
[2025-02-08 01:02:19,712 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 177 transitions, 1071 flow
[2025-02-08 01:02:19,727 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 177 transitions, 1058 flow, removed 6 selfloop flow, removed 3 redundant places.
[2025-02-08 01:02:19,729 INFO  L231             Difference]: Finished difference. Result has 83 places, 55 transitions, 229 flow
[2025-02-08 01:02:19,729 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=229, PETRI_PLACES=83, PETRI_TRANSITIONS=55}
[2025-02-08 01:02:19,730 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, 25 predicate places.
[2025-02-08 01:02:19,730 INFO  L471      AbstractCegarLoop]: Abstraction has has 83 places, 55 transitions, 229 flow
[2025-02-08 01:02:19,731 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-02-08 01:02:19,731 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 01:02:19,731 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, 1, 1]
[2025-02-08 01:02:19,731 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-08 01:02:19,732 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-02-08 01:02:19,732 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 01:02:19,732 INFO  L85        PathProgramCache]: Analyzing trace with hash 999109568, now seen corresponding path program 5 times
[2025-02-08 01:02:19,732 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 01:02:19,732 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232913575]
[2025-02-08 01:02:19,732 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-02-08 01:02:19,732 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 01:02:19,743 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 1 equivalence classes.
[2025-02-08 01:02:19,788 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 38 statements.
[2025-02-08 01:02:19,788 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-02-08 01:02:19,788 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 01:02:19,788 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 01:02:19,793 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes.
[2025-02-08 01:02:19,838 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements.
[2025-02-08 01:02:19,839 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 01:02:19,839 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 01:02:19,874 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 01:02:19,874 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-02-08 01:02:19,875 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining)
[2025-02-08 01:02:19,876 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining)
[2025-02-08 01:02:19,876 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining)
[2025-02-08 01:02:19,877 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining)
[2025-02-08 01:02:19,877 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining)
[2025-02-08 01:02:19,877 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining)
[2025-02-08 01:02:19,877 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining)
[2025-02-08 01:02:19,877 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-08 01:02:19,877 INFO  L422         BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1]
[2025-02-08 01:02:19,973 INFO  L241   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2025-02-08 01:02:19,974 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-02-08 01:02:19,979 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 01:02:19 BasicIcfg
[2025-02-08 01:02:19,979 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-02-08 01:02:19,980 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-02-08 01:02:19,980 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-02-08 01:02:19,980 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-02-08 01:02:19,980 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:01:57" (3/4) ...
[2025-02-08 01:02:19,981 INFO  L140         WitnessPrinter]: Generating witness for reachability counterexample
[2025-02-08 01:02:20,085 INFO  L127   tionWitnessGenerator]: Generated YAML witness of length 9.
[2025-02-08 01:02:20,126 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-02-08 01:02:20,127 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-02-08 01:02:20,127 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-02-08 01:02:20,129 INFO  L158              Benchmark]: Toolchain (without parser) took 23573.62ms. Allocated memory was 142.6MB in the beginning and 6.9GB in the end (delta: 6.7GB). Free memory was 110.6MB in the beginning and 2.7GB in the end (delta: -2.5GB). Peak memory consumption was 4.2GB. Max. memory is 16.1GB.
[2025-02-08 01:02:20,129 INFO  L158              Benchmark]: CDTParser took 0.16ms. Allocated memory is still 226.5MB. Free memory is still 147.0MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-02-08 01:02:20,129 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 411.49ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 87.0MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2025-02-08 01:02:20,129 INFO  L158              Benchmark]: Boogie Procedure Inliner took 47.82ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 84.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-08 01:02:20,130 INFO  L158              Benchmark]: Boogie Preprocessor took 30.47ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 81.5MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-08 01:02:20,130 INFO  L158              Benchmark]: IcfgBuilder took 559.55ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 97.9MB in the end (delta: -16.4MB). Peak memory consumption was 56.5MB. Max. memory is 16.1GB.
[2025-02-08 01:02:20,130 INFO  L158              Benchmark]: TraceAbstraction took 22372.20ms. Allocated memory was 142.6MB in the beginning and 6.9GB in the end (delta: 6.7GB). Free memory was 97.2MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 4.2GB. Max. memory is 16.1GB.
[2025-02-08 01:02:20,130 INFO  L158              Benchmark]: Witness Printer took 147.25ms. Allocated memory is still 6.9GB. Free memory was 2.7GB in the beginning and 2.7GB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-02-08 01:02:20,132 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.16ms. Allocated memory is still 226.5MB. Free memory is still 147.0MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 411.49ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 87.0MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 47.82ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 84.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 30.47ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 81.5MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB.
 * IcfgBuilder took 559.55ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 97.9MB in the end (delta: -16.4MB). Peak memory consumption was 56.5MB. Max. memory is 16.1GB.
 * TraceAbstraction took 22372.20ms. Allocated memory was 142.6MB in the beginning and 6.9GB in the end (delta: 6.7GB). Free memory was 97.2MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 4.2GB. Max. memory is 16.1GB.
 * Witness Printer took 147.25ms. Allocated memory is still 6.9GB. Free memory was 2.7GB in the beginning and 2.7GB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. 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_p0_EAX = 0;
[L714]               0  int __unbuffered_p3_EAX = 0;
[L716]               0  int __unbuffered_p3_EBX = 0;
[L718]               0  int a = 0;
[L720]               0  int b = 0;
[L721]               0  _Bool main$tmp_guard0;
[L722]               0  _Bool main$tmp_guard1;
[L724]               0  int x = 0;
[L726]               0  int y = 0;
[L728]               0  int z = 0;
[L729]               0  _Bool z$flush_delayed;
[L730]               0  int z$mem_tmp;
[L731]               0  _Bool z$r_buff0_thd0;
[L732]               0  _Bool z$r_buff0_thd1;
[L733]               0  _Bool z$r_buff0_thd2;
[L734]               0  _Bool z$r_buff0_thd3;
[L735]               0  _Bool z$r_buff0_thd4;
[L736]               0  _Bool z$r_buff1_thd0;
[L737]               0  _Bool z$r_buff1_thd1;
[L738]               0  _Bool z$r_buff1_thd2;
[L739]               0  _Bool z$r_buff1_thd3;
[L740]               0  _Bool z$r_buff1_thd4;
[L741]               0  _Bool z$read_delayed;
[L742]               0  int *z$read_delayed_var;
[L743]               0  int z$w_buff0;
[L744]               0  _Bool z$w_buff0_used;
[L745]               0  int z$w_buff1;
[L746]               0  _Bool z$w_buff1_used;
[L747]               0  _Bool weak$$choice0;
[L748]               0  _Bool weak$$choice2;
[L846]               0  pthread_t t1221;
[L847]  FCALL, FORK  0  pthread_create(&t1221, ((void *)0), P0, ((void *)0))
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L848]               0  pthread_t t1222;
[L849]  FCALL, FORK  0  pthread_create(&t1222, ((void *)0), P1, ((void *)0))
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221=-2, t1222=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L850]               0  pthread_t t1223;
[L851]  FCALL, FORK  0  pthread_create(&t1223, ((void *)0), P2, ((void *)0))
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221=-2, t1222=-1, t1223=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L852]               0  pthread_t t1224;
[L853]  FCALL, FORK  0  pthread_create(&t1224, ((void *)0), P3, ((void *)0))
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221=-2, t1222=-1, t1223=0, t1224=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L802]               4  z$w_buff1 = z$w_buff0
[L803]               4  z$w_buff0 = 2
[L804]               4  z$w_buff1_used = z$w_buff0_used
[L805]               4  z$w_buff0_used = (_Bool)1
[L806]  CALL         4  __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L18]   COND FALSE   4  !(!expression)
[L806]  RET          4  __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L807]               4  z$r_buff1_thd0 = z$r_buff0_thd0
[L808]               4  z$r_buff1_thd1 = z$r_buff0_thd1
[L809]               4  z$r_buff1_thd2 = z$r_buff0_thd2
[L810]               4  z$r_buff1_thd3 = z$r_buff0_thd3
[L811]               4  z$r_buff1_thd4 = z$r_buff0_thd4
[L812]               4  z$r_buff0_thd4 = (_Bool)1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L815]               4  a = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L818]               4  __unbuffered_p3_EAX = a
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L821]               4  __unbuffered_p3_EBX = b
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L752]               1  b = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L755]               1  __unbuffered_p0_EAX = x
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L760]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L767]               2  x = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L770]               2  y = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L775]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L782]               3  y = 2
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L785]               3  z = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L788]               3  z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L789]               3  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L790]               3  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L791]               3  z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L792]               3  z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L795]               3  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L824]               4  z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L825]               4  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L826]               4  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used
[L827]               4  z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L828]               4  z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2]
[L831]               4  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2]
[L855]               0  main$tmp_guard0 = __unbuffered_cnt == 4
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1221=-2, t1222=-1, t1223=0, t1224=1, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2]
[L857]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L3]    COND FALSE   0  !(!cond)
[L857]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L859]               0  z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L860]               0  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L861]               0  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L862]               0  z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L863]               0  z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1221=-2, t1222=-1, t1223=0, t1224=1, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2]
[L866]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L867]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L868]               0  z$flush_delayed = weak$$choice2
[L869]               0  z$mem_tmp = z
[L870]               0  z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1)
[L871]               0  z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L872]               0  z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L873]               0  z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L874]               0  z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L875]               0  z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L876]               0  z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L877]               0  main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0)
[L878]               0  z = z$flush_delayed ? z$mem_tmp : z
[L879]               0  z$flush_delayed = (_Bool)0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1221=-2, t1222=-1, t1223=0, t1224=1, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2]
[L881]  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_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2]
[L18]                0  reach_error()
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2]

  - 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: 849]: 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: 847]: 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: 851]: 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: 853]: 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, 85 locations, 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: 22.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 17.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 932 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 923 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 55 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1962 IncrementalHoareTripleChecker+Invalid, 2010 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 5 mSDtfsCounter, 1962 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=315occurred in iteration=8, InterpolantAutomatonStates: 56, 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.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 247 ConstructedInterpolants, 0 QuantifiedInterpolants, 1438 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2025-02-08 01:02:20,152 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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