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


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


Checking for ERROR reachability
Using default analysis
Version 551b0097
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/mix055_tso.oepc.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 9ec75f624fee0326f6dc01ebf4c0afe8f65e83cfa5c5726cd79e55765f7366f9
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-551b009-m
[2025-01-09 16:28:37,445 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-01-09 16:28:37,502 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-01-09 16:28:37,505 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-01-09 16:28:37,505 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-01-09 16:28:37,525 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-01-09 16:28:37,525 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-01-09 16:28:37,525 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-01-09 16:28:37,525 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-01-09 16:28:37,525 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-01-09 16:28:37,525 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-01-09 16:28:37,525 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-01-09 16:28:37,526 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-01-09 16:28:37,526 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-01-09 16:28:37,526 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-01-09 16:28:37,526 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-01-09 16:28:37,526 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-01-09 16:28:37,526 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-01-09 16:28:37,526 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-01-09 16:28:37,526 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-01-09 16:28:37,526 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-01-09 16:28:37,526 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-01-09 16:28:37,526 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-01-09 16:28:37,526 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-01-09 16:28:37,526 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-01-09 16:28:37,526 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-01-09 16:28:37,526 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-01-09 16:28:37,526 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-01-09 16:28:37,526 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-01-09 16:28:37,527 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-01-09 16:28:37,527 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-01-09 16:28:37,527 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-01-09 16:28:37,527 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-01-09 16:28:37,527 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-01-09 16:28:37,527 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-01-09 16:28:37,527 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-01-09 16:28:37,527 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-01-09 16:28:37,527 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-01-09 16:28:37,527 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-01-09 16:28:37,527 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-01-09 16:28:37,527 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-01-09 16:28:37,527 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-01-09 16:28:37,527 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-01-09 16:28:37,527 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-01-09 16:28:37,527 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-01-09 16:28:37,527 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-01-09 16:28:37,527 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-01-09 16:28:37,527 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-01-09 16:28:37,528 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 -> 9ec75f624fee0326f6dc01ebf4c0afe8f65e83cfa5c5726cd79e55765f7366f9
[2025-01-09 16:28:37,732 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-01-09 16:28:37,737 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-01-09 16:28:37,739 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-01-09 16:28:37,739 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-01-09 16:28:37,740 INFO  L274        PluginConnector]: CDTParser initialized
[2025-01-09 16:28:37,740 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix055_tso.oepc.i
[2025-01-09 16:28:38,892 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9746a07e6/995c3a745c8f472587f5c17483a5e9a9/FLAG67c0574a5
[2025-01-09 16:28:39,183 INFO  L384              CDTParser]: Found 1 translation units.
[2025-01-09 16:28:39,184 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix055_tso.oepc.i
[2025-01-09 16:28:39,192 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9746a07e6/995c3a745c8f472587f5c17483a5e9a9/FLAG67c0574a5
[2025-01-09 16:28:39,201 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9746a07e6/995c3a745c8f472587f5c17483a5e9a9
[2025-01-09 16:28:39,202 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-01-09 16:28:39,203 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-01-09 16:28:39,204 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-01-09 16:28:39,204 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-01-09 16:28:39,206 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-01-09 16:28:39,207 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:28:39" (1/1) ...
[2025-01-09 16:28:39,207 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5056183a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:39, skipping insertion in model container
[2025-01-09 16:28:39,207 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:28:39" (1/1) ...
[2025-01-09 16:28:39,232 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-01-09 16:28:39,332 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/mix055_tso.oepc.i[949,962]
[2025-01-09 16:28:39,439 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-01-09 16:28:39,447 INFO  L200         MainTranslator]: Completed pre-run
[2025-01-09 16:28:39,454 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/mix055_tso.oepc.i[949,962]
[2025-01-09 16:28:39,505 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-01-09 16:28:39,533 INFO  L204         MainTranslator]: Completed translation
[2025-01-09 16:28:39,533 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:39 WrapperNode
[2025-01-09 16:28:39,533 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-01-09 16:28:39,534 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-01-09 16:28:39,534 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-01-09 16:28:39,534 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-01-09 16:28:39,540 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:39" (1/1) ...
[2025-01-09 16:28:39,548 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:39" (1/1) ...
[2025-01-09 16:28:39,569 INFO  L138                Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145
[2025-01-09 16:28:39,569 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-01-09 16:28:39,569 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-01-09 16:28:39,570 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-01-09 16:28:39,570 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-01-09 16:28:39,577 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:39" (1/1) ...
[2025-01-09 16:28:39,577 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:39" (1/1) ...
[2025-01-09 16:28:39,579 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:39" (1/1) ...
[2025-01-09 16:28:39,591 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-01-09 16:28:39,591 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:39" (1/1) ...
[2025-01-09 16:28:39,591 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:39" (1/1) ...
[2025-01-09 16:28:39,599 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:39" (1/1) ...
[2025-01-09 16:28:39,601 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:39" (1/1) ...
[2025-01-09 16:28:39,605 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:39" (1/1) ...
[2025-01-09 16:28:39,606 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:39" (1/1) ...
[2025-01-09 16:28:39,607 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:39" (1/1) ...
[2025-01-09 16:28:39,609 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-01-09 16:28:39,609 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-01-09 16:28:39,609 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-01-09 16:28:39,609 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-01-09 16:28:39,610 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:39" (1/1) ...
[2025-01-09 16:28:39,613 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-01-09 16:28:39,626 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-09 16:28:39,636 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-01-09 16:28:39,641 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-01-09 16:28:39,656 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2025-01-09 16:28:39,656 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-01-09 16:28:39,656 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2025-01-09 16:28:39,656 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2025-01-09 16:28:39,656 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2025-01-09 16:28:39,656 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2025-01-09 16:28:39,656 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2025-01-09 16:28:39,656 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2025-01-09 16:28:39,656 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2025-01-09 16:28:39,656 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2025-01-09 16:28:39,656 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-01-09 16:28:39,656 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2025-01-09 16:28:39,656 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-01-09 16:28:39,656 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-01-09 16:28:39,657 WARN  L203             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2025-01-09 16:28:39,755 INFO  L234             CfgBuilder]: Building ICFG
[2025-01-09 16:28:39,756 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-01-09 16:28:39,986 INFO  L279             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2025-01-09 16:28:39,987 INFO  L283             CfgBuilder]: Performing block encoding
[2025-01-09 16:28:40,143 INFO  L307             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-01-09 16:28:40,143 INFO  L312             CfgBuilder]: Removed 0 assume(true) statements.
[2025-01-09 16:28:40,143 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:28:40 BoogieIcfgContainer
[2025-01-09 16:28:40,143 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-01-09 16:28:40,146 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-01-09 16:28:40,146 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-01-09 16:28:40,149 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-01-09 16:28:40,149 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:28:39" (1/3) ...
[2025-01-09 16:28:40,150 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603b41fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:28:40, skipping insertion in model container
[2025-01-09 16:28:40,150 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:39" (2/3) ...
[2025-01-09 16:28:40,150 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603b41fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:28:40, skipping insertion in model container
[2025-01-09 16:28:40,150 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:28:40" (3/3) ...
[2025-01-09 16:28:40,151 INFO  L128   eAbstractionObserver]: Analyzing ICFG mix055_tso.oepc.i
[2025-01-09 16:28:40,161 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-01-09 16:28:40,162 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG mix055_tso.oepc.i that has 5 procedures, 48 locations, 1 initial locations, 0 loop locations, and 2 error locations.
[2025-01-09 16:28:40,162 INFO  L491   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2025-01-09 16:28:40,227 INFO  L143    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2025-01-09 16:28:40,258 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 60 places, 48 transitions, 112 flow
[2025-01-09 16:28:40,292 INFO  L124   PetriNetUnfolderBase]: 1/44 cut-off events.
[2025-01-09 16:28:40,295 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-01-09 16:28:40,297 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 57 conditions, 44 events. 1/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 96 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. 
[2025-01-09 16:28:40,298 INFO  L82        GeneralOperation]: Start removeDead. Operand has 60 places, 48 transitions, 112 flow
[2025-01-09 16:28:40,300 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 56 places, 44 transitions, 100 flow
[2025-01-09 16:28:40,308 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-01-09 16:28:40,319 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;@24f807e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-01-09 16:28:40,320 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2025-01-09 16:28:40,325 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2025-01-09 16:28:40,326 INFO  L124   PetriNetUnfolderBase]: 0/10 cut-off events.
[2025-01-09 16:28:40,326 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-01-09 16:28:40,326 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-01-09 16:28:40,326 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2025-01-09 16:28:40,327 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-01-09 16:28:40,330 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 16:28:40,330 INFO  L85        PathProgramCache]: Analyzing trace with hash -1078123554, now seen corresponding path program 1 times
[2025-01-09 16:28:40,335 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 16:28:40,336 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219001769]
[2025-01-09 16:28:40,336 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 16:28:40,337 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 16:28:40,398 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes.
[2025-01-09 16:28:40,428 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements.
[2025-01-09 16:28:40,430 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 16:28:40,430 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 16:28:40,718 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 16:28:40,719 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 16:28:40,719 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219001769]
[2025-01-09 16:28:40,719 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219001769] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 16:28:40,720 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 16:28:40,720 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2025-01-09 16:28:40,721 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472364194]
[2025-01-09 16:28:40,722 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 16:28:40,727 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-01-09 16:28:40,729 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 16:28:40,744 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-01-09 16:28:40,745 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-01-09 16:28:40,746 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 23 out of 48
[2025-01-09 16:28:40,748 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 flow. Second operand  has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-01-09 16:28:40,748 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-01-09 16:28:40,749 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 48
[2025-01-09 16:28:40,749 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-01-09 16:28:41,333 INFO  L124   PetriNetUnfolderBase]: 2160/3608 cut-off events.
[2025-01-09 16:28:41,333 INFO  L125   PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES.
[2025-01-09 16:28:41,344 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6737 conditions, 3608 events. 2160/3608 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 24693 event pairs, 384 based on Foata normal form. 108/3631 useless extension candidates. Maximal degree in co-relation 6725. Up to 2416 conditions per place. 
[2025-01-09 16:28:41,362 INFO  L140   encePairwiseOnDemand]: 44/48 looper letters, 35 selfloop transitions, 2 changer transitions 2/58 dead transitions.
[2025-01-09 16:28:41,363 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 58 transitions, 212 flow
[2025-01-09 16:28:41,364 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-01-09 16:28:41,366 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-01-09 16:28:41,372 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions.
[2025-01-09 16:28:41,374 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.7708333333333334
[2025-01-09 16:28:41,376 INFO  L175             Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 3 states and 111 transitions.
[2025-01-09 16:28:41,377 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 58 transitions, 212 flow
[2025-01-09 16:28:41,381 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 58 transitions, 206 flow, removed 0 selfloop flow, removed 4 redundant places.
[2025-01-09 16:28:41,384 INFO  L231             Difference]: Finished difference. Result has 53 places, 41 transitions, 94 flow
[2025-01-09 16:28:41,386 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=53, PETRI_TRANSITIONS=41}
[2025-01-09 16:28:41,389 INFO  L279   CegarLoopForPetriNet]: 56 programPoint places, -3 predicate places.
[2025-01-09 16:28:41,389 INFO  L471      AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 94 flow
[2025-01-09 16:28:41,390 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-01-09 16:28:41,391 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-01-09 16:28:41,391 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-09 16:28:41,391 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-01-09 16:28:41,391 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-01-09 16:28:41,392 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 16:28:41,392 INFO  L85        PathProgramCache]: Analyzing trace with hash -2028514403, now seen corresponding path program 1 times
[2025-01-09 16:28:41,392 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 16:28:41,392 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586107440]
[2025-01-09 16:28:41,393 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 16:28:41,393 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 16:28:41,411 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-01-09 16:28:41,469 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-01-09 16:28:41,469 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 16:28:41,470 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 16:28:41,694 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 16:28:41,694 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 16:28:41,695 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586107440]
[2025-01-09 16:28:41,695 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586107440] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 16:28:41,695 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 16:28:41,695 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-01-09 16:28:41,695 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087054931]
[2025-01-09 16:28:41,695 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 16:28:41,696 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-01-09 16:28:41,696 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 16:28:41,697 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-01-09 16:28:41,697 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-01-09 16:28:41,708 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48
[2025-01-09 16:28:41,709 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand  has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 16:28:41,709 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-01-09 16:28:41,709 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48
[2025-01-09 16:28:41,709 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-01-09 16:28:42,744 INFO  L124   PetriNetUnfolderBase]: 7149/10747 cut-off events.
[2025-01-09 16:28:42,745 INFO  L125   PetriNetUnfolderBase]: For 512/512 co-relation queries the response was YES.
[2025-01-09 16:28:42,762 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21271 conditions, 10747 events. 7149/10747 cut-off events. For 512/512 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 72092 event pairs, 869 based on Foata normal form. 320/10598 useless extension candidates. Maximal degree in co-relation 21261. Up to 5881 conditions per place. 
[2025-01-09 16:28:42,805 INFO  L140   encePairwiseOnDemand]: 41/48 looper letters, 50 selfloop transitions, 6 changer transitions 1/71 dead transitions.
[2025-01-09 16:28:42,805 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 71 transitions, 278 flow
[2025-01-09 16:28:42,805 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-01-09 16:28:42,806 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2025-01-09 16:28:42,807 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions.
[2025-01-09 16:28:42,807 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.6822916666666666
[2025-01-09 16:28:42,808 INFO  L175             Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 4 states and 131 transitions.
[2025-01-09 16:28:42,808 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 71 transitions, 278 flow
[2025-01-09 16:28:42,809 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 71 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-01-09 16:28:42,813 INFO  L231             Difference]: Finished difference. Result has 55 places, 45 transitions, 132 flow
[2025-01-09 16:28:42,813 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=55, PETRI_TRANSITIONS=45}
[2025-01-09 16:28:42,813 INFO  L279   CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places.
[2025-01-09 16:28:42,813 INFO  L471      AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 132 flow
[2025-01-09 16:28:42,814 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 16:28:42,814 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-01-09 16:28:42,814 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-01-09 16:28:42,814 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-01-09 16:28:42,814 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-01-09 16:28:42,815 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 16:28:42,815 INFO  L85        PathProgramCache]: Analyzing trace with hash -868401393, now seen corresponding path program 1 times
[2025-01-09 16:28:42,816 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 16:28:42,816 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761467667]
[2025-01-09 16:28:42,816 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 16:28:42,816 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 16:28:42,831 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes.
[2025-01-09 16:28:42,886 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements.
[2025-01-09 16:28:42,886 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 16:28:42,886 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 16:28:43,062 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 16:28:43,062 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 16:28:43,062 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761467667]
[2025-01-09 16:28:43,062 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761467667] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 16:28:43,063 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 16:28:43,063 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-01-09 16:28:43,063 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422250350]
[2025-01-09 16:28:43,063 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 16:28:43,063 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-01-09 16:28:43,063 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 16:28:43,063 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-01-09 16:28:43,063 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-01-09 16:28:43,076 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48
[2025-01-09 16:28:43,076 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 132 flow. Second operand  has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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-01-09 16:28:43,076 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-01-09 16:28:43,076 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48
[2025-01-09 16:28:43,076 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-01-09 16:28:43,926 INFO  L124   PetriNetUnfolderBase]: 5601/8471 cut-off events.
[2025-01-09 16:28:43,926 INFO  L125   PetriNetUnfolderBase]: For 2076/2076 co-relation queries the response was YES.
[2025-01-09 16:28:43,940 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19313 conditions, 8471 events. 5601/8471 cut-off events. For 2076/2076 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 54143 event pairs, 369 based on Foata normal form. 296/8410 useless extension candidates. Maximal degree in co-relation 19301. Up to 3901 conditions per place. 
[2025-01-09 16:28:43,968 INFO  L140   encePairwiseOnDemand]: 41/48 looper letters, 64 selfloop transitions, 10 changer transitions 1/89 dead transitions.
[2025-01-09 16:28:43,968 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 89 transitions, 399 flow
[2025-01-09 16:28:43,968 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-01-09 16:28:43,969 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2025-01-09 16:28:43,970 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 167 transitions.
[2025-01-09 16:28:43,971 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.6958333333333333
[2025-01-09 16:28:43,972 INFO  L175             Difference]: Start difference. First operand has 55 places, 45 transitions, 132 flow. Second operand 5 states and 167 transitions.
[2025-01-09 16:28:43,972 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 89 transitions, 399 flow
[2025-01-09 16:28:43,974 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 89 transitions, 388 flow, removed 1 selfloop flow, removed 2 redundant places.
[2025-01-09 16:28:43,977 INFO  L231             Difference]: Finished difference. Result has 59 places, 49 transitions, 184 flow
[2025-01-09 16:28:43,977 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=184, PETRI_PLACES=59, PETRI_TRANSITIONS=49}
[2025-01-09 16:28:43,978 INFO  L279   CegarLoopForPetriNet]: 56 programPoint places, 3 predicate places.
[2025-01-09 16:28:43,978 INFO  L471      AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 184 flow
[2025-01-09 16:28:43,979 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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-01-09 16:28:43,979 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-01-09 16:28:43,979 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-01-09 16:28:43,979 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-01-09 16:28:43,979 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-01-09 16:28:43,980 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 16:28:43,980 INFO  L85        PathProgramCache]: Analyzing trace with hash -2101044133, now seen corresponding path program 1 times
[2025-01-09 16:28:43,980 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 16:28:43,980 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782009401]
[2025-01-09 16:28:43,980 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 16:28:43,980 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 16:28:43,992 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes.
[2025-01-09 16:28:44,041 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements.
[2025-01-09 16:28:44,045 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 16:28:44,046 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 16:28:44,259 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 16:28:44,259 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 16:28:44,259 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782009401]
[2025-01-09 16:28:44,259 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782009401] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 16:28:44,259 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 16:28:44,259 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-01-09 16:28:44,259 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665338021]
[2025-01-09 16:28:44,260 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 16:28:44,260 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-01-09 16:28:44,261 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 16:28:44,261 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-01-09 16:28:44,261 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-01-09 16:28:44,274 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48
[2025-01-09 16:28:44,274 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 184 flow. Second operand  has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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-01-09 16:28:44,275 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-01-09 16:28:44,275 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48
[2025-01-09 16:28:44,275 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-01-09 16:28:44,780 INFO  L124   PetriNetUnfolderBase]: 3613/5435 cut-off events.
[2025-01-09 16:28:44,780 INFO  L125   PetriNetUnfolderBase]: For 4025/4025 co-relation queries the response was YES.
[2025-01-09 16:28:44,790 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13959 conditions, 5435 events. 3613/5435 cut-off events. For 4025/4025 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 31026 event pairs, 221 based on Foata normal form. 208/5423 useless extension candidates. Maximal degree in co-relation 13945. Up to 1501 conditions per place. 
[2025-01-09 16:28:44,805 INFO  L140   encePairwiseOnDemand]: 41/48 looper letters, 76 selfloop transitions, 14 changer transitions 1/105 dead transitions.
[2025-01-09 16:28:44,805 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 105 transitions, 526 flow
[2025-01-09 16:28:44,806 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-01-09 16:28:44,806 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-01-09 16:28:44,806 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 201 transitions.
[2025-01-09 16:28:44,807 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.6979166666666666
[2025-01-09 16:28:44,807 INFO  L175             Difference]: Start difference. First operand has 59 places, 49 transitions, 184 flow. Second operand 6 states and 201 transitions.
[2025-01-09 16:28:44,807 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 105 transitions, 526 flow
[2025-01-09 16:28:44,820 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 105 transitions, 496 flow, removed 5 selfloop flow, removed 4 redundant places.
[2025-01-09 16:28:44,821 INFO  L231             Difference]: Finished difference. Result has 62 places, 53 transitions, 234 flow
[2025-01-09 16:28:44,821 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=234, PETRI_PLACES=62, PETRI_TRANSITIONS=53}
[2025-01-09 16:28:44,822 INFO  L279   CegarLoopForPetriNet]: 56 programPoint places, 6 predicate places.
[2025-01-09 16:28:44,822 INFO  L471      AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 234 flow
[2025-01-09 16:28:44,822 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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-01-09 16:28:44,822 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-01-09 16:28:44,822 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-09 16:28:44,822 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-01-09 16:28:44,822 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-01-09 16:28:44,823 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 16:28:44,823 INFO  L85        PathProgramCache]: Analyzing trace with hash -2139085788, now seen corresponding path program 1 times
[2025-01-09 16:28:44,823 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 16:28:44,823 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857488200]
[2025-01-09 16:28:44,823 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 16:28:44,823 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 16:28:44,831 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes.
[2025-01-09 16:28:44,902 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements.
[2025-01-09 16:28:44,902 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 16:28:44,902 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 16:28:45,120 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 16:28:45,120 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 16:28:45,120 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857488200]
[2025-01-09 16:28:45,121 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857488200] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 16:28:45,121 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 16:28:45,121 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-01-09 16:28:45,121 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63587994]
[2025-01-09 16:28:45,121 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 16:28:45,121 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-01-09 16:28:45,121 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 16:28:45,121 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-01-09 16:28:45,121 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-01-09 16:28:45,127 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48
[2025-01-09 16:28:45,127 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 234 flow. Second operand  has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 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-01-09 16:28:45,127 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-01-09 16:28:45,127 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48
[2025-01-09 16:28:45,127 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-01-09 16:28:45,482 INFO  L124   PetriNetUnfolderBase]: 2425/3551 cut-off events.
[2025-01-09 16:28:45,482 INFO  L125   PetriNetUnfolderBase]: For 4281/4281 co-relation queries the response was YES.
[2025-01-09 16:28:45,488 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10008 conditions, 3551 events. 2425/3551 cut-off events. For 4281/4281 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 18326 event pairs, 173 based on Foata normal form. 88/3491 useless extension candidates. Maximal degree in co-relation 9993. Up to 1088 conditions per place. 
[2025-01-09 16:28:45,498 INFO  L140   encePairwiseOnDemand]: 41/48 looper letters, 68 selfloop transitions, 18 changer transitions 1/101 dead transitions.
[2025-01-09 16:28:45,498 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 101 transitions, 520 flow
[2025-01-09 16:28:45,498 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-01-09 16:28:45,498 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2025-01-09 16:28:45,499 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 215 transitions.
[2025-01-09 16:28:45,499 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.6398809523809523
[2025-01-09 16:28:45,499 INFO  L175             Difference]: Start difference. First operand has 62 places, 53 transitions, 234 flow. Second operand 7 states and 215 transitions.
[2025-01-09 16:28:45,499 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 101 transitions, 520 flow
[2025-01-09 16:28:45,513 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 101 transitions, 474 flow, removed 9 selfloop flow, removed 5 redundant places.
[2025-01-09 16:28:45,514 INFO  L231             Difference]: Finished difference. Result has 65 places, 53 transitions, 244 flow
[2025-01-09 16:28:45,514 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=244, PETRI_PLACES=65, PETRI_TRANSITIONS=53}
[2025-01-09 16:28:45,514 INFO  L279   CegarLoopForPetriNet]: 56 programPoint places, 9 predicate places.
[2025-01-09 16:28:45,514 INFO  L471      AbstractCegarLoop]: Abstraction has has 65 places, 53 transitions, 244 flow
[2025-01-09 16:28:45,515 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 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-01-09 16:28:45,515 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-01-09 16:28:45,515 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-09 16:28:45,515 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-01-09 16:28:45,515 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-01-09 16:28:45,515 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 16:28:45,515 INFO  L85        PathProgramCache]: Analyzing trace with hash 232089081, now seen corresponding path program 1 times
[2025-01-09 16:28:45,515 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 16:28:45,516 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590263383]
[2025-01-09 16:28:45,516 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 16:28:45,516 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 16:28:45,523 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes.
[2025-01-09 16:28:45,585 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements.
[2025-01-09 16:28:45,585 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 16:28:45,586 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 16:28:45,839 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 16:28:45,839 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 16:28:45,839 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590263383]
[2025-01-09 16:28:45,839 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590263383] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 16:28:45,839 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 16:28:45,839 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-01-09 16:28:45,839 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448890160]
[2025-01-09 16:28:45,839 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 16:28:45,840 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-01-09 16:28:45,840 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 16:28:45,840 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-01-09 16:28:45,840 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-01-09 16:28:45,849 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48
[2025-01-09 16:28:45,849 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 53 transitions, 244 flow. Second operand  has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 16:28:45,849 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-01-09 16:28:45,849 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48
[2025-01-09 16:28:45,849 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-01-09 16:28:46,376 INFO  L124   PetriNetUnfolderBase]: 2915/4751 cut-off events.
[2025-01-09 16:28:46,376 INFO  L125   PetriNetUnfolderBase]: For 2549/2775 co-relation queries the response was YES.
[2025-01-09 16:28:46,390 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11169 conditions, 4751 events. 2915/4751 cut-off events. For 2549/2775 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 30437 event pairs, 554 based on Foata normal form. 16/4490 useless extension candidates. Maximal degree in co-relation 11153. Up to 2088 conditions per place. 
[2025-01-09 16:28:46,404 INFO  L140   encePairwiseOnDemand]: 43/48 looper letters, 48 selfloop transitions, 2 changer transitions 12/90 dead transitions.
[2025-01-09 16:28:46,405 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 90 transitions, 458 flow
[2025-01-09 16:28:46,405 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-01-09 16:28:46,405 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-01-09 16:28:46,406 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 183 transitions.
[2025-01-09 16:28:46,406 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.6354166666666666
[2025-01-09 16:28:46,406 INFO  L175             Difference]: Start difference. First operand has 65 places, 53 transitions, 244 flow. Second operand 6 states and 183 transitions.
[2025-01-09 16:28:46,406 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 90 transitions, 458 flow
[2025-01-09 16:28:46,420 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 90 transitions, 352 flow, removed 22 selfloop flow, removed 10 redundant places.
[2025-01-09 16:28:46,421 INFO  L231             Difference]: Finished difference. Result has 64 places, 54 transitions, 165 flow
[2025-01-09 16:28:46,421 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=165, PETRI_PLACES=64, PETRI_TRANSITIONS=54}
[2025-01-09 16:28:46,422 INFO  L279   CegarLoopForPetriNet]: 56 programPoint places, 8 predicate places.
[2025-01-09 16:28:46,422 INFO  L471      AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 165 flow
[2025-01-09 16:28:46,422 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 16:28:46,422 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-01-09 16:28:46,422 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-09 16:28:46,422 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-01-09 16:28:46,422 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-01-09 16:28:46,423 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 16:28:46,423 INFO  L85        PathProgramCache]: Analyzing trace with hash 1799184441, now seen corresponding path program 2 times
[2025-01-09 16:28:46,423 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 16:28:46,423 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724083173]
[2025-01-09 16:28:46,423 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-01-09 16:28:46,423 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 16:28:46,434 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 1 equivalence classes.
[2025-01-09 16:28:46,501 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 36 statements.
[2025-01-09 16:28:46,501 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-01-09 16:28:46,501 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 16:28:48,744 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 16:28:48,744 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 16:28:48,744 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724083173]
[2025-01-09 16:28:48,744 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724083173] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 16:28:48,744 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 16:28:48,744 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2025-01-09 16:28:48,745 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166493833]
[2025-01-09 16:28:48,745 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 16:28:48,745 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-01-09 16:28:48,745 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 16:28:48,745 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-01-09 16:28:48,745 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132
[2025-01-09 16:28:48,757 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48
[2025-01-09 16:28:48,757 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 165 flow. Second operand  has 12 states, 12 states have (on average 22.666666666666668) internal successors, (272), 12 states have internal predecessors, (272), 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-01-09 16:28:48,757 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-01-09 16:28:48,757 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48
[2025-01-09 16:28:48,758 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-01-09 16:28:49,383 INFO  L124   PetriNetUnfolderBase]: 3885/6397 cut-off events.
[2025-01-09 16:28:49,384 INFO  L125   PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES.
[2025-01-09 16:28:49,407 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12799 conditions, 6397 events. 3885/6397 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 44371 event pairs, 1422 based on Foata normal form. 16/5802 useless extension candidates. Maximal degree in co-relation 12785. Up to 2176 conditions per place. 
[2025-01-09 16:28:49,418 INFO  L140   encePairwiseOnDemand]: 41/48 looper letters, 39 selfloop transitions, 5 changer transitions 19/93 dead transitions.
[2025-01-09 16:28:49,418 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 93 transitions, 383 flow
[2025-01-09 16:28:49,419 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-01-09 16:28:49,419 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2025-01-09 16:28:49,419 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 211 transitions.
[2025-01-09 16:28:49,419 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.6279761904761905
[2025-01-09 16:28:49,420 INFO  L175             Difference]: Start difference. First operand has 64 places, 54 transitions, 165 flow. Second operand 7 states and 211 transitions.
[2025-01-09 16:28:49,420 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 93 transitions, 383 flow
[2025-01-09 16:28:49,421 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 93 transitions, 376 flow, removed 3 selfloop flow, removed 3 redundant places.
[2025-01-09 16:28:49,422 INFO  L231             Difference]: Finished difference. Result has 69 places, 56 transitions, 188 flow
[2025-01-09 16:28:49,422 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=188, PETRI_PLACES=69, PETRI_TRANSITIONS=56}
[2025-01-09 16:28:49,425 INFO  L279   CegarLoopForPetriNet]: 56 programPoint places, 13 predicate places.
[2025-01-09 16:28:49,426 INFO  L471      AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 188 flow
[2025-01-09 16:28:49,426 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 22.666666666666668) internal successors, (272), 12 states have internal predecessors, (272), 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-01-09 16:28:49,426 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-01-09 16:28:49,426 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-09 16:28:49,426 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-01-09 16:28:49,426 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-01-09 16:28:49,428 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 16:28:49,428 INFO  L85        PathProgramCache]: Analyzing trace with hash -1257940217, now seen corresponding path program 3 times
[2025-01-09 16:28:49,428 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 16:28:49,428 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020369306]
[2025-01-09 16:28:49,428 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-01-09 16:28:49,428 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 16:28:49,438 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 1 equivalence classes.
[2025-01-09 16:28:49,489 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 36 statements.
[2025-01-09 16:28:49,489 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2025-01-09 16:28:49,489 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 16:28:49,643 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 16:28:49,644 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 16:28:49,644 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020369306]
[2025-01-09 16:28:49,644 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020369306] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 16:28:49,644 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 16:28:49,644 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-01-09 16:28:49,644 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490237881]
[2025-01-09 16:28:49,644 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 16:28:49,644 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-01-09 16:28:49,645 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 16:28:49,645 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-01-09 16:28:49,645 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-01-09 16:28:49,652 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48
[2025-01-09 16:28:49,652 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 188 flow. Second operand  has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 16:28:49,652 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-01-09 16:28:49,653 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48
[2025-01-09 16:28:49,653 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-01-09 16:28:50,417 INFO  L124   PetriNetUnfolderBase]: 7821/12791 cut-off events.
[2025-01-09 16:28:50,417 INFO  L125   PetriNetUnfolderBase]: For 1331/1333 co-relation queries the response was YES.
[2025-01-09 16:28:50,464 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26651 conditions, 12791 events. 7821/12791 cut-off events. For 1331/1333 co-relation queries the response was YES. Maximal size of possible extension queue 889. Compared 98040 event pairs, 1382 based on Foata normal form. 16/11812 useless extension candidates. Maximal degree in co-relation 26634. Up to 4974 conditions per place. 
[2025-01-09 16:28:50,485 INFO  L140   encePairwiseOnDemand]: 43/48 looper letters, 47 selfloop transitions, 2 changer transitions 12/91 dead transitions.
[2025-01-09 16:28:50,485 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 91 transitions, 402 flow
[2025-01-09 16:28:50,486 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-01-09 16:28:50,486 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-01-09 16:28:50,486 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions.
[2025-01-09 16:28:50,487 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.625
[2025-01-09 16:28:50,487 INFO  L175             Difference]: Start difference. First operand has 69 places, 56 transitions, 188 flow. Second operand 6 states and 180 transitions.
[2025-01-09 16:28:50,487 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 91 transitions, 402 flow
[2025-01-09 16:28:50,493 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 91 transitions, 388 flow, removed 3 selfloop flow, removed 4 redundant places.
[2025-01-09 16:28:50,494 INFO  L231             Difference]: Finished difference. Result has 72 places, 57 transitions, 197 flow
[2025-01-09 16:28:50,494 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=197, PETRI_PLACES=72, PETRI_TRANSITIONS=57}
[2025-01-09 16:28:50,495 INFO  L279   CegarLoopForPetriNet]: 56 programPoint places, 16 predicate places.
[2025-01-09 16:28:50,495 INFO  L471      AbstractCegarLoop]: Abstraction has has 72 places, 57 transitions, 197 flow
[2025-01-09 16:28:50,495 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 16:28:50,497 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-01-09 16:28:50,497 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-09 16:28:50,497 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-01-09 16:28:50,497 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-01-09 16:28:50,498 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 16:28:50,498 INFO  L85        PathProgramCache]: Analyzing trace with hash -89482979, now seen corresponding path program 4 times
[2025-01-09 16:28:50,498 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 16:28:50,498 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125712910]
[2025-01-09 16:28:50,498 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-01-09 16:28:50,499 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 16:28:50,517 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes.
[2025-01-09 16:28:50,560 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements.
[2025-01-09 16:28:50,560 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s)
[2025-01-09 16:28:50,560 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 16:28:50,859 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 16:28:50,859 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 16:28:50,859 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125712910]
[2025-01-09 16:28:50,859 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125712910] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 16:28:50,859 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 16:28:50,859 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-01-09 16:28:50,860 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357850748]
[2025-01-09 16:28:50,860 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 16:28:50,860 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-01-09 16:28:50,860 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 16:28:50,860 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-01-09 16:28:50,860 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-01-09 16:28:50,878 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48
[2025-01-09 16:28:50,878 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 57 transitions, 197 flow. Second operand  has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 16:28:50,879 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-01-09 16:28:50,879 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48
[2025-01-09 16:28:50,879 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-01-09 16:28:52,520 INFO  L124   PetriNetUnfolderBase]: 17486/27790 cut-off events.
[2025-01-09 16:28:52,521 INFO  L125   PetriNetUnfolderBase]: For 4657/4659 co-relation queries the response was YES.
[2025-01-09 16:28:52,639 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 60422 conditions, 27790 events. 17486/27790 cut-off events. For 4657/4659 co-relation queries the response was YES. Maximal size of possible extension queue 1919. Compared 225024 event pairs, 7780 based on Foata normal form. 16/25926 useless extension candidates. Maximal degree in co-relation 60403. Up to 11489 conditions per place. 
[2025-01-09 16:28:52,658 INFO  L140   encePairwiseOnDemand]: 42/48 looper letters, 28 selfloop transitions, 2 changer transitions 29/85 dead transitions.
[2025-01-09 16:28:52,659 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 85 transitions, 395 flow
[2025-01-09 16:28:52,659 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-01-09 16:28:52,659 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2025-01-09 16:28:52,659 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions.
[2025-01-09 16:28:52,660 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.5958333333333333
[2025-01-09 16:28:52,660 INFO  L175             Difference]: Start difference. First operand has 72 places, 57 transitions, 197 flow. Second operand 5 states and 143 transitions.
[2025-01-09 16:28:52,660 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 85 transitions, 395 flow
[2025-01-09 16:28:52,711 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 85 transitions, 388 flow, removed 3 selfloop flow, removed 3 redundant places.
[2025-01-09 16:28:52,712 INFO  L231             Difference]: Finished difference. Result has 75 places, 53 transitions, 186 flow
[2025-01-09 16:28:52,712 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=75, PETRI_TRANSITIONS=53}
[2025-01-09 16:28:52,712 INFO  L279   CegarLoopForPetriNet]: 56 programPoint places, 19 predicate places.
[2025-01-09 16:28:52,713 INFO  L471      AbstractCegarLoop]: Abstraction has has 75 places, 53 transitions, 186 flow
[2025-01-09 16:28:52,713 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 16:28:52,713 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-01-09 16:28:52,713 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-09 16:28:52,713 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-01-09 16:28:52,713 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-01-09 16:28:52,713 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 16:28:52,713 INFO  L85        PathProgramCache]: Analyzing trace with hash -1732719777, now seen corresponding path program 5 times
[2025-01-09 16:28:52,714 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 16:28:52,714 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22659675]
[2025-01-09 16:28:52,714 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-01-09 16:28:52,714 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 16:28:52,722 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 1 equivalence classes.
[2025-01-09 16:28:52,759 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 36 statements.
[2025-01-09 16:28:52,760 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-01-09 16:28:52,760 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-09 16:28:52,760 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-01-09 16:28:52,766 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes.
[2025-01-09 16:28:52,809 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements.
[2025-01-09 16:28:52,809 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 16:28:52,809 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-09 16:28:52,839 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-01-09 16:28:52,839 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-01-09 16:28:52,840 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining)
[2025-01-09 16:28:52,841 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining)
[2025-01-09 16:28:52,841 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining)
[2025-01-09 16:28:52,841 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining)
[2025-01-09 16:28:52,841 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining)
[2025-01-09 16:28:52,841 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining)
[2025-01-09 16:28:52,842 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining)
[2025-01-09 16:28:52,842 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-01-09 16:28:52,842 INFO  L422         BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1]
[2025-01-09 16:28:52,913 INFO  L241   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2025-01-09 16:28:52,913 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-01-09 16:28:52,917 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:28:52 BasicIcfg
[2025-01-09 16:28:52,917 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-01-09 16:28:52,917 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-01-09 16:28:52,917 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-01-09 16:28:52,918 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-01-09 16:28:52,918 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:28:40" (3/4) ...
[2025-01-09 16:28:52,919 INFO  L140         WitnessPrinter]: Generating witness for reachability counterexample
[2025-01-09 16:28:53,003 INFO  L127   tionWitnessGenerator]: Generated YAML witness of length 9.
[2025-01-09 16:28:53,045 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-01-09 16:28:53,045 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-01-09 16:28:53,045 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-01-09 16:28:53,048 INFO  L158              Benchmark]: Toolchain (without parser) took 13842.98ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 998.2MB). Free memory was 123.4MB in the beginning and 602.0MB in the end (delta: -478.5MB). Peak memory consumption was 524.0MB. Max. memory is 16.1GB.
[2025-01-09 16:28:53,048 INFO  L158              Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-01-09 16:28:53,048 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 329.75ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 98.6MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2025-01-09 16:28:53,048 INFO  L158              Benchmark]: Boogie Procedure Inliner took 35.07ms. Allocated memory is still 167.8MB. Free memory was 98.6MB in the beginning and 96.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-01-09 16:28:53,048 INFO  L158              Benchmark]: Boogie Preprocessor took 39.22ms. Allocated memory is still 167.8MB. Free memory was 96.7MB in the beginning and 93.2MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-01-09 16:28:53,049 INFO  L158              Benchmark]: RCFGBuilder took 534.10ms. Allocated memory is still 167.8MB. Free memory was 93.2MB in the beginning and 38.9MB in the end (delta: 54.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB.
[2025-01-09 16:28:53,049 INFO  L158              Benchmark]: TraceAbstraction took 12770.93ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 998.2MB). Free memory was 38.0MB in the beginning and 623.0MB in the end (delta: -585.0MB). Peak memory consumption was 414.9MB. Max. memory is 16.1GB.
[2025-01-09 16:28:53,049 INFO  L158              Benchmark]: Witness Printer took 128.11ms. Allocated memory is still 1.2GB. Free memory was 623.0MB in the beginning and 602.0MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2025-01-09 16:28:53,051 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.13ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 329.75ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 98.6MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 35.07ms. Allocated memory is still 167.8MB. Free memory was 98.6MB in the beginning and 96.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 39.22ms. Allocated memory is still 167.8MB. Free memory was 96.7MB in the beginning and 93.2MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * RCFGBuilder took 534.10ms. Allocated memory is still 167.8MB. Free memory was 93.2MB in the beginning and 38.9MB in the end (delta: 54.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB.
 * TraceAbstraction took 12770.93ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 998.2MB). Free memory was 38.0MB in the beginning and 623.0MB in the end (delta: -585.0MB). Peak memory consumption was 414.9MB. Max. memory is 16.1GB.
 * Witness Printer took 128.11ms. Allocated memory is still 1.2GB. Free memory was 623.0MB in the beginning and 602.0MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - CounterExampleResult [Line: 18]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L710]               0  int __unbuffered_cnt = 0;
[L712]               0  int __unbuffered_p1_EAX = 0;
[L714]               0  int __unbuffered_p3_EAX = 0;
[L716]               0  int a = 0;
[L717]               0  _Bool main$tmp_guard0;
[L718]               0  _Bool main$tmp_guard1;
[L720]               0  int x = 0;
[L721]               0  _Bool x$flush_delayed;
[L722]               0  int x$mem_tmp;
[L723]               0  _Bool x$r_buff0_thd0;
[L724]               0  _Bool x$r_buff0_thd1;
[L725]               0  _Bool x$r_buff0_thd2;
[L726]               0  _Bool x$r_buff0_thd3;
[L727]               0  _Bool x$r_buff0_thd4;
[L728]               0  _Bool x$r_buff1_thd0;
[L729]               0  _Bool x$r_buff1_thd1;
[L730]               0  _Bool x$r_buff1_thd2;
[L731]               0  _Bool x$r_buff1_thd3;
[L732]               0  _Bool x$r_buff1_thd4;
[L733]               0  _Bool x$read_delayed;
[L734]               0  int *x$read_delayed_var;
[L735]               0  int x$w_buff0;
[L736]               0  _Bool x$w_buff0_used;
[L737]               0  int x$w_buff1;
[L738]               0  _Bool x$w_buff1_used;
[L740]               0  int y = 0;
[L742]               0  int z = 0;
[L743]               0  _Bool weak$$choice0;
[L744]               0  _Bool weak$$choice2;
[L846]               0  pthread_t t1481;
[L847]  FCALL, FORK  0  pthread_create(&t1481, ((void *)0), P0, ((void *)0))
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1481=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0]
[L848]               0  pthread_t t1482;
[L849]  FCALL, FORK  0  pthread_create(&t1482, ((void *)0), P1, ((void *)0))
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1481=-1, t1482=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0]
[L768]               2  x$w_buff1 = x$w_buff0
[L769]               2  x$w_buff0 = 2
[L770]               2  x$w_buff1_used = x$w_buff0_used
[L771]               2  x$w_buff0_used = (_Bool)1
[L772]  CALL         2  __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L18]   COND FALSE   2  !(!expression)
[L772]  RET          2  __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L773]               2  x$r_buff1_thd0 = x$r_buff0_thd0
[L774]               2  x$r_buff1_thd1 = x$r_buff0_thd1
[L775]               2  x$r_buff1_thd2 = x$r_buff0_thd2
[L776]               2  x$r_buff1_thd3 = x$r_buff0_thd3
[L777]               2  x$r_buff1_thd4 = x$r_buff0_thd4
[L778]               2  x$r_buff0_thd2 = (_Bool)1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0]
[L850]               0  pthread_t t1483;
[L851]  FCALL, FORK  0  pthread_create(&t1483, ((void *)0), P2, ((void *)0))
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1481=-1, t1482=0, t1483=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0]
[L852]               0  pthread_t t1484;
[L781]               2  __unbuffered_p1_EAX = y
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0]
[L798]               3  y = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0]
[L801]               3  z = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1]
[L853]  FCALL, FORK  0  pthread_create(&t1484, ((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_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1481=-1, t1482=0, t1483=1, t1484=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1]
[L804]               3  x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L805]               3  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L806]               3  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L807]               3  x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L808]               3  x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1]
[L818]               4  z = 2
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2]
[L821]               4  __unbuffered_p3_EAX = a
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2]
[L748]               1  a = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2]
[L751]               1  x = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2]
[L754]               1  x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L755]               1  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L756]               1  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L757]               1  x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L758]               1  x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2]
[L824]               4  x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x)
[L825]               4  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used
[L826]               4  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used
[L827]               4  x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4
[L828]               4  x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2]
[L784]               2  x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L785]               2  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L786]               2  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L787]               2  x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L788]               2  x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
        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_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2]
[L761]               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_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2]
[L791]               2  __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_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2]
[L811]               3  __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_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2]
[L831]               4  __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_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2]
[L855]               0  main$tmp_guard0 = __unbuffered_cnt == 4
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1481=-1, t1482=0, t1483=1, t1484=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2]
[L857]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L3]    COND FALSE   0  !(!cond)
[L857]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L859]               0  x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L860]               0  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L861]               0  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L862]               0  x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L863]               0  x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1481=-1, t1482=0, t1483=1, t1484=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2]
[L866]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L867]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L868]               0  x$flush_delayed = weak$$choice2
[L869]               0  x$mem_tmp = x
[L870]               0  x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L871]               0  x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L872]               0  x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L873]               0  x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L874]               0  x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L875]               0  x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L876]               0  x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L877]               0  main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0)
[L878]               0  x = x$flush_delayed ? x$mem_tmp : x
[L879]               0  x$flush_delayed = (_Bool)0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1481=-1, t1482=0, t1483=1, t1484=2, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2]
[L881]  CALL         0  __VERIFIER_assert(main$tmp_guard1)
[L18]   COND TRUE    0  !expression
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2]
[L18]                0  reach_error()
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2]

  - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable
    Unable to prove that a call to reach_error is unreachable
 Reason: Not analyzed. 
  - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 9 procedures, 81 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: 12.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 593 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 551 mSDsluCounter, 178 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 144 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1371 IncrementalHoareTripleChecker+Invalid, 1420 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 34 mSDtfsCounter, 1371 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=244occurred in iteration=5, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 280 NumberOfCodeBlocks, 280 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 235 ConstructedInterpolants, 0 QuantifiedInterpolants, 1397 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-01-09 16:28:53,068 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