./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix008.opt.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/mix008.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0e3ed0a0904abf0f880f0f4cc8dc485f79821c4ff1d089df229be68889497ed8
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-551b009-m
[2025-01-09 16:25:36,305 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-01-09 16:25:36,384 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:25:36,389 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-01-09 16:25:36,389 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-01-09 16:25:36,413 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-01-09 16:25:36,414 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-01-09 16:25:36,414 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-01-09 16:25:36,414 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-01-09 16:25:36,414 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-01-09 16:25:36,415 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-01-09 16:25:36,415 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-01-09 16:25:36,415 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-01-09 16:25:36,415 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-01-09 16:25:36,415 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-01-09 16:25:36,415 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-01-09 16:25:36,415 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-01-09 16:25:36,415 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-01-09 16:25:36,417 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-01-09 16:25:36,417 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-01-09 16:25:36,417 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-01-09 16:25:36,417 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-01-09 16:25:36,418 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-01-09 16:25:36,418 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-01-09 16:25:36,418 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-01-09 16:25:36,418 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-01-09 16:25:36,418 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-01-09 16:25:36,418 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-01-09 16:25:36,418 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-01-09 16:25:36,418 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-01-09 16:25:36,419 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-01-09 16:25:36,419 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-01-09 16:25:36,419 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-01-09 16:25:36,419 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-01-09 16:25:36,419 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-01-09 16:25:36,419 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-01-09 16:25:36,419 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-01-09 16:25:36,420 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-01-09 16:25:36,420 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-01-09 16:25:36,420 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-01-09 16:25:36,420 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-01-09 16:25:36,420 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-01-09 16:25:36,420 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-01-09 16:25:36,420 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-01-09 16:25:36,421 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-01-09 16:25:36,421 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-01-09 16:25:36,421 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-01-09 16:25:36,421 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-01-09 16:25:36,421 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 -> 0e3ed0a0904abf0f880f0f4cc8dc485f79821c4ff1d089df229be68889497ed8
[2025-01-09 16:25:36,724 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-01-09 16:25:36,732 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-01-09 16:25:36,734 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-01-09 16:25:36,735 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-01-09 16:25:36,735 INFO  L274        PluginConnector]: CDTParser initialized
[2025-01-09 16:25:36,736 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix008.opt.i
[2025-01-09 16:25:38,105 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a05510be/8c12018b451e437681b4ff44d200724b/FLAGbe634ffb3
[2025-01-09 16:25:38,448 INFO  L384              CDTParser]: Found 1 translation units.
[2025-01-09 16:25:38,449 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix008.opt.i
[2025-01-09 16:25:38,462 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a05510be/8c12018b451e437681b4ff44d200724b/FLAGbe634ffb3
[2025-01-09 16:25:38,474 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a05510be/8c12018b451e437681b4ff44d200724b
[2025-01-09 16:25:38,476 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-01-09 16:25:38,478 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-01-09 16:25:38,479 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-01-09 16:25:38,479 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-01-09 16:25:38,483 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-01-09 16:25:38,484 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:25:38" (1/1) ...
[2025-01-09 16:25:38,485 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22da2d19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:25:38, skipping insertion in model container
[2025-01-09 16:25:38,486 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:25:38" (1/1) ...
[2025-01-09 16:25:38,521 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-01-09 16:25:38,679 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/mix008.opt.i[944,957]
[2025-01-09 16:25:38,843 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-01-09 16:25:38,855 INFO  L200         MainTranslator]: Completed pre-run
[2025-01-09 16:25:38,869 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/mix008.opt.i[944,957]
[2025-01-09 16:25:38,936 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-01-09 16:25:38,969 INFO  L204         MainTranslator]: Completed translation
[2025-01-09 16:25:38,970 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:25:38 WrapperNode
[2025-01-09 16:25:38,970 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-01-09 16:25:38,971 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-01-09 16:25:38,971 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-01-09 16:25:38,972 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-01-09 16:25:38,977 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:25:38" (1/1) ...
[2025-01-09 16:25:38,990 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:25:38" (1/1) ...
[2025-01-09 16:25:39,010 INFO  L138                Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150
[2025-01-09 16:25:39,010 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-01-09 16:25:39,011 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-01-09 16:25:39,011 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-01-09 16:25:39,011 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-01-09 16:25:39,019 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:25:38" (1/1) ...
[2025-01-09 16:25:39,020 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:25:38" (1/1) ...
[2025-01-09 16:25:39,023 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:25:38" (1/1) ...
[2025-01-09 16:25:39,039 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:25:39,039 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:25:38" (1/1) ...
[2025-01-09 16:25:39,039 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:25:38" (1/1) ...
[2025-01-09 16:25:39,046 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:25:38" (1/1) ...
[2025-01-09 16:25:39,047 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:25:38" (1/1) ...
[2025-01-09 16:25:39,049 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:25:38" (1/1) ...
[2025-01-09 16:25:39,050 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:25:38" (1/1) ...
[2025-01-09 16:25:39,052 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:25:38" (1/1) ...
[2025-01-09 16:25:39,054 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-01-09 16:25:39,055 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-01-09 16:25:39,055 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-01-09 16:25:39,055 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-01-09 16:25:39,056 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:25:38" (1/1) ...
[2025-01-09 16:25:39,065 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-01-09 16:25:39,086 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-09 16:25:39,100 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:25:39,103 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:25:39,124 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2025-01-09 16:25:39,125 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-01-09 16:25:39,125 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2025-01-09 16:25:39,125 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2025-01-09 16:25:39,125 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2025-01-09 16:25:39,125 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2025-01-09 16:25:39,125 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2025-01-09 16:25:39,125 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2025-01-09 16:25:39,125 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2025-01-09 16:25:39,125 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2025-01-09 16:25:39,125 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-01-09 16:25:39,125 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2025-01-09 16:25:39,125 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-01-09 16:25:39,125 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-01-09 16:25:39,128 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:25:39,273 INFO  L234             CfgBuilder]: Building ICFG
[2025-01-09 16:25:39,276 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-01-09 16:25:39,590 INFO  L279             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2025-01-09 16:25:39,590 INFO  L283             CfgBuilder]: Performing block encoding
[2025-01-09 16:25:39,834 INFO  L307             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-01-09 16:25:39,835 INFO  L312             CfgBuilder]: Removed 0 assume(true) statements.
[2025-01-09 16:25:39,835 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:25:39 BoogieIcfgContainer
[2025-01-09 16:25:39,836 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-01-09 16:25:39,838 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-01-09 16:25:39,838 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-01-09 16:25:39,842 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-01-09 16:25:39,843 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:25:38" (1/3) ...
[2025-01-09 16:25:39,844 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6af8ddde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:25:39, skipping insertion in model container
[2025-01-09 16:25:39,844 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:25:38" (2/3) ...
[2025-01-09 16:25:39,844 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6af8ddde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:25:39, skipping insertion in model container
[2025-01-09 16:25:39,844 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:25:39" (3/3) ...
[2025-01-09 16:25:39,845 INFO  L128   eAbstractionObserver]: Analyzing ICFG mix008.opt.i
[2025-01-09 16:25:39,860 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-01-09 16:25:39,863 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG mix008.opt.i that has 5 procedures, 50 locations, 1 initial locations, 0 loop locations, and 2 error locations.
[2025-01-09 16:25:39,864 INFO  L491   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2025-01-09 16:25:39,936 INFO  L143    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2025-01-09 16:25:39,974 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 116 flow
[2025-01-09 16:25:40,015 INFO  L124   PetriNetUnfolderBase]: 1/46 cut-off events.
[2025-01-09 16:25:40,017 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-01-09 16:25:40,024 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 99 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. 
[2025-01-09 16:25:40,024 INFO  L82        GeneralOperation]: Start removeDead. Operand has 62 places, 50 transitions, 116 flow
[2025-01-09 16:25:40,028 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 58 places, 46 transitions, 104 flow
[2025-01-09 16:25:40,041 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-01-09 16:25:40,056 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;@cec3795, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-01-09 16:25:40,057 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2025-01-09 16:25:40,068 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2025-01-09 16:25:40,068 INFO  L124   PetriNetUnfolderBase]: 0/25 cut-off events.
[2025-01-09 16:25:40,068 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-01-09 16:25:40,069 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-01-09 16:25:40,069 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-09 16:25:40,070 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-01-09 16:25:40,075 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 16:25:40,076 INFO  L85        PathProgramCache]: Analyzing trace with hash -1696924527, now seen corresponding path program 1 times
[2025-01-09 16:25:40,083 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 16:25:40,084 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15139490]
[2025-01-09 16:25:40,084 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 16:25:40,087 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 16:25:40,162 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes.
[2025-01-09 16:25:40,204 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements.
[2025-01-09 16:25:40,206 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 16:25:40,206 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 16:25:40,590 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 16:25:40,591 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 16:25:40,591 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15139490]
[2025-01-09 16:25:40,592 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15139490] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 16:25:40,592 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 16:25:40,592 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2025-01-09 16:25:40,593 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247581079]
[2025-01-09 16:25:40,594 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 16:25:40,599 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-01-09 16:25:40,603 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 16:25:40,623 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-01-09 16:25:40,625 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-01-09 16:25:40,626 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 27 out of 50
[2025-01-09 16:25:40,630 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand  has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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:25:40,630 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-01-09 16:25:40,631 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 50
[2025-01-09 16:25:40,632 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-01-09 16:25:41,072 INFO  L124   PetriNetUnfolderBase]: 879/1527 cut-off events.
[2025-01-09 16:25:41,074 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-01-09 16:25:41,082 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2847 conditions, 1527 events. 879/1527 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 10567 event pairs, 159 based on Foata normal form. 60/1546 useless extension candidates. Maximal degree in co-relation 2835. Up to 1009 conditions per place. 
[2025-01-09 16:25:41,098 INFO  L140   encePairwiseOnDemand]: 46/50 looper letters, 26 selfloop transitions, 2 changer transitions 2/53 dead transitions.
[2025-01-09 16:25:41,099 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 53 transitions, 178 flow
[2025-01-09 16:25:41,100 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-01-09 16:25:41,103 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-01-09 16:25:41,111 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions.
[2025-01-09 16:25:41,115 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.76
[2025-01-09 16:25:41,117 INFO  L175             Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 114 transitions.
[2025-01-09 16:25:41,118 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 53 transitions, 178 flow
[2025-01-09 16:25:41,122 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 174 flow, removed 0 selfloop flow, removed 4 redundant places.
[2025-01-09 16:25:41,125 INFO  L231             Difference]: Finished difference. Result has 55 places, 43 transitions, 98 flow
[2025-01-09 16:25:41,127 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=55, PETRI_TRANSITIONS=43}
[2025-01-09 16:25:41,133 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places.
[2025-01-09 16:25:41,134 INFO  L471      AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 98 flow
[2025-01-09 16:25:41,134 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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:25:41,134 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-01-09 16:25:41,134 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:25:41,135 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-01-09 16:25:41,135 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-01-09 16:25:41,136 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 16:25:41,136 INFO  L85        PathProgramCache]: Analyzing trace with hash -235632846, now seen corresponding path program 1 times
[2025-01-09 16:25:41,136 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 16:25:41,136 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719238197]
[2025-01-09 16:25:41,136 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 16:25:41,137 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 16:25:41,158 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-01-09 16:25:41,210 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-01-09 16:25:41,214 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 16:25:41,214 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 16:25:41,461 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:25:41,462 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 16:25:41,462 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719238197]
[2025-01-09 16:25:41,462 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719238197] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 16:25:41,462 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 16:25:41,462 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-01-09 16:25:41,462 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927980885]
[2025-01-09 16:25:41,462 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 16:25:41,463 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-01-09 16:25:41,463 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 16:25:41,463 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-01-09 16:25:41,463 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-01-09 16:25:41,472 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50
[2025-01-09 16:25:41,472 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand  has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 16:25:41,472 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-01-09 16:25:41,472 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50
[2025-01-09 16:25:41,472 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-01-09 16:25:42,440 INFO  L124   PetriNetUnfolderBase]: 4037/6466 cut-off events.
[2025-01-09 16:25:42,440 INFO  L125   PetriNetUnfolderBase]: For 244/244 co-relation queries the response was YES.
[2025-01-09 16:25:42,457 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12426 conditions, 6466 events. 4037/6466 cut-off events. For 244/244 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 45548 event pairs, 603 based on Foata normal form. 216/6464 useless extension candidates. Maximal degree in co-relation 12416. Up to 3225 conditions per place. 
[2025-01-09 16:25:42,491 INFO  L140   encePairwiseOnDemand]: 43/50 looper letters, 46 selfloop transitions, 6 changer transitions 1/71 dead transitions.
[2025-01-09 16:25:42,491 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 71 transitions, 270 flow
[2025-01-09 16:25:42,492 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-01-09 16:25:42,492 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2025-01-09 16:25:42,494 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions.
[2025-01-09 16:25:42,495 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.715
[2025-01-09 16:25:42,495 INFO  L175             Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 4 states and 143 transitions.
[2025-01-09 16:25:42,495 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 71 transitions, 270 flow
[2025-01-09 16:25:42,497 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 71 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-01-09 16:25:42,500 INFO  L231             Difference]: Finished difference. Result has 57 places, 47 transitions, 136 flow
[2025-01-09 16:25:42,501 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=57, PETRI_TRANSITIONS=47}
[2025-01-09 16:25:42,502 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, -1 predicate places.
[2025-01-09 16:25:42,502 INFO  L471      AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 136 flow
[2025-01-09 16:25:42,503 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 16:25:42,503 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-01-09 16:25:42,503 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:25:42,503 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-01-09 16:25:42,503 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-01-09 16:25:42,504 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 16:25:42,504 INFO  L85        PathProgramCache]: Analyzing trace with hash -251139434, now seen corresponding path program 1 times
[2025-01-09 16:25:42,504 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 16:25:42,504 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108904322]
[2025-01-09 16:25:42,504 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 16:25:42,504 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 16:25:42,519 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes.
[2025-01-09 16:25:42,544 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements.
[2025-01-09 16:25:42,544 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 16:25:42,544 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 16:25:42,739 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:25:42,740 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 16:25:42,741 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108904322]
[2025-01-09 16:25:42,741 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108904322] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 16:25:42,741 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 16:25:42,741 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-01-09 16:25:42,741 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402319559]
[2025-01-09 16:25:42,741 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 16:25:42,741 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-01-09 16:25:42,742 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 16:25:42,742 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-01-09 16:25:42,743 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-01-09 16:25:42,750 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50
[2025-01-09 16:25:42,751 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 136 flow. Second operand  has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:25:42,752 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-01-09 16:25:42,752 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50
[2025-01-09 16:25:42,752 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-01-09 16:25:43,427 INFO  L124   PetriNetUnfolderBase]: 3433/5500 cut-off events.
[2025-01-09 16:25:43,428 INFO  L125   PetriNetUnfolderBase]: For 1468/1468 co-relation queries the response was YES.
[2025-01-09 16:25:43,444 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12506 conditions, 5500 events. 3433/5500 cut-off events. For 1468/1468 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 37375 event pairs, 213 based on Foata normal form. 208/5534 useless extension candidates. Maximal degree in co-relation 12494. Up to 2433 conditions per place. 
[2025-01-09 16:25:43,474 INFO  L140   encePairwiseOnDemand]: 43/50 looper letters, 59 selfloop transitions, 10 changer transitions 1/88 dead transitions.
[2025-01-09 16:25:43,475 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 88 transitions, 387 flow
[2025-01-09 16:25:43,475 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-01-09 16:25:43,475 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2025-01-09 16:25:43,477 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions.
[2025-01-09 16:25:43,478 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.728
[2025-01-09 16:25:43,478 INFO  L175             Difference]: Start difference. First operand has 57 places, 47 transitions, 136 flow. Second operand 5 states and 182 transitions.
[2025-01-09 16:25:43,478 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 88 transitions, 387 flow
[2025-01-09 16:25:43,483 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 88 transitions, 376 flow, removed 1 selfloop flow, removed 2 redundant places.
[2025-01-09 16:25:43,484 INFO  L231             Difference]: Finished difference. Result has 61 places, 51 transitions, 188 flow
[2025-01-09 16:25:43,485 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=61, PETRI_TRANSITIONS=51}
[2025-01-09 16:25:43,486 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places.
[2025-01-09 16:25:43,487 INFO  L471      AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 188 flow
[2025-01-09 16:25:43,487 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:25:43,487 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-01-09 16:25:43,487 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:25:43,488 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-01-09 16:25:43,488 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-01-09 16:25:43,489 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 16:25:43,489 INFO  L85        PathProgramCache]: Analyzing trace with hash 1314874476, now seen corresponding path program 1 times
[2025-01-09 16:25:43,489 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 16:25:43,489 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769932560]
[2025-01-09 16:25:43,489 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 16:25:43,489 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 16:25:43,499 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes.
[2025-01-09 16:25:43,513 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements.
[2025-01-09 16:25:43,514 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 16:25:43,514 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 16:25:43,669 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:25:43,670 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 16:25:43,670 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769932560]
[2025-01-09 16:25:43,670 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769932560] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 16:25:43,670 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 16:25:43,670 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-01-09 16:25:43,670 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664505860]
[2025-01-09 16:25:43,670 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 16:25:43,671 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-01-09 16:25:43,671 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 16:25:43,671 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-01-09 16:25:43,671 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-01-09 16:25:43,680 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50
[2025-01-09 16:25:43,681 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 188 flow. Second operand  has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 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:25:43,681 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-01-09 16:25:43,681 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50
[2025-01-09 16:25:43,681 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-01-09 16:25:44,304 INFO  L124   PetriNetUnfolderBase]: 2355/3706 cut-off events.
[2025-01-09 16:25:44,305 INFO  L125   PetriNetUnfolderBase]: For 3022/3022 co-relation queries the response was YES.
[2025-01-09 16:25:44,321 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9624 conditions, 3706 events. 2355/3706 cut-off events. For 3022/3022 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 21956 event pairs, 81 based on Foata normal form. 164/3780 useless extension candidates. Maximal degree in co-relation 9610. Up to 1089 conditions per place. 
[2025-01-09 16:25:44,339 INFO  L140   encePairwiseOnDemand]: 43/50 looper letters, 70 selfloop transitions, 14 changer transitions 1/103 dead transitions.
[2025-01-09 16:25:44,339 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 103 transitions, 510 flow
[2025-01-09 16:25:44,340 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-01-09 16:25:44,340 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-01-09 16:25:44,341 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 219 transitions.
[2025-01-09 16:25:44,342 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.73
[2025-01-09 16:25:44,342 INFO  L175             Difference]: Start difference. First operand has 61 places, 51 transitions, 188 flow. Second operand 6 states and 219 transitions.
[2025-01-09 16:25:44,342 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 103 transitions, 510 flow
[2025-01-09 16:25:44,355 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 103 transitions, 480 flow, removed 5 selfloop flow, removed 4 redundant places.
[2025-01-09 16:25:44,357 INFO  L231             Difference]: Finished difference. Result has 64 places, 55 transitions, 238 flow
[2025-01-09 16:25:44,357 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=64, PETRI_TRANSITIONS=55}
[2025-01-09 16:25:44,359 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places.
[2025-01-09 16:25:44,359 INFO  L471      AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 238 flow
[2025-01-09 16:25:44,360 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 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:25:44,360 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-01-09 16:25:44,360 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-09 16:25:44,360 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-01-09 16:25:44,360 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-01-09 16:25:44,361 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 16:25:44,361 INFO  L85        PathProgramCache]: Analyzing trace with hash 1014682253, now seen corresponding path program 1 times
[2025-01-09 16:25:44,361 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 16:25:44,361 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038902466]
[2025-01-09 16:25:44,361 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 16:25:44,361 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 16:25:44,376 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-01-09 16:25:44,431 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-01-09 16:25:44,431 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 16:25:44,431 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 16:25:44,641 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:25:44,641 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 16:25:44,641 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038902466]
[2025-01-09 16:25:44,641 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038902466] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 16:25:44,641 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 16:25:44,641 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-01-09 16:25:44,641 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812512720]
[2025-01-09 16:25:44,641 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 16:25:44,641 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-01-09 16:25:44,642 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 16:25:44,642 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-01-09 16:25:44,642 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-01-09 16:25:44,649 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50
[2025-01-09 16:25:44,650 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 238 flow. Second operand  has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 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:25:44,650 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-01-09 16:25:44,650 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50
[2025-01-09 16:25:44,650 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-01-09 16:25:45,055 INFO  L124   PetriNetUnfolderBase]: 1527/2282 cut-off events.
[2025-01-09 16:25:45,056 INFO  L125   PetriNetUnfolderBase]: For 3368/3368 co-relation queries the response was YES.
[2025-01-09 16:25:45,062 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6769 conditions, 2282 events. 1527/2282 cut-off events. For 3368/3368 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 11292 event pairs, 47 based on Foata normal form. 80/2336 useless extension candidates. Maximal degree in co-relation 6754. Up to 768 conditions per place. 
[2025-01-09 16:25:45,077 INFO  L140   encePairwiseOnDemand]: 43/50 looper letters, 63 selfloop transitions, 18 changer transitions 1/100 dead transitions.
[2025-01-09 16:25:45,077 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 100 transitions, 508 flow
[2025-01-09 16:25:45,078 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-01-09 16:25:45,078 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2025-01-09 16:25:45,079 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 238 transitions.
[2025-01-09 16:25:45,079 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.68
[2025-01-09 16:25:45,079 INFO  L175             Difference]: Start difference. First operand has 64 places, 55 transitions, 238 flow. Second operand 7 states and 238 transitions.
[2025-01-09 16:25:45,079 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 100 transitions, 508 flow
[2025-01-09 16:25:45,093 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 100 transitions, 462 flow, removed 9 selfloop flow, removed 5 redundant places.
[2025-01-09 16:25:45,096 INFO  L231             Difference]: Finished difference. Result has 67 places, 55 transitions, 248 flow
[2025-01-09 16:25:45,096 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=248, PETRI_PLACES=67, PETRI_TRANSITIONS=55}
[2025-01-09 16:25:45,097 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places.
[2025-01-09 16:25:45,098 INFO  L471      AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 248 flow
[2025-01-09 16:25:45,098 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 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:25:45,098 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-01-09 16:25:45,098 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-09 16:25:45,098 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-01-09 16:25:45,099 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-01-09 16:25:45,099 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 16:25:45,100 INFO  L85        PathProgramCache]: Analyzing trace with hash -975842981, now seen corresponding path program 1 times
[2025-01-09 16:25:45,100 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 16:25:45,100 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551094889]
[2025-01-09 16:25:45,100 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 16:25:45,100 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 16:25:45,115 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes.
[2025-01-09 16:25:45,237 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements.
[2025-01-09 16:25:45,237 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 16:25:45,238 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 16:25:45,576 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:25:45,576 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 16:25:45,577 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551094889]
[2025-01-09 16:25:45,577 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551094889] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 16:25:45,577 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 16:25:45,577 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-01-09 16:25:45,577 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405600840]
[2025-01-09 16:25:45,577 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 16:25:45,578 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-01-09 16:25:45,578 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 16:25:45,579 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-01-09 16:25:45,579 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-01-09 16:25:45,590 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50
[2025-01-09 16:25:45,591 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 248 flow. Second operand  has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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:25:45,591 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-01-09 16:25:45,591 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50
[2025-01-09 16:25:45,591 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-01-09 16:25:46,044 INFO  L124   PetriNetUnfolderBase]: 1898/3246 cut-off events.
[2025-01-09 16:25:46,044 INFO  L125   PetriNetUnfolderBase]: For 1687/1796 co-relation queries the response was YES.
[2025-01-09 16:25:46,057 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7593 conditions, 3246 events. 1898/3246 cut-off events. For 1687/1796 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 21171 event pairs, 762 based on Foata normal form. 16/3010 useless extension candidates. Maximal degree in co-relation 7577. Up to 1334 conditions per place. 
[2025-01-09 16:25:46,066 INFO  L140   encePairwiseOnDemand]: 45/50 looper letters, 34 selfloop transitions, 2 changer transitions 14/81 dead transitions.
[2025-01-09 16:25:46,067 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 81 transitions, 414 flow
[2025-01-09 16:25:46,067 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-01-09 16:25:46,067 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2025-01-09 16:25:46,068 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions.
[2025-01-09 16:25:46,068 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.664
[2025-01-09 16:25:46,068 INFO  L175             Difference]: Start difference. First operand has 67 places, 55 transitions, 248 flow. Second operand 5 states and 166 transitions.
[2025-01-09 16:25:46,068 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 81 transitions, 414 flow
[2025-01-09 16:25:46,078 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 81 transitions, 308 flow, removed 22 selfloop flow, removed 10 redundant places.
[2025-01-09 16:25:46,079 INFO  L231             Difference]: Finished difference. Result has 64 places, 56 transitions, 168 flow
[2025-01-09 16:25:46,080 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=168, PETRI_PLACES=64, PETRI_TRANSITIONS=56}
[2025-01-09 16:25:46,081 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places.
[2025-01-09 16:25:46,082 INFO  L471      AbstractCegarLoop]: Abstraction has has 64 places, 56 transitions, 168 flow
[2025-01-09 16:25:46,082 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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:25:46,082 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-01-09 16:25:46,082 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-09 16:25:46,082 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-01-09 16:25:46,083 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-01-09 16:25:46,083 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 16:25:46,083 INFO  L85        PathProgramCache]: Analyzing trace with hash 654946745, now seen corresponding path program 2 times
[2025-01-09 16:25:46,083 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 16:25:46,083 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99523484]
[2025-01-09 16:25:46,084 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-01-09 16:25:46,084 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 16:25:46,099 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 1 equivalence classes.
[2025-01-09 16:25:46,223 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 38 statements.
[2025-01-09 16:25:46,223 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-01-09 16:25:46,223 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 16:25:46,519 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:25:46,519 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 16:25:46,519 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99523484]
[2025-01-09 16:25:46,519 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99523484] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 16:25:46,519 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 16:25:46,520 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-01-09 16:25:46,520 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503253841]
[2025-01-09 16:25:46,520 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 16:25:46,520 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-01-09 16:25:46,520 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 16:25:46,521 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-01-09 16:25:46,521 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-01-09 16:25:46,539 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50
[2025-01-09 16:25:46,539 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 56 transitions, 168 flow. Second operand  has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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:25:46,539 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-01-09 16:25:46,539 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50
[2025-01-09 16:25:46,539 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-01-09 16:25:47,175 INFO  L124   PetriNetUnfolderBase]: 3635/6222 cut-off events.
[2025-01-09 16:25:47,176 INFO  L125   PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES.
[2025-01-09 16:25:47,194 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12263 conditions, 6222 events. 3635/6222 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 45709 event pairs, 1677 based on Foata normal form. 16/5605 useless extension candidates. Maximal degree in co-relation 12250. Up to 2401 conditions per place. 
[2025-01-09 16:25:47,205 INFO  L140   encePairwiseOnDemand]: 45/50 looper letters, 37 selfloop transitions, 2 changer transitions 13/84 dead transitions.
[2025-01-09 16:25:47,205 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 84 transitions, 338 flow
[2025-01-09 16:25:47,205 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-01-09 16:25:47,206 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2025-01-09 16:25:47,206 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions.
[2025-01-09 16:25:47,207 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.672
[2025-01-09 16:25:47,207 INFO  L175             Difference]: Start difference. First operand has 64 places, 56 transitions, 168 flow. Second operand 5 states and 168 transitions.
[2025-01-09 16:25:47,207 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 84 transitions, 338 flow
[2025-01-09 16:25:47,208 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 84 transitions, 330 flow, removed 3 selfloop flow, removed 3 redundant places.
[2025-01-09 16:25:47,212 INFO  L231             Difference]: Finished difference. Result has 66 places, 57 transitions, 178 flow
[2025-01-09 16:25:47,212 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=59, 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=5, PETRI_FLOW=178, PETRI_PLACES=66, PETRI_TRANSITIONS=57}
[2025-01-09 16:25:47,212 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, 8 predicate places.
[2025-01-09 16:25:47,212 INFO  L471      AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 178 flow
[2025-01-09 16:25:47,213 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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:25:47,213 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-01-09 16:25:47,213 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-09 16:25:47,213 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-01-09 16:25:47,213 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-01-09 16:25:47,213 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 16:25:47,213 INFO  L85        PathProgramCache]: Analyzing trace with hash 1354928965, now seen corresponding path program 3 times
[2025-01-09 16:25:47,214 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 16:25:47,214 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161123892]
[2025-01-09 16:25:47,214 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-01-09 16:25:47,214 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 16:25:47,229 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 1 equivalence classes.
[2025-01-09 16:25:47,287 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 38 of 38 statements.
[2025-01-09 16:25:47,287 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2025-01-09 16:25:47,288 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 16:25:47,604 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:25:47,605 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 16:25:47,605 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161123892]
[2025-01-09 16:25:47,605 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161123892] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 16:25:47,605 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 16:25:47,605 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-01-09 16:25:47,605 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248676605]
[2025-01-09 16:25:47,605 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 16:25:47,606 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-01-09 16:25:47,610 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 16:25:47,610 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-01-09 16:25:47,610 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-01-09 16:25:47,626 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50
[2025-01-09 16:25:47,627 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 178 flow. Second operand  has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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:25:47,628 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-01-09 16:25:47,628 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50
[2025-01-09 16:25:47,628 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-01-09 16:25:48,433 INFO  L124   PetriNetUnfolderBase]: 5016/8728 cut-off events.
[2025-01-09 16:25:48,434 INFO  L125   PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES.
[2025-01-09 16:25:48,469 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17298 conditions, 8728 events. 5016/8728 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 623. Compared 67136 event pairs, 1603 based on Foata normal form. 16/7910 useless extension candidates. Maximal degree in co-relation 17284. Up to 3799 conditions per place. 
[2025-01-09 16:25:48,482 INFO  L140   encePairwiseOnDemand]: 45/50 looper letters, 29 selfloop transitions, 1 changer transitions 28/91 dead transitions.
[2025-01-09 16:25:48,482 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 91 transitions, 374 flow
[2025-01-09 16:25:48,483 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-01-09 16:25:48,483 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-01-09 16:25:48,484 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 197 transitions.
[2025-01-09 16:25:48,484 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.6566666666666666
[2025-01-09 16:25:48,484 INFO  L175             Difference]: Start difference. First operand has 66 places, 57 transitions, 178 flow. Second operand 6 states and 197 transitions.
[2025-01-09 16:25:48,484 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 91 transitions, 374 flow
[2025-01-09 16:25:48,486 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 91 transitions, 366 flow, removed 3 selfloop flow, removed 3 redundant places.
[2025-01-09 16:25:48,487 INFO  L231             Difference]: Finished difference. Result has 70 places, 57 transitions, 183 flow
[2025-01-09 16:25:48,487 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=183, PETRI_PLACES=70, PETRI_TRANSITIONS=57}
[2025-01-09 16:25:48,488 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, 12 predicate places.
[2025-01-09 16:25:48,488 INFO  L471      AbstractCegarLoop]: Abstraction has has 70 places, 57 transitions, 183 flow
[2025-01-09 16:25:48,489 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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:25:48,489 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-01-09 16:25:48,489 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-09 16:25:48,489 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-01-09 16:25:48,490 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-01-09 16:25:48,490 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 16:25:48,491 INFO  L85        PathProgramCache]: Analyzing trace with hash 1801880721, now seen corresponding path program 4 times
[2025-01-09 16:25:48,491 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 16:25:48,492 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920871061]
[2025-01-09 16:25:48,492 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-01-09 16:25:48,492 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 16:25:48,511 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes.
[2025-01-09 16:25:48,565 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements.
[2025-01-09 16:25:48,566 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s)
[2025-01-09 16:25:48,566 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 16:25:50,564 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:25:50,565 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 16:25:50,565 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920871061]
[2025-01-09 16:25:50,565 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920871061] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 16:25:50,565 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 16:25:50,565 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-01-09 16:25:50,565 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118888581]
[2025-01-09 16:25:50,565 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 16:25:50,566 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-01-09 16:25:50,566 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 16:25:50,566 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-01-09 16:25:50,566 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2025-01-09 16:25:50,586 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 24 out of 50
[2025-01-09 16:25:50,586 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 57 transitions, 183 flow. Second operand  has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 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:25:50,586 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-01-09 16:25:50,587 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 50
[2025-01-09 16:25:50,587 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-01-09 16:25:51,636 INFO  L124   PetriNetUnfolderBase]: 4722/8377 cut-off events.
[2025-01-09 16:25:51,637 INFO  L125   PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES.
[2025-01-09 16:25:51,688 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16656 conditions, 8377 events. 4722/8377 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 66035 event pairs, 896 based on Foata normal form. 16/7626 useless extension candidates. Maximal degree in co-relation 16640. Up to 1633 conditions per place. 
[2025-01-09 16:25:51,704 INFO  L140   encePairwiseOnDemand]: 40/50 looper letters, 43 selfloop transitions, 9 changer transitions 26/112 dead transitions.
[2025-01-09 16:25:51,705 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 112 transitions, 459 flow
[2025-01-09 16:25:51,705 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-01-09 16:25:51,705 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2025-01-09 16:25:51,706 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 367 transitions.
[2025-01-09 16:25:51,708 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.6116666666666667
[2025-01-09 16:25:51,708 INFO  L175             Difference]: Start difference. First operand has 70 places, 57 transitions, 183 flow. Second operand 12 states and 367 transitions.
[2025-01-09 16:25:51,709 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 112 transitions, 459 flow
[2025-01-09 16:25:51,711 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 112 transitions, 448 flow, removed 5 selfloop flow, removed 4 redundant places.
[2025-01-09 16:25:51,713 INFO  L231             Difference]: Finished difference. Result has 79 places, 62 transitions, 221 flow
[2025-01-09 16:25:51,714 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=221, PETRI_PLACES=79, PETRI_TRANSITIONS=62}
[2025-01-09 16:25:51,715 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, 21 predicate places.
[2025-01-09 16:25:51,715 INFO  L471      AbstractCegarLoop]: Abstraction has has 79 places, 62 transitions, 221 flow
[2025-01-09 16:25:51,715 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 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:25:51,715 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-01-09 16:25:51,715 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-09 16:25:51,716 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-01-09 16:25:51,716 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-01-09 16:25:51,716 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 16:25:51,716 INFO  L85        PathProgramCache]: Analyzing trace with hash 1736656271, now seen corresponding path program 5 times
[2025-01-09 16:25:51,716 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 16:25:51,717 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126507359]
[2025-01-09 16:25:51,717 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-01-09 16:25:51,717 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 16:25:51,730 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 1 equivalence classes.
[2025-01-09 16:25:51,790 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 38 statements.
[2025-01-09 16:25:51,790 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-01-09 16:25:51,790 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-09 16:25:51,791 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-01-09 16:25:51,797 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes.
[2025-01-09 16:25:51,836 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements.
[2025-01-09 16:25:51,837 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 16:25:51,837 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-01-09 16:25:51,868 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-01-09 16:25:51,869 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-01-09 16:25:51,870 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining)
[2025-01-09 16:25:51,872 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining)
[2025-01-09 16:25:51,873 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining)
[2025-01-09 16:25:51,873 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining)
[2025-01-09 16:25:51,873 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining)
[2025-01-09 16:25:51,873 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining)
[2025-01-09 16:25:51,873 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining)
[2025-01-09 16:25:51,873 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-01-09 16:25:51,874 INFO  L422         BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1]
[2025-01-09 16:25:51,969 INFO  L241   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2025-01-09 16:25:51,970 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-01-09 16:25:51,979 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:25:51 BasicIcfg
[2025-01-09 16:25:51,979 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-01-09 16:25:51,980 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-01-09 16:25:51,980 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-01-09 16:25:51,980 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-01-09 16:25:51,981 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:25:39" (3/4) ...
[2025-01-09 16:25:51,981 INFO  L140         WitnessPrinter]: Generating witness for reachability counterexample
[2025-01-09 16:25:52,103 INFO  L127   tionWitnessGenerator]: Generated YAML witness of length 9.
[2025-01-09 16:25:52,147 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-01-09 16:25:52,148 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-01-09 16:25:52,148 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-01-09 16:25:52,150 INFO  L158              Benchmark]: Toolchain (without parser) took 13670.86ms. Allocated memory was 142.6MB in the beginning and 696.3MB in the end (delta: 553.6MB). Free memory was 104.0MB in the beginning and 260.9MB in the end (delta: -156.9MB). Peak memory consumption was 394.6MB. Max. memory is 16.1GB.
[2025-01-09 16:25:52,150 INFO  L158              Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-01-09 16:25:52,150 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 491.68ms. Allocated memory is still 142.6MB. Free memory was 103.0MB in the beginning and 78.7MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2025-01-09 16:25:52,151 INFO  L158              Benchmark]: Boogie Procedure Inliner took 39.10ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 76.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-01-09 16:25:52,152 INFO  L158              Benchmark]: Boogie Preprocessor took 43.48ms. Allocated memory is still 142.6MB. Free memory was 76.7MB in the beginning and 73.6MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-01-09 16:25:52,152 INFO  L158              Benchmark]: RCFGBuilder took 781.17ms. Allocated memory is still 142.6MB. Free memory was 73.6MB in the beginning and 85.9MB in the end (delta: -12.3MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB.
[2025-01-09 16:25:52,152 INFO  L158              Benchmark]: TraceAbstraction took 12140.93ms. Allocated memory was 142.6MB in the beginning and 696.3MB in the end (delta: 553.6MB). Free memory was 85.1MB in the beginning and 281.9MB in the end (delta: -196.8MB). Peak memory consumption was 355.0MB. Max. memory is 16.1GB.
[2025-01-09 16:25:52,153 INFO  L158              Benchmark]: Witness Printer took 168.23ms. Allocated memory is still 696.3MB. Free memory was 281.9MB in the beginning and 260.9MB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-01-09 16:25:52,154 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.27ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 491.68ms. Allocated memory is still 142.6MB. Free memory was 103.0MB in the beginning and 78.7MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 39.10ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 76.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 43.48ms. Allocated memory is still 142.6MB. Free memory was 76.7MB in the beginning and 73.6MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * RCFGBuilder took 781.17ms. Allocated memory is still 142.6MB. Free memory was 73.6MB in the beginning and 85.9MB in the end (delta: -12.3MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB.
 * TraceAbstraction took 12140.93ms. Allocated memory was 142.6MB in the beginning and 696.3MB in the end (delta: 553.6MB). Free memory was 85.1MB in the beginning and 281.9MB in the end (delta: -196.8MB). Peak memory consumption was 355.0MB. Max. memory is 16.1GB.
 * Witness Printer took 168.23ms. Allocated memory is still 696.3MB. Free memory was 281.9MB in the beginning and 260.9MB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - CounterExampleResult [Line: 18]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L710]               0  int __unbuffered_cnt = 0;
[L712]               0  int __unbuffered_p2_EAX = 0;
[L714]               0  int __unbuffered_p2_EBX = 0;
[L716]               0  int __unbuffered_p3_EAX = 0;
[L718]               0  int __unbuffered_p3_EBX = 0;
[L720]               0  int a = 0;
[L721]               0  _Bool main$tmp_guard0;
[L722]               0  _Bool main$tmp_guard1;
[L724]               0  int x = 0;
[L726]               0  int y = 0;
[L728]               0  int z = 0;
[L729]               0  _Bool z$flush_delayed;
[L730]               0  int z$mem_tmp;
[L731]               0  _Bool z$r_buff0_thd0;
[L732]               0  _Bool z$r_buff0_thd1;
[L733]               0  _Bool z$r_buff0_thd2;
[L734]               0  _Bool z$r_buff0_thd3;
[L735]               0  _Bool z$r_buff0_thd4;
[L736]               0  _Bool z$r_buff1_thd0;
[L737]               0  _Bool z$r_buff1_thd1;
[L738]               0  _Bool z$r_buff1_thd2;
[L739]               0  _Bool z$r_buff1_thd3;
[L740]               0  _Bool z$r_buff1_thd4;
[L741]               0  _Bool z$read_delayed;
[L742]               0  int *z$read_delayed_var;
[L743]               0  int z$w_buff0;
[L744]               0  _Bool z$w_buff0_used;
[L745]               0  int z$w_buff1;
[L746]               0  _Bool z$w_buff1_used;
[L747]               0  _Bool weak$$choice0;
[L748]               0  _Bool weak$$choice2;
[L867]               0  pthread_t t213;
[L868]  FCALL, FORK  0  pthread_create(&t213, ((void *)0), P0, ((void *)0))
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t213=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L869]               0  pthread_t t214;
[L870]  FCALL, FORK  0  pthread_create(&t214, ((void *)0), P1, ((void *)0))
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t213=-1, t214=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L871]               0  pthread_t t215;
[L872]  FCALL, FORK  0  pthread_create(&t215, ((void *)0), P2, ((void *)0))
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t213=-1, t214=0, t215=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L873]               0  pthread_t t216;
[L874]  FCALL, FORK  0  pthread_create(&t216, ((void *)0), P3, ((void *)0))
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t213=-1, t214=0, t215=1, t216=2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L813]               4  z$w_buff1 = z$w_buff0
[L814]               4  z$w_buff0 = 1
[L815]               4  z$w_buff1_used = z$w_buff0_used
[L816]               4  z$w_buff0_used = (_Bool)1
[L817]  CALL         4  __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L18]   COND FALSE   4  !(!expression)
[L817]  RET          4  __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L818]               4  z$r_buff1_thd0 = z$r_buff0_thd0
[L819]               4  z$r_buff1_thd1 = z$r_buff0_thd1
[L820]               4  z$r_buff1_thd2 = z$r_buff0_thd2
[L821]               4  z$r_buff1_thd3 = z$r_buff0_thd3
[L822]               4  z$r_buff1_thd4 = z$r_buff0_thd4
[L823]               4  z$r_buff0_thd4 = (_Bool)1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L826]               4  weak$$choice0 = __VERIFIER_nondet_bool()
[L827]               4  weak$$choice2 = __VERIFIER_nondet_bool()
[L828]               4  z$flush_delayed = weak$$choice2
[L829]               4  z$mem_tmp = z
[L830]               4  z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1)
[L831]               4  z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0))
[L832]               4  z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1))
[L833]               4  z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used))
[L834]               4  z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L835]               4  z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4))
[L836]               4  z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L837]               4  __unbuffered_p3_EAX = z
[L838]               4  z = z$flush_delayed ? z$mem_tmp : z
[L839]               4  z$flush_delayed = (_Bool)0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L842]               4  __unbuffered_p3_EBX = a
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L752]               1  a = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L755]               1  x = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L767]               2  x = 2
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L770]               2  y = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L782]               3  y = 2
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L785]               3  __unbuffered_p2_EAX = y
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L788]               3  weak$$choice0 = __VERIFIER_nondet_bool()
[L789]               3  weak$$choice2 = __VERIFIER_nondet_bool()
[L790]               3  z$flush_delayed = weak$$choice2
[L791]               3  z$mem_tmp = z
[L792]               3  z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)
[L793]               3  z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L794]               3  z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L795]               3  z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L796]               3  z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L797]               3  z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))
[L798]               3  z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L799]               3  __unbuffered_p2_EBX = z
[L800]               3  z = z$flush_delayed ? z$mem_tmp : z
[L801]               3  z$flush_delayed = (_Bool)0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L845]               4  z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L846]               4  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L847]               4  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used
[L848]               4  z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L849]               4  z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L760]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L775]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L806]               3  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L852]               4  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L876]               0  main$tmp_guard0 = __unbuffered_cnt == 4
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t213=-1, t214=0, t215=1, t216=2, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L878]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L3]    COND FALSE   0  !(!cond)
[L878]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L880]               0  z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L881]               0  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L882]               0  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L883]               0  z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L884]               0  z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t213=-1, t214=0, t215=1, t216=2, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L887]               0  main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0)
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t213=-1, t214=0, t215=1, t216=2, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L889]  CALL         0  __VERIFIER_assert(main$tmp_guard1)
[L18]   COND TRUE    0  !expression
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L18]                0  reach_error()
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]

  - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable
    Unable to prove that a call to reach_error is unreachable
 Reason: Not analyzed. 
  - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 868]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 9 procedures, 85 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 597 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 582 mSDsluCounter, 93 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 88 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1138 IncrementalHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 5 mSDtfsCounter, 1138 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=248occurred in iteration=5, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 295 NumberOfCodeBlocks, 295 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 248 ConstructedInterpolants, 0 QuantifiedInterpolants, 1321 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:25:52,178 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