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


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


Checking for ERROR reachability
Using default analysis
Version c00e63dc
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/mix005.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 0c4e58b38f229da1b25a4c7b1c830f1f36e4dc5c1e18903f04a209f4b4cfa3c5
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-06 04:18:36,740 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-06 04:18:36,794 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-02-06 04:18:36,801 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-06 04:18:36,804 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-06 04:18:36,832 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-06 04:18:36,832 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-06 04:18:36,832 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-06 04:18:36,833 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-06 04:18:36,833 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-06 04:18:36,833 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-06 04:18:36,833 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-06 04:18:36,833 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-06 04:18:36,833 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-06 04:18:36,834 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-06 04:18:36,837 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-06 04:18:36,838 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-06 04:18:36,838 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-06 04:18:36,838 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-06 04:18:36,838 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-06 04:18:36,838 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-06 04:18:36,838 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-06 04:18:36,838 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-06 04:18:36,838 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-06 04:18:36,838 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-06 04:18:36,838 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-06 04:18:36,838 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-06 04:18:36,838 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-06 04:18:36,838 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-06 04:18:36,838 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-06 04:18:36,838 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-06 04:18:36,838 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-06 04:18:36,838 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-06 04:18:36,838 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-06 04:18:36,838 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-06 04:18:36,838 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-06 04:18:36,839 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-06 04:18:36,839 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-06 04:18:36,839 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-06 04:18:36,839 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-06 04:18:36,839 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-06 04:18:36,839 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-06 04:18:36,839 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-06 04:18:36,839 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 -> 0c4e58b38f229da1b25a4c7b1c830f1f36e4dc5c1e18903f04a209f4b4cfa3c5
[2025-02-06 04:18:37,106 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-06 04:18:37,113 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-06 04:18:37,116 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-06 04:18:37,117 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-06 04:18:37,117 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-06 04:18:37,119 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix005.opt.i
[2025-02-06 04:18:38,495 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ba10811d8/07b418e9c9104590affbb5fccdfd8428/FLAG660747cf0
[2025-02-06 04:18:38,824 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-06 04:18:38,828 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix005.opt.i
[2025-02-06 04:18:38,845 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ba10811d8/07b418e9c9104590affbb5fccdfd8428/FLAG660747cf0
[2025-02-06 04:18:38,860 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ba10811d8/07b418e9c9104590affbb5fccdfd8428
[2025-02-06 04:18:38,862 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-06 04:18:38,863 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-06 04:18:38,864 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-06 04:18:38,864 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-06 04:18:38,867 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-06 04:18:38,867 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:18:38" (1/1) ...
[2025-02-06 04:18:38,868 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d839858 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:18:38, skipping insertion in model container
[2025-02-06 04:18:38,868 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:18:38" (1/1) ...
[2025-02-06 04:18:38,888 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-06 04:18:38,978 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/mix005.opt.i[944,957]
[2025-02-06 04:18:39,143 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-06 04:18:39,153 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-06 04:18:39,161 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/mix005.opt.i[944,957]
[2025-02-06 04:18:39,216 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-06 04:18:39,244 INFO  L204         MainTranslator]: Completed translation
[2025-02-06 04:18:39,245 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:18:39 WrapperNode
[2025-02-06 04:18:39,245 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-06 04:18:39,246 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-06 04:18:39,246 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-06 04:18:39,247 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-06 04:18:39,251 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:18:39" (1/1) ...
[2025-02-06 04:18:39,264 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:18:39" (1/1) ...
[2025-02-06 04:18:39,291 INFO  L138                Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151
[2025-02-06 04:18:39,295 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-06 04:18:39,295 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-06 04:18:39,295 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-06 04:18:39,295 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-06 04:18:39,302 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:18:39" (1/1) ...
[2025-02-06 04:18:39,302 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:18:39" (1/1) ...
[2025-02-06 04:18:39,304 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:18:39" (1/1) ...
[2025-02-06 04:18:39,325 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-06 04:18:39,327 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:18:39" (1/1) ...
[2025-02-06 04:18:39,327 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:18:39" (1/1) ...
[2025-02-06 04:18:39,335 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:18:39" (1/1) ...
[2025-02-06 04:18:39,336 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:18:39" (1/1) ...
[2025-02-06 04:18:39,337 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:18:39" (1/1) ...
[2025-02-06 04:18:39,341 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:18:39" (1/1) ...
[2025-02-06 04:18:39,343 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-06 04:18:39,347 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-06 04:18:39,347 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-06 04:18:39,347 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-06 04:18:39,348 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:18:39" (1/1) ...
[2025-02-06 04:18:39,355 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-06 04:18:39,370 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 04:18:39,384 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-06 04:18:39,387 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-06 04:18:39,405 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2025-02-06 04:18:39,405 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-06 04:18:39,405 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2025-02-06 04:18:39,405 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2025-02-06 04:18:39,405 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2025-02-06 04:18:39,405 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2025-02-06 04:18:39,405 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2025-02-06 04:18:39,405 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2025-02-06 04:18:39,406 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2025-02-06 04:18:39,407 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2025-02-06 04:18:39,407 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-06 04:18:39,407 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2025-02-06 04:18:39,407 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-06 04:18:39,407 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-06 04:18:39,408 WARN  L227             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2025-02-06 04:18:39,524 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-06 04:18:39,526 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-06 04:18:39,774 INFO  L304             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2025-02-06 04:18:39,775 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-06 04:18:39,996 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-06 04:18:39,996 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-06 04:18:39,997 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:18:39 BoogieIcfgContainer
[2025-02-06 04:18:39,997 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-06 04:18:39,998 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-06 04:18:39,999 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-06 04:18:40,002 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-06 04:18:40,002 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:18:38" (1/3) ...
[2025-02-06 04:18:40,003 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@337d4a43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:18:40, skipping insertion in model container
[2025-02-06 04:18:40,003 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:18:39" (2/3) ...
[2025-02-06 04:18:40,005 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@337d4a43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:18:40, skipping insertion in model container
[2025-02-06 04:18:40,005 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:18:39" (3/3) ...
[2025-02-06 04:18:40,006 INFO  L128   eAbstractionObserver]: Analyzing ICFG mix005.opt.i
[2025-02-06 04:18:40,016 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-06 04:18:40,017 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG mix005.opt.i that has 5 procedures, 50 locations, 1 initial locations, 0 loop locations, and 2 error locations.
[2025-02-06 04:18:40,018 INFO  L491   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2025-02-06 04:18:40,081 INFO  L143    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2025-02-06 04:18:40,104 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 116 flow
[2025-02-06 04:18:40,125 INFO  L124   PetriNetUnfolderBase]: 1/46 cut-off events.
[2025-02-06 04:18:40,126 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-02-06 04:18:40,129 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 102 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-06 04:18:40,129 INFO  L82        GeneralOperation]: Start removeDead. Operand has 62 places, 50 transitions, 116 flow
[2025-02-06 04:18:40,131 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 58 places, 46 transitions, 104 flow
[2025-02-06 04:18:40,136 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-06 04:18:40,143 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;@5dc6f190, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-06 04:18:40,144 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2025-02-06 04:18:40,150 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2025-02-06 04:18:40,150 INFO  L124   PetriNetUnfolderBase]: 0/25 cut-off events.
[2025-02-06 04:18:40,150 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-02-06 04:18:40,150 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 04:18:40,151 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 04:18:40,151 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-06 04:18:40,155 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 04:18:40,155 INFO  L85        PathProgramCache]: Analyzing trace with hash -1857516900, now seen corresponding path program 1 times
[2025-02-06 04:18:40,160 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 04:18:40,161 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178006274]
[2025-02-06 04:18:40,161 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 04:18:40,161 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 04:18:40,215 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes.
[2025-02-06 04:18:40,237 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements.
[2025-02-06 04:18:40,237 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 04:18:40,237 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 04:18:40,565 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-06 04:18:40,565 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 04:18:40,565 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178006274]
[2025-02-06 04:18:40,566 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178006274] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 04:18:40,566 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 04:18:40,566 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2025-02-06 04:18:40,567 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934872368]
[2025-02-06 04:18:40,567 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 04:18:40,572 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 04:18:40,575 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 04:18:40,596 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 04:18:40,597 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 04:18:40,598 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50
[2025-02-06 04:18:40,600 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-06 04:18:40,601 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 04:18:40,601 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50
[2025-02-06 04:18:40,602 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 04:18:45,000 INFO  L124   PetriNetUnfolderBase]: 47351/62847 cut-off events.
[2025-02-06 04:18:45,001 INFO  L125   PetriNetUnfolderBase]: For 272/272 co-relation queries the response was YES.
[2025-02-06 04:18:45,130 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 125495 conditions, 62847 events. 47351/62847 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 1806. Compared 364206 event pairs, 6239 based on Foata normal form. 1764/64293 useless extension candidates. Maximal degree in co-relation 125483. Up to 53209 conditions per place. 
[2025-02-06 04:18:45,304 INFO  L140   encePairwiseOnDemand]: 46/50 looper letters, 56 selfloop transitions, 2 changer transitions 2/67 dead transitions.
[2025-02-06 04:18:45,304 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 67 transitions, 266 flow
[2025-02-06 04:18:45,305 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 04:18:45,306 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-06 04:18:45,311 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions.
[2025-02-06 04:18:45,312 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.64
[2025-02-06 04:18:45,313 INFO  L175             Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 96 transitions.
[2025-02-06 04:18:45,313 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 67 transitions, 266 flow
[2025-02-06 04:18:45,318 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 67 transitions, 262 flow, removed 0 selfloop flow, removed 4 redundant places.
[2025-02-06 04:18:45,319 INFO  L231             Difference]: Finished difference. Result has 55 places, 43 transitions, 98 flow
[2025-02-06 04:18:45,321 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-06 04:18:45,323 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places.
[2025-02-06 04:18:45,323 INFO  L471      AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 98 flow
[2025-02-06 04:18:45,323 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-06 04:18:45,323 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 04:18:45,323 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 04:18:45,323 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-06 04:18:45,323 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-06 04:18:45,324 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 04:18:45,324 INFO  L85        PathProgramCache]: Analyzing trace with hash 1104198074, now seen corresponding path program 1 times
[2025-02-06 04:18:45,324 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 04:18:45,324 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354334853]
[2025-02-06 04:18:45,324 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 04:18:45,324 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 04:18:45,333 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-02-06 04:18:45,366 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-02-06 04:18:45,369 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 04:18:45,369 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 04:18:45,524 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-06 04:18:45,524 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 04:18:45,524 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354334853]
[2025-02-06 04:18:45,524 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354334853] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 04:18:45,524 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 04:18:45,525 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-06 04:18:45,525 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814702314]
[2025-02-06 04:18:45,525 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 04:18:45,525 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-06 04:18:45,525 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 04:18:45,526 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-06 04:18:45,526 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-06 04:18:45,526 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50
[2025-02-06 04:18:45,526 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-06 04:18:45,526 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 04:18:45,526 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50
[2025-02-06 04:18:45,526 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 04:18:49,051 INFO  L124   PetriNetUnfolderBase]: 37987/54813 cut-off events.
[2025-02-06 04:18:49,052 INFO  L125   PetriNetUnfolderBase]: For 1616/1616 co-relation queries the response was YES.
[2025-02-06 04:18:49,152 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 107711 conditions, 54813 events. 37987/54813 cut-off events. For 1616/1616 co-relation queries the response was YES. Maximal size of possible extension queue 1746. Compared 378325 event pairs, 5317 based on Foata normal form. 1764/55164 useless extension candidates. Maximal degree in co-relation 107701. Up to 28641 conditions per place. 
[2025-02-06 04:18:49,274 INFO  L140   encePairwiseOnDemand]: 43/50 looper letters, 77 selfloop transitions, 6 changer transitions 1/91 dead transitions.
[2025-02-06 04:18:49,274 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 91 transitions, 372 flow
[2025-02-06 04:18:49,275 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-06 04:18:49,275 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2025-02-06 04:18:49,275 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions.
[2025-02-06 04:18:49,276 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.65
[2025-02-06 04:18:49,276 INFO  L175             Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 4 states and 130 transitions.
[2025-02-06 04:18:49,276 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 91 transitions, 372 flow
[2025-02-06 04:18:49,284 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 91 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-02-06 04:18:49,286 INFO  L231             Difference]: Finished difference. Result has 57 places, 47 transitions, 136 flow
[2025-02-06 04:18:49,286 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-06 04:18:49,286 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, -1 predicate places.
[2025-02-06 04:18:49,287 INFO  L471      AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 136 flow
[2025-02-06 04:18:49,287 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-06 04:18:49,287 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 04:18:49,287 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-06 04:18:49,287 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-06 04:18:49,287 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-06 04:18:49,288 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 04:18:49,288 INFO  L85        PathProgramCache]: Analyzing trace with hash -1501050005, now seen corresponding path program 1 times
[2025-02-06 04:18:49,288 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 04:18:49,288 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105411409]
[2025-02-06 04:18:49,288 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 04:18:49,288 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 04:18:49,294 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes.
[2025-02-06 04:18:49,309 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements.
[2025-02-06 04:18:49,309 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 04:18:49,309 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 04:18:49,439 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-06 04:18:49,439 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 04:18:49,439 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105411409]
[2025-02-06 04:18:49,439 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105411409] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 04:18:49,439 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 04:18:49,439 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-06 04:18:49,440 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844961641]
[2025-02-06 04:18:49,440 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 04:18:49,440 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-06 04:18:49,440 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 04:18:49,441 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-06 04:18:49,441 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-06 04:18:49,441 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50
[2025-02-06 04:18:49,441 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-06 04:18:49,441 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 04:18:49,441 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50
[2025-02-06 04:18:49,441 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 04:18:51,624 INFO  L124   PetriNetUnfolderBase]: 24507/35173 cut-off events.
[2025-02-06 04:18:51,624 INFO  L125   PetriNetUnfolderBase]: For 6870/6870 co-relation queries the response was YES.
[2025-02-06 04:18:51,712 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 78265 conditions, 35173 events. 24507/35173 cut-off events. For 6870/6870 co-relation queries the response was YES. Maximal size of possible extension queue 919. Compared 221910 event pairs, 3159 based on Foata normal form. 1364/35844 useless extension candidates. Maximal degree in co-relation 78253. Up to 12441 conditions per place. 
[2025-02-06 04:18:51,793 INFO  L140   encePairwiseOnDemand]: 43/50 looper letters, 100 selfloop transitions, 10 changer transitions 1/118 dead transitions.
[2025-02-06 04:18:51,793 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 118 transitions, 529 flow
[2025-02-06 04:18:51,794 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-06 04:18:51,794 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2025-02-06 04:18:51,794 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions.
[2025-02-06 04:18:51,795 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.672
[2025-02-06 04:18:51,795 INFO  L175             Difference]: Start difference. First operand has 57 places, 47 transitions, 136 flow. Second operand 5 states and 168 transitions.
[2025-02-06 04:18:51,795 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 118 transitions, 529 flow
[2025-02-06 04:18:51,804 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 118 transitions, 518 flow, removed 1 selfloop flow, removed 2 redundant places.
[2025-02-06 04:18:51,805 INFO  L231             Difference]: Finished difference. Result has 61 places, 51 transitions, 188 flow
[2025-02-06 04:18:51,806 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-06 04:18:51,806 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places.
[2025-02-06 04:18:51,806 INFO  L471      AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 188 flow
[2025-02-06 04:18:51,806 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-06 04:18:51,807 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 04:18:51,807 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-06 04:18:51,807 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-06 04:18:51,807 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-06 04:18:51,807 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 04:18:51,807 INFO  L85        PathProgramCache]: Analyzing trace with hash -404736076, now seen corresponding path program 1 times
[2025-02-06 04:18:51,807 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 04:18:51,808 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483770334]
[2025-02-06 04:18:51,808 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 04:18:51,808 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 04:18:51,814 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes.
[2025-02-06 04:18:51,825 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements.
[2025-02-06 04:18:51,825 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 04:18:51,825 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 04:18:51,941 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-06 04:18:51,941 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 04:18:51,941 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483770334]
[2025-02-06 04:18:51,941 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483770334] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 04:18:51,941 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 04:18:51,942 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-06 04:18:51,942 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184149510]
[2025-02-06 04:18:51,942 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 04:18:51,942 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-06 04:18:51,942 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 04:18:51,943 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-06 04:18:51,943 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-06 04:18:51,943 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50
[2025-02-06 04:18:51,943 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-06 04:18:51,943 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 04:18:51,943 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50
[2025-02-06 04:18:51,943 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 04:18:53,150 INFO  L124   PetriNetUnfolderBase]: 15211/21285 cut-off events.
[2025-02-06 04:18:53,150 INFO  L125   PetriNetUnfolderBase]: For 13034/13034 co-relation queries the response was YES.
[2025-02-06 04:18:53,216 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 52069 conditions, 21285 events. 15211/21285 cut-off events. For 13034/13034 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 117137 event pairs, 2769 based on Foata normal form. 644/21720 useless extension candidates. Maximal degree in co-relation 52055. Up to 6400 conditions per place. 
[2025-02-06 04:18:53,427 INFO  L140   encePairwiseOnDemand]: 43/50 looper letters, 121 selfloop transitions, 14 changer transitions 1/143 dead transitions.
[2025-02-06 04:18:53,427 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 143 transitions, 692 flow
[2025-02-06 04:18:53,428 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-06 04:18:53,428 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-02-06 04:18:53,430 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 204 transitions.
[2025-02-06 04:18:53,431 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.68
[2025-02-06 04:18:53,431 INFO  L175             Difference]: Start difference. First operand has 61 places, 51 transitions, 188 flow. Second operand 6 states and 204 transitions.
[2025-02-06 04:18:53,431 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 143 transitions, 692 flow
[2025-02-06 04:18:53,562 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 143 transitions, 662 flow, removed 5 selfloop flow, removed 4 redundant places.
[2025-02-06 04:18:53,564 INFO  L231             Difference]: Finished difference. Result has 64 places, 55 transitions, 238 flow
[2025-02-06 04:18:53,564 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-06 04:18:53,566 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places.
[2025-02-06 04:18:53,566 INFO  L471      AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 238 flow
[2025-02-06 04:18:53,566 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-06 04:18:53,566 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 04:18:53,566 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]
[2025-02-06 04:18:53,566 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-06 04:18:53,567 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-06 04:18:53,567 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 04:18:53,567 INFO  L85        PathProgramCache]: Analyzing trace with hash 1394044299, now seen corresponding path program 1 times
[2025-02-06 04:18:53,567 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 04:18:53,567 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576904466]
[2025-02-06 04:18:53,567 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 04:18:53,567 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 04:18:53,596 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-02-06 04:18:53,637 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-02-06 04:18:53,637 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 04:18:53,641 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 04:18:53,803 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-06 04:18:53,803 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 04:18:53,803 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576904466]
[2025-02-06 04:18:53,803 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576904466] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 04:18:53,803 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 04:18:53,803 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-06 04:18:53,804 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022729684]
[2025-02-06 04:18:53,804 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 04:18:53,804 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-06 04:18:53,804 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 04:18:53,804 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-06 04:18:53,804 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-02-06 04:18:53,804 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50
[2025-02-06 04:18:53,805 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.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 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-06 04:18:53,805 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 04:18:53,805 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50
[2025-02-06 04:18:53,805 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 04:18:55,059 INFO  L124   PetriNetUnfolderBase]: 12103/16541 cut-off events.
[2025-02-06 04:18:55,060 INFO  L125   PetriNetUnfolderBase]: For 12214/12214 co-relation queries the response was YES.
[2025-02-06 04:18:55,106 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41886 conditions, 16541 events. 12103/16541 cut-off events. For 12214/12214 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 86253 event pairs, 2575 based on Foata normal form. 160/16636 useless extension candidates. Maximal degree in co-relation 41871. Up to 6400 conditions per place. 
[2025-02-06 04:18:55,158 INFO  L140   encePairwiseOnDemand]: 43/50 looper letters, 104 selfloop transitions, 18 changer transitions 1/130 dead transitions.
[2025-02-06 04:18:55,158 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 130 transitions, 650 flow
[2025-02-06 04:18:55,158 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-02-06 04:18:55,159 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2025-02-06 04:18:55,159 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 202 transitions.
[2025-02-06 04:18:55,159 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.5771428571428572
[2025-02-06 04:18:55,160 INFO  L175             Difference]: Start difference. First operand has 64 places, 55 transitions, 238 flow. Second operand 7 states and 202 transitions.
[2025-02-06 04:18:55,160 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 130 transitions, 650 flow
[2025-02-06 04:18:55,412 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 130 transitions, 604 flow, removed 9 selfloop flow, removed 5 redundant places.
[2025-02-06 04:18:55,414 INFO  L231             Difference]: Finished difference. Result has 67 places, 55 transitions, 248 flow
[2025-02-06 04:18:55,415 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-06 04:18:55,417 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places.
[2025-02-06 04:18:55,417 INFO  L471      AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 248 flow
[2025-02-06 04:18:55,417 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 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-06 04:18:55,417 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 04:18:55,417 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-06 04:18:55,417 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-06 04:18:55,417 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-06 04:18:55,418 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 04:18:55,418 INFO  L85        PathProgramCache]: Analyzing trace with hash -1540299473, now seen corresponding path program 1 times
[2025-02-06 04:18:55,418 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 04:18:55,418 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40822541]
[2025-02-06 04:18:55,418 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 04:18:55,418 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 04:18:55,435 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes.
[2025-02-06 04:18:55,557 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements.
[2025-02-06 04:18:55,558 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 04:18:55,558 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 04:18:55,988 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-06 04:18:55,988 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 04:18:55,988 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40822541]
[2025-02-06 04:18:55,988 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40822541] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 04:18:55,988 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 04:18:55,988 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-06 04:18:55,988 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296212106]
[2025-02-06 04:18:55,988 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 04:18:55,989 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-06 04:18:55,989 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 04:18:55,989 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-06 04:18:55,989 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-02-06 04:18:55,994 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50
[2025-02-06 04:18:55,994 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-06 04:18:55,994 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 04:18:55,994 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50
[2025-02-06 04:18:55,994 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 04:18:57,557 INFO  L124   PetriNetUnfolderBase]: 18073/24703 cut-off events.
[2025-02-06 04:18:57,558 INFO  L125   PetriNetUnfolderBase]: For 18122/18122 co-relation queries the response was YES.
[2025-02-06 04:18:57,632 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 62977 conditions, 24703 events. 18073/24703 cut-off events. For 18122/18122 co-relation queries the response was YES. Maximal size of possible extension queue 763. Compared 136761 event pairs, 4829 based on Foata normal form. 16/24712 useless extension candidates. Maximal degree in co-relation 62961. Up to 13889 conditions per place. 
[2025-02-06 04:18:57,672 INFO  L140   encePairwiseOnDemand]: 42/50 looper letters, 82 selfloop transitions, 6 changer transitions 25/119 dead transitions.
[2025-02-06 04:18:57,672 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 119 transitions, 738 flow
[2025-02-06 04:18:57,672 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-06 04:18:57,673 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-02-06 04:18:57,673 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions.
[2025-02-06 04:18:57,673 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.5
[2025-02-06 04:18:57,673 INFO  L175             Difference]: Start difference. First operand has 67 places, 55 transitions, 248 flow. Second operand 6 states and 150 transitions.
[2025-02-06 04:18:57,673 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 119 transitions, 738 flow
[2025-02-06 04:18:57,968 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 119 transitions, 549 flow, removed 34 selfloop flow, removed 10 redundant places.
[2025-02-06 04:18:57,969 INFO  L231             Difference]: Finished difference. Result has 66 places, 58 transitions, 187 flow
[2025-02-06 04:18:57,970 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-06 04:18:57,970 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, 8 predicate places.
[2025-02-06 04:18:57,970 INFO  L471      AbstractCegarLoop]: Abstraction has has 66 places, 58 transitions, 187 flow
[2025-02-06 04:18:57,970 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-06 04:18:57,970 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 04:18:57,971 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-06 04:18:57,971 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-06 04:18:57,971 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-06 04:18:57,971 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 04:18:57,971 INFO  L85        PathProgramCache]: Analyzing trace with hash -11493613, now seen corresponding path program 2 times
[2025-02-06 04:18:57,971 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 04:18:57,971 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195152415]
[2025-02-06 04:18:57,972 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-06 04:18:57,972 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 04:18:57,980 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 1 equivalence classes.
[2025-02-06 04:18:58,031 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 38 statements.
[2025-02-06 04:18:58,032 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-02-06 04:18:58,032 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 04:18:58,237 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-06 04:18:58,237 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 04:18:58,237 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195152415]
[2025-02-06 04:18:58,237 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195152415] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 04:18:58,238 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 04:18:58,238 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-02-06 04:18:58,238 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165550375]
[2025-02-06 04:18:58,238 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 04:18:58,238 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-06 04:18:58,238 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 04:18:58,239 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-06 04:18:58,239 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-02-06 04:18:58,244 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50
[2025-02-06 04:18:58,245 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-06 04:18:58,245 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 04:18:58,245 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50
[2025-02-06 04:18:58,245 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 04:18:59,384 INFO  L124   PetriNetUnfolderBase]: 13553/18701 cut-off events.
[2025-02-06 04:18:59,385 INFO  L125   PetriNetUnfolderBase]: For 3868/3868 co-relation queries the response was YES.
[2025-02-06 04:18:59,425 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44624 conditions, 18701 events. 13553/18701 cut-off events. For 3868/3868 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 98168 event pairs, 811 based on Foata normal form. 16/18709 useless extension candidates. Maximal degree in co-relation 44609. Up to 9876 conditions per place. 
[2025-02-06 04:18:59,455 INFO  L140   encePairwiseOnDemand]: 38/50 looper letters, 83 selfloop transitions, 7 changer transitions 78/174 dead transitions.
[2025-02-06 04:18:59,456 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 174 transitions, 877 flow
[2025-02-06 04:18:59,456 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-06 04:18:59,456 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2025-02-06 04:18:59,457 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 208 transitions.
[2025-02-06 04:18:59,457 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.52
[2025-02-06 04:18:59,457 INFO  L175             Difference]: Start difference. First operand has 66 places, 58 transitions, 187 flow. Second operand 8 states and 208 transitions.
[2025-02-06 04:18:59,457 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 174 transitions, 877 flow
[2025-02-06 04:18:59,461 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 174 transitions, 859 flow, removed 5 selfloop flow, removed 3 redundant places.
[2025-02-06 04:18:59,462 INFO  L231             Difference]: Finished difference. Result has 74 places, 60 transitions, 228 flow
[2025-02-06 04:18:59,462 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=228, PETRI_PLACES=74, PETRI_TRANSITIONS=60}
[2025-02-06 04:18:59,463 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, 16 predicate places.
[2025-02-06 04:18:59,463 INFO  L471      AbstractCegarLoop]: Abstraction has has 74 places, 60 transitions, 228 flow
[2025-02-06 04:18:59,463 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-06 04:18:59,463 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 04:18:59,463 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-06 04:18:59,463 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-06 04:18:59,464 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-06 04:18:59,464 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 04:18:59,464 INFO  L85        PathProgramCache]: Analyzing trace with hash 1230042413, now seen corresponding path program 3 times
[2025-02-06 04:18:59,464 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 04:18:59,464 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662570949]
[2025-02-06 04:18:59,464 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-02-06 04:18:59,464 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 04:18:59,471 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 1 equivalence classes.
[2025-02-06 04:18:59,507 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 38 of 38 statements.
[2025-02-06 04:18:59,507 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2025-02-06 04:18:59,507 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 04:18:59,678 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-06 04:18:59,679 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 04:18:59,679 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662570949]
[2025-02-06 04:18:59,679 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662570949] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 04:18:59,679 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 04:18:59,679 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-06 04:18:59,679 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577424757]
[2025-02-06 04:18:59,679 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 04:18:59,679 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-06 04:18:59,680 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 04:18:59,680 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-06 04:18:59,680 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-02-06 04:18:59,685 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50
[2025-02-06 04:18:59,685 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 60 transitions, 228 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-06 04:18:59,685 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 04:18:59,685 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50
[2025-02-06 04:18:59,685 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 04:19:00,440 INFO  L124   PetriNetUnfolderBase]: 10273/14510 cut-off events.
[2025-02-06 04:19:00,440 INFO  L125   PetriNetUnfolderBase]: For 8024/8024 co-relation queries the response was YES.
[2025-02-06 04:19:00,470 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37398 conditions, 14510 events. 10273/14510 cut-off events. For 8024/8024 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 76939 event pairs, 3272 based on Foata normal form. 16/14524 useless extension candidates. Maximal degree in co-relation 37378. Up to 8705 conditions per place. 
[2025-02-06 04:19:00,485 INFO  L140   encePairwiseOnDemand]: 45/50 looper letters, 52 selfloop transitions, 1 changer transitions 67/126 dead transitions.
[2025-02-06 04:19:00,485 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 126 transitions, 697 flow
[2025-02-06 04:19:00,486 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-06 04:19:00,486 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-02-06 04:19:00,486 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions.
[2025-02-06 04:19:00,486 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.49666666666666665
[2025-02-06 04:19:00,486 INFO  L175             Difference]: Start difference. First operand has 74 places, 60 transitions, 228 flow. Second operand 6 states and 149 transitions.
[2025-02-06 04:19:00,487 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 126 transitions, 697 flow
[2025-02-06 04:19:00,490 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 126 transitions, 687 flow, removed 5 selfloop flow, removed 3 redundant places.
[2025-02-06 04:19:00,491 INFO  L231             Difference]: Finished difference. Result has 76 places, 55 transitions, 200 flow
[2025-02-06 04:19:00,491 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=200, PETRI_PLACES=76, PETRI_TRANSITIONS=55}
[2025-02-06 04:19:00,493 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, 18 predicate places.
[2025-02-06 04:19:00,493 INFO  L471      AbstractCegarLoop]: Abstraction has has 76 places, 55 transitions, 200 flow
[2025-02-06 04:19:00,493 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-06 04:19:00,493 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 04:19:00,493 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-06 04:19:00,493 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-06 04:19:00,493 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-06 04:19:00,493 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 04:19:00,493 INFO  L85        PathProgramCache]: Analyzing trace with hash -1730948395, now seen corresponding path program 4 times
[2025-02-06 04:19:00,493 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 04:19:00,493 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175116190]
[2025-02-06 04:19:00,493 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-02-06 04:19:00,493 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 04:19:00,500 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes.
[2025-02-06 04:19:00,517 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements.
[2025-02-06 04:19:00,517 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s)
[2025-02-06 04:19:00,517 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 04:19:02,192 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-06 04:19:02,193 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 04:19:02,193 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175116190]
[2025-02-06 04:19:02,193 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175116190] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 04:19:02,193 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 04:19:02,193 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-06 04:19:02,193 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181167724]
[2025-02-06 04:19:02,193 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 04:19:02,193 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-02-06 04:19:02,194 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 04:19:02,194 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-02-06 04:19:02,195 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2025-02-06 04:19:02,200 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50
[2025-02-06 04:19:02,201 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 55 transitions, 200 flow. Second operand  has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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-06 04:19:02,201 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 04:19:02,201 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50
[2025-02-06 04:19:02,201 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 04:19:03,143 INFO  L124   PetriNetUnfolderBase]: 5159/7519 cut-off events.
[2025-02-06 04:19:03,143 INFO  L125   PetriNetUnfolderBase]: For 2788/2788 co-relation queries the response was YES.
[2025-02-06 04:19:03,163 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18047 conditions, 7519 events. 5159/7519 cut-off events. For 2788/2788 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 37807 event pairs, 895 based on Foata normal form. 16/7532 useless extension candidates. Maximal degree in co-relation 18025. Up to 3133 conditions per place. 
[2025-02-06 04:19:03,174 INFO  L140   encePairwiseOnDemand]: 40/50 looper letters, 56 selfloop transitions, 4 changer transitions 75/140 dead transitions.
[2025-02-06 04:19:03,174 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 140 transitions, 745 flow
[2025-02-06 04:19:03,174 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-02-06 04:19:03,175 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2025-02-06 04:19:03,176 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 203 transitions.
[2025-02-06 04:19:03,177 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.3690909090909091
[2025-02-06 04:19:03,177 INFO  L175             Difference]: Start difference. First operand has 76 places, 55 transitions, 200 flow. Second operand 11 states and 203 transitions.
[2025-02-06 04:19:03,177 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 140 transitions, 745 flow
[2025-02-06 04:19:03,181 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 140 transitions, 709 flow, removed 7 selfloop flow, removed 8 redundant places.
[2025-02-06 04:19:03,182 INFO  L231             Difference]: Finished difference. Result has 80 places, 54 transitions, 197 flow
[2025-02-06 04:19:03,182 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=197, PETRI_PLACES=80, PETRI_TRANSITIONS=54}
[2025-02-06 04:19:03,183 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, 22 predicate places.
[2025-02-06 04:19:03,183 INFO  L471      AbstractCegarLoop]: Abstraction has has 80 places, 54 transitions, 197 flow
[2025-02-06 04:19:03,183 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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-06 04:19:03,183 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 04:19:03,183 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-06 04:19:03,183 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-06 04:19:03,184 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-06 04:19:03,184 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 04:19:03,184 INFO  L85        PathProgramCache]: Analyzing trace with hash 1862763049, now seen corresponding path program 5 times
[2025-02-06 04:19:03,184 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 04:19:03,184 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414951963]
[2025-02-06 04:19:03,184 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-02-06 04:19:03,184 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 04:19:03,195 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 1 equivalence classes.
[2025-02-06 04:19:03,240 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 38 statements.
[2025-02-06 04:19:03,240 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-02-06 04:19:03,240 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 04:19:03,240 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 04:19:03,246 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes.
[2025-02-06 04:19:03,289 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements.
[2025-02-06 04:19:03,289 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 04:19:03,289 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 04:19:03,324 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 04:19:03,324 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-02-06 04:19:03,325 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining)
[2025-02-06 04:19:03,327 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining)
[2025-02-06 04:19:03,327 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining)
[2025-02-06 04:19:03,327 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining)
[2025-02-06 04:19:03,327 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining)
[2025-02-06 04:19:03,327 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining)
[2025-02-06 04:19:03,327 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining)
[2025-02-06 04:19:03,327 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-06 04:19:03,328 INFO  L422         BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1]
[2025-02-06 04:19:03,431 INFO  L241   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2025-02-06 04:19:03,431 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-02-06 04:19:03,438 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 04:19:03 BasicIcfg
[2025-02-06 04:19:03,438 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-02-06 04:19:03,438 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-02-06 04:19:03,438 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-02-06 04:19:03,438 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-02-06 04:19:03,439 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:18:39" (3/4) ...
[2025-02-06 04:19:03,440 INFO  L140         WitnessPrinter]: Generating witness for reachability counterexample
[2025-02-06 04:19:03,537 INFO  L127   tionWitnessGenerator]: Generated YAML witness of length 9.
[2025-02-06 04:19:03,570 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-02-06 04:19:03,570 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-02-06 04:19:03,570 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-02-06 04:19:03,571 INFO  L158              Benchmark]: Toolchain (without parser) took 24707.70ms. Allocated memory was 142.6MB in the beginning and 10.1GB in the end (delta: 10.0GB). Free memory was 110.1MB in the beginning and 5.8GB in the end (delta: -5.7GB). Peak memory consumption was 4.3GB. Max. memory is 16.1GB.
[2025-02-06 04:19:03,571 INFO  L158              Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-02-06 04:19:03,571 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 381.88ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 85.6MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2025-02-06 04:19:03,571 INFO  L158              Benchmark]: Boogie Procedure Inliner took 48.32ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 83.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-06 04:19:03,572 INFO  L158              Benchmark]: Boogie Preprocessor took 51.38ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 79.7MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-02-06 04:19:03,572 INFO  L158              Benchmark]: IcfgBuilder took 649.94ms. Allocated memory is still 142.6MB. Free memory was 79.7MB in the beginning and 85.4MB in the end (delta: -5.7MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB.
[2025-02-06 04:19:03,572 INFO  L158              Benchmark]: TraceAbstraction took 23439.15ms. Allocated memory was 142.6MB in the beginning and 10.1GB in the end (delta: 10.0GB). Free memory was 84.6MB in the beginning and 5.9GB in the end (delta: -5.8GB). Peak memory consumption was 4.2GB. Max. memory is 16.1GB.
[2025-02-06 04:19:03,572 INFO  L158              Benchmark]: Witness Printer took 131.98ms. Allocated memory is still 10.1GB. Free memory was 5.9GB in the beginning and 5.8GB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-02-06 04:19:03,574 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.21ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 381.88ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 85.6MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 48.32ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 83.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 51.38ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 79.7MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * IcfgBuilder took 649.94ms. Allocated memory is still 142.6MB. Free memory was 79.7MB in the beginning and 85.4MB in the end (delta: -5.7MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB.
 * TraceAbstraction took 23439.15ms. Allocated memory was 142.6MB in the beginning and 10.1GB in the end (delta: 10.0GB). Free memory was 84.6MB in the beginning and 5.9GB in the end (delta: -5.8GB). Peak memory consumption was 4.2GB. Max. memory is 16.1GB.
 * Witness Printer took 131.98ms. Allocated memory is still 10.1GB. Free memory was 5.9GB in the beginning and 5.8GB 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_p1_EAX = 0;
[L714]               0  int __unbuffered_p2_EAX = 0;
[L716]               0  int __unbuffered_p2_EBX = 0;
[L718]               0  int __unbuffered_p3_EAX = 0;
[L720]               0  int __unbuffered_p3_EBX = 0;
[L722]               0  int a = 0;
[L723]               0  _Bool main$tmp_guard0;
[L724]               0  _Bool main$tmp_guard1;
[L726]               0  int x = 0;
[L728]               0  int y = 0;
[L730]               0  int z = 0;
[L731]               0  _Bool z$flush_delayed;
[L732]               0  int z$mem_tmp;
[L733]               0  _Bool z$r_buff0_thd0;
[L734]               0  _Bool z$r_buff0_thd1;
[L735]               0  _Bool z$r_buff0_thd2;
[L736]               0  _Bool z$r_buff0_thd3;
[L737]               0  _Bool z$r_buff0_thd4;
[L738]               0  _Bool z$r_buff1_thd0;
[L739]               0  _Bool z$r_buff1_thd1;
[L740]               0  _Bool z$r_buff1_thd2;
[L741]               0  _Bool z$r_buff1_thd3;
[L742]               0  _Bool z$r_buff1_thd4;
[L743]               0  _Bool z$read_delayed;
[L744]               0  int *z$read_delayed_var;
[L745]               0  int z$w_buff0;
[L746]               0  _Bool z$w_buff0_used;
[L747]               0  int z$w_buff1;
[L748]               0  _Bool z$w_buff1_used;
[L749]               0  _Bool weak$$choice0;
[L750]               0  _Bool weak$$choice2;
[L869]               0  pthread_t t125;
[L870]  FCALL, FORK  0  pthread_create(&t125, ((void *)0), P0, ((void *)0))
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t125=-3, 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]
[L871]               0  pthread_t t126;
[L872]  FCALL, FORK  0  pthread_create(&t126, ((void *)0), P1, ((void *)0))
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t125=-3, t126=-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]
[L873]               0  pthread_t t127;
[L874]  FCALL, FORK  0  pthread_create(&t127, ((void *)0), P2, ((void *)0))
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t125=-3, t126=-2, t127=-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]
[L875]               0  pthread_t t128;
[L876]  FCALL, FORK  0  pthread_create(&t128, ((void *)0), P3, ((void *)0))
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t125=-3, t126=-2, t127=-1, t128=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]
[L815]               4  z$w_buff1 = z$w_buff0
[L816]               4  z$w_buff0 = 1
[L817]               4  z$w_buff1_used = z$w_buff0_used
[L818]               4  z$w_buff0_used = (_Bool)1
[L819]  CALL         4  __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L18]   COND FALSE   4  !(!expression)
[L819]  RET          4  __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L820]               4  z$r_buff1_thd0 = z$r_buff0_thd0
[L821]               4  z$r_buff1_thd1 = z$r_buff0_thd1
[L822]               4  z$r_buff1_thd2 = z$r_buff0_thd2
[L823]               4  z$r_buff1_thd3 = z$r_buff0_thd3
[L824]               4  z$r_buff1_thd4 = z$r_buff0_thd4
[L825]               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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L828]               4  weak$$choice0 = __VERIFIER_nondet_bool()
[L829]               4  weak$$choice2 = __VERIFIER_nondet_bool()
[L830]               4  z$flush_delayed = weak$$choice2
[L831]               4  z$mem_tmp = z
[L832]               4  z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1)
[L833]               4  z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0))
[L834]               4  z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1))
[L835]               4  z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used))
[L836]               4  z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L837]               4  z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4))
[L838]               4  z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L839]               4  __unbuffered_p3_EAX = z
[L840]               4  z = z$flush_delayed ? z$mem_tmp : z
[L841]               4  z$flush_delayed = (_Bool)0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L844]               4  __unbuffered_p3_EBX = a
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L754]               1  a = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L757]               1  x = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L769]               2  x = 2
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L762]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L772]               2  __unbuffered_p1_EAX = y
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L784]               3  y = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L787]               3  __unbuffered_p2_EAX = y
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L790]               3  weak$$choice0 = __VERIFIER_nondet_bool()
[L791]               3  weak$$choice2 = __VERIFIER_nondet_bool()
[L792]               3  z$flush_delayed = weak$$choice2
[L793]               3  z$mem_tmp = z
[L794]               3  z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)
[L795]               3  z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L796]               3  z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L797]               3  z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L798]               3  z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L799]               3  z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))
[L800]               3  z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L801]               3  __unbuffered_p2_EBX = z
[L802]               3  z = z$flush_delayed ? z$mem_tmp : z
[L803]               3  z$flush_delayed = (_Bool)0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L847]               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)
[L848]               4  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L849]               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
[L850]               4  z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L851]               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=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L854]               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=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L777]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L808]               3  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L878]               0  main$tmp_guard0 = __unbuffered_cnt == 4
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t125=-3, t126=-2, t127=-1, t128=0, weak$$choice0=0, weak$$choice2=1, x=2, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L880]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L3]    COND FALSE   0  !(!cond)
[L880]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L882]               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)
[L883]               0  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L884]               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
[L885]               0  z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L886]               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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t125=-3, t126=-2, t127=-1, t128=0, weak$$choice0=0, weak$$choice2=1, x=2, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L889]               0  main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0)
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t125=-3, t126=-2, t127=-1, t128=0, weak$$choice0=0, weak$$choice2=1, x=2, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L891]  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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L18]                0  reach_error()
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]

  - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable
    Unable to prove that a call to reach_error is unreachable
 Reason: Not analyzed. 
  - UnprovableResult [Line: 876]: 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: 874]: 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: 872]: 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: 870]: 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: 23.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 19.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 913 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 904 mSDsluCounter, 81 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 78 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2022 IncrementalHoareTripleChecker+Invalid, 2063 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 3 mSDtfsCounter, 2022 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=248occurred in iteration=5, 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.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 295 NumberOfCodeBlocks, 295 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 248 ConstructedInterpolants, 0 QuantifiedInterpolants, 1742 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-06 04:19:03,597 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

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