./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi004.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version b8dbc81d
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi004.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 131a5c0bb00c7f6e11a814871ba4a0d65133507ca6f79e4b87c2742dbe2c5590 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE
--- Real Ultimate output ---
This is Ultimate 0.2.3-?-b8dbc81
[2023-09-01 09:53:30,191 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-09-01 09:53:30,194 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-09-01 09:53:30,239 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-09-01 09:53:30,241 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-09-01 09:53:30,244 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-09-01 09:53:30,246 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-09-01 09:53:30,249 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-09-01 09:53:30,251 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-09-01 09:53:30,256 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-09-01 09:53:30,257 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-09-01 09:53:30,259 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-09-01 09:53:30,259 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-09-01 09:53:30,261 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-09-01 09:53:30,264 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-09-01 09:53:30,269 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-09-01 09:53:30,271 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-09-01 09:53:30,272 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-09-01 09:53:30,274 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-09-01 09:53:30,279 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-09-01 09:53:30,281 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-09-01 09:53:30,282 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-09-01 09:53:30,283 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-09-01 09:53:30,283 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-09-01 09:53:30,290 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-09-01 09:53:30,290 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-09-01 09:53:30,290 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-09-01 09:53:30,292 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-09-01 09:53:30,293 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-09-01 09:53:30,294 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-09-01 09:53:30,294 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-09-01 09:53:30,300 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-09-01 09:53:30,302 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-09-01 09:53:30,303 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-09-01 09:53:30,303 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-09-01 09:53:30,304 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-09-01 09:53:30,304 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-09-01 09:53:30,304 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-09-01 09:53:30,305 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-09-01 09:53:30,305 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-09-01 09:53:30,306 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-09-01 09:53:30,308 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2023-09-01 09:53:30,340 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-09-01 09:53:30,341 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-09-01 09:53:30,342 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-09-01 09:53:30,342 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-09-01 09:53:30,343 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-09-01 09:53:30,343 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-09-01 09:53:30,344 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-09-01 09:53:30,344 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-09-01 09:53:30,344 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-09-01 09:53:30,345 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-09-01 09:53:30,345 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-09-01 09:53:30,346 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-09-01 09:53:30,346 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-09-01 09:53:30,346 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-09-01 09:53:30,346 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-09-01 09:53:30,347 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-09-01 09:53:30,347 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-09-01 09:53:30,347 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-09-01 09:53:30,347 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-09-01 09:53:30,347 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-09-01 09:53:30,348 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-09-01 09:53:30,348 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-09-01 09:53:30,348 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-09-01 09:53:30,348 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-09-01 09:53:30,349 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-09-01 09:53:30,349 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-09-01 09:53:30,349 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-09-01 09:53:30,349 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-09-01 09:53:30,350 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-09-01 09:53:30,350 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-09-01 09:53:30,350 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-09-01 09:53:30,350 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-09-01 09:53:30,351 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-09-01 09:53:30,351 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-09-01 09:53:30,351 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-09-01 09:53:30,351 INFO  L138        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
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 -> 131a5c0bb00c7f6e11a814871ba4a0d65133507ca6f79e4b87c2742dbe2c5590
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE
[2023-09-01 09:53:30,678 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-09-01 09:53:30,694 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-09-01 09:53:30,697 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-09-01 09:53:30,698 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-09-01 09:53:30,698 INFO  L275        PluginConnector]: CDTParser initialized
[2023-09-01 09:53:30,701 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi004.i
[2023-09-01 09:53:31,815 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-09-01 09:53:32,072 INFO  L351              CDTParser]: Found 1 translation units.
[2023-09-01 09:53:32,073 INFO  L172              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi004.i
[2023-09-01 09:53:32,087 INFO  L394              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa0bf77d8/1eeb858f9325403da527fbcdda451d83/FLAG112bd14a1
[2023-09-01 09:53:32,102 INFO  L402              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa0bf77d8/1eeb858f9325403da527fbcdda451d83
[2023-09-01 09:53:32,104 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-09-01 09:53:32,105 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-09-01 09:53:32,106 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-09-01 09:53:32,106 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-09-01 09:53:32,110 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-09-01 09:53:32,110 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:53:32" (1/1) ...
[2023-09-01 09:53:32,111 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a7115b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:32, skipping insertion in model container
[2023-09-01 09:53:32,111 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:53:32" (1/1) ...
[2023-09-01 09:53:32,117 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-09-01 09:53:32,152 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-09-01 09:53:32,337 WARN  L247   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi004.i[983,996]
[2023-09-01 09:53:32,563 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-09-01 09:53:32,575 INFO  L203         MainTranslator]: Completed pre-run
[2023-09-01 09:53:32,595 WARN  L247   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi004.i[983,996]
[2023-09-01 09:53:32,652 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-09-01 09:53:32,690 WARN  L667               CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler.
[2023-09-01 09:53:32,691 WARN  L667               CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler.
[2023-09-01 09:53:32,697 INFO  L208         MainTranslator]: Completed translation
[2023-09-01 09:53:32,697 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:32 WrapperNode
[2023-09-01 09:53:32,697 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-09-01 09:53:32,699 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-09-01 09:53:32,699 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-09-01 09:53:32,699 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-09-01 09:53:32,705 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:32" (1/1) ...
[2023-09-01 09:53:32,725 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:32" (1/1) ...
[2023-09-01 09:53:32,745 INFO  L138                Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 121
[2023-09-01 09:53:32,745 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-09-01 09:53:32,746 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-09-01 09:53:32,746 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-09-01 09:53:32,746 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-09-01 09:53:32,754 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:32" (1/1) ...
[2023-09-01 09:53:32,754 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:32" (1/1) ...
[2023-09-01 09:53:32,772 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:32" (1/1) ...
[2023-09-01 09:53:32,773 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:32" (1/1) ...
[2023-09-01 09:53:32,780 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:32" (1/1) ...
[2023-09-01 09:53:32,795 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:32" (1/1) ...
[2023-09-01 09:53:32,796 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:32" (1/1) ...
[2023-09-01 09:53:32,798 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:32" (1/1) ...
[2023-09-01 09:53:32,809 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-09-01 09:53:32,810 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-09-01 09:53:32,810 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-09-01 09:53:32,811 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-09-01 09:53:32,811 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:32" (1/1) ...
[2023-09-01 09:53:32,822 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-09-01 09:53:32,833 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-09-01 09:53:32,851 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-09-01 09:53:32,873 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-09-01 09:53:32,890 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-09-01 09:53:32,891 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2023-09-01 09:53:32,891 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-09-01 09:53:32,892 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-09-01 09:53:32,892 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-09-01 09:53:32,892 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2023-09-01 09:53:32,892 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2023-09-01 09:53:32,893 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2023-09-01 09:53:32,893 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2023-09-01 09:53:32,893 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-09-01 09:53:32,893 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2023-09-01 09:53:32,893 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-09-01 09:53:32,893 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-09-01 09:53:32,895 WARN  L210             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2023-09-01 09:53:33,011 INFO  L236             CfgBuilder]: Building ICFG
[2023-09-01 09:53:33,013 INFO  L262             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-09-01 09:53:33,313 INFO  L277             CfgBuilder]: Performing block encoding
[2023-09-01 09:53:33,460 INFO  L297             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-09-01 09:53:33,460 INFO  L302             CfgBuilder]: Removed 0 assume(true) statements.
[2023-09-01 09:53:33,462 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:53:33 BoogieIcfgContainer
[2023-09-01 09:53:33,463 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-09-01 09:53:33,464 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-09-01 09:53:33,464 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-09-01 09:53:33,467 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-09-01 09:53:33,467 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 09:53:32" (1/3) ...
[2023-09-01 09:53:33,468 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c7cf906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:53:33, skipping insertion in model container
[2023-09-01 09:53:33,468 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:32" (2/3) ...
[2023-09-01 09:53:33,469 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c7cf906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:53:33, skipping insertion in model container
[2023-09-01 09:53:33,469 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:53:33" (3/3) ...
[2023-09-01 09:53:33,470 INFO  L112   eAbstractionObserver]: Analyzing ICFG rfi004.i
[2023-09-01 09:53:33,477 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-09-01 09:53:33,486 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-09-01 09:53:33,486 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2023-09-01 09:53:33,486 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-09-01 09:53:33,557 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-09-01 09:53:33,602 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 96 places, 91 transitions, 192 flow
[2023-09-01 09:53:33,649 INFO  L130       PetriNetUnfolder]: 2/89 cut-off events.
[2023-09-01 09:53:33,649 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-09-01 09:53:33,653 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. 
[2023-09-01 09:53:33,654 INFO  L82        GeneralOperation]: Start removeDead. Operand has 96 places, 91 transitions, 192 flow
[2023-09-01 09:53:33,657 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 94 places, 89 transitions, 184 flow
[2023-09-01 09:53:33,661 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-09-01 09:53:33,669 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 89 transitions, 184 flow
[2023-09-01 09:53:33,674 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 89 transitions, 184 flow
[2023-09-01 09:53:33,674 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 184 flow
[2023-09-01 09:53:33,704 INFO  L130       PetriNetUnfolder]: 2/89 cut-off events.
[2023-09-01 09:53:33,704 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-09-01 09:53:33,705 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. 
[2023-09-01 09:53:33,706 INFO  L119        LiptonReduction]: Number of co-enabled transitions 1068
[2023-09-01 09:53:36,542 INFO  L134        LiptonReduction]: Checked pairs total: 2425
[2023-09-01 09:53:36,542 INFO  L136        LiptonReduction]: Total number of compositions: 83
[2023-09-01 09:53:36,554 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-09-01 09:53:36,559 INFO  L357      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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@3c87b2f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-09-01 09:53:36,559 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2023-09-01 09:53:36,563 INFO  L130       PetriNetUnfolder]: 0/8 cut-off events.
[2023-09-01 09:53:36,564 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-09-01 09:53:36,564 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-09-01 09:53:36,564 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2023-09-01 09:53:36,565 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-09-01 09:53:36,569 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-09-01 09:53:36,569 INFO  L85        PathProgramCache]: Analyzing trace with hash 385890353, now seen corresponding path program 1 times
[2023-09-01 09:53:36,578 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-09-01 09:53:36,578 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265871178]
[2023-09-01 09:53:36,578 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-09-01 09:53:36,579 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-09-01 09:53:36,684 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-09-01 09:53:36,923 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-09-01 09:53:36,923 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-09-01 09:53:36,924 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265871178]
[2023-09-01 09:53:36,924 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265871178] provided 1 perfect and 0 imperfect interpolant sequences
[2023-09-01 09:53:36,924 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-09-01 09:53:36,925 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-09-01 09:53:36,926 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041581453]
[2023-09-01 09:53:36,926 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-09-01 09:53:36,933 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-09-01 09:53:36,938 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-09-01 09:53:36,963 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-09-01 09:53:36,964 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-09-01 09:53:36,971 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 80 out of 174
[2023-09-01 09:53:36,973 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 42 flow. Second operand  has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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)
[2023-09-01 09:53:36,974 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-09-01 09:53:36,974 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 174
[2023-09-01 09:53:36,975 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-09-01 09:53:37,094 INFO  L130       PetriNetUnfolder]: 142/271 cut-off events.
[2023-09-01 09:53:37,094 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2023-09-01 09:53:37,096 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 536 conditions, 271 events. 142/271 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1009 event pairs, 18 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 526. Up to 205 conditions per place. 
[2023-09-01 09:53:37,098 INFO  L137   encePairwiseOnDemand]: 170/174 looper letters, 18 selfloop transitions, 2 changer transitions 2/23 dead transitions.
[2023-09-01 09:53:37,098 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 23 transitions, 96 flow
[2023-09-01 09:53:37,100 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-09-01 09:53:37,102 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-09-01 09:53:37,113 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions.
[2023-09-01 09:53:37,117 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5076628352490421
[2023-09-01 09:53:37,118 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 265 transitions.
[2023-09-01 09:53:37,118 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 265 transitions.
[2023-09-01 09:53:37,121 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-09-01 09:53:37,123 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 265 transitions.
[2023-09-01 09:53:37,127 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 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)
[2023-09-01 09:53:37,131 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 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)
[2023-09-01 09:53:37,132 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 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)
[2023-09-01 09:53:37,133 INFO  L175             Difference]: Start difference. First operand has 24 places, 18 transitions, 42 flow. Second operand 3 states and 265 transitions.
[2023-09-01 09:53:37,134 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 23 transitions, 96 flow
[2023-09-01 09:53:37,136 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 23 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-09-01 09:53:37,137 INFO  L231             Difference]: Finished difference. Result has 23 places, 15 transitions, 38 flow
[2023-09-01 09:53:37,139 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=23, PETRI_TRANSITIONS=15}
[2023-09-01 09:53:37,142 INFO  L281   CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places.
[2023-09-01 09:53:37,143 INFO  L495      AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 38 flow
[2023-09-01 09:53:37,143 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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)
[2023-09-01 09:53:37,143 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-09-01 09:53:37,144 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-09-01 09:53:37,145 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-09-01 09:53:37,146 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-09-01 09:53:37,149 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-09-01 09:53:37,150 INFO  L85        PathProgramCache]: Analyzing trace with hash 1473505354, now seen corresponding path program 1 times
[2023-09-01 09:53:37,150 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-09-01 09:53:37,150 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076338137]
[2023-09-01 09:53:37,151 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-09-01 09:53:37,151 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-09-01 09:53:37,225 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-09-01 09:53:37,399 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-09-01 09:53:37,399 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-09-01 09:53:37,399 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076338137]
[2023-09-01 09:53:37,404 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076338137] provided 1 perfect and 0 imperfect interpolant sequences
[2023-09-01 09:53:37,404 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-09-01 09:53:37,404 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-09-01 09:53:37,404 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179735276]
[2023-09-01 09:53:37,404 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-09-01 09:53:37,405 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-09-01 09:53:37,406 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-09-01 09:53:37,407 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-09-01 09:53:37,407 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-09-01 09:53:37,414 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 79 out of 174
[2023-09-01 09:53:37,414 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 38 flow. Second operand  has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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)
[2023-09-01 09:53:37,415 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-09-01 09:53:37,415 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 174
[2023-09-01 09:53:37,415 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-09-01 09:53:37,491 INFO  L130       PetriNetUnfolder]: 97/190 cut-off events.
[2023-09-01 09:53:37,491 INFO  L131       PetriNetUnfolder]: For 9/9 co-relation queries the response was YES.
[2023-09-01 09:53:37,492 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 394 conditions, 190 events. 97/190 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 613 event pairs, 37 based on Foata normal form. 8/198 useless extension candidates. Maximal degree in co-relation 384. Up to 117 conditions per place. 
[2023-09-01 09:53:37,493 INFO  L137   encePairwiseOnDemand]: 171/174 looper letters, 17 selfloop transitions, 2 changer transitions 0/20 dead transitions.
[2023-09-01 09:53:37,493 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 20 transitions, 86 flow
[2023-09-01 09:53:37,494 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-09-01 09:53:37,494 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-09-01 09:53:37,495 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions.
[2023-09-01 09:53:37,495 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49233716475095785
[2023-09-01 09:53:37,495 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 257 transitions.
[2023-09-01 09:53:37,495 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 257 transitions.
[2023-09-01 09:53:37,496 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-09-01 09:53:37,496 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 257 transitions.
[2023-09-01 09:53:37,496 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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)
[2023-09-01 09:53:37,498 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 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)
[2023-09-01 09:53:37,498 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 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)
[2023-09-01 09:53:37,498 INFO  L175             Difference]: Start difference. First operand has 23 places, 15 transitions, 38 flow. Second operand 3 states and 257 transitions.
[2023-09-01 09:53:37,499 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 20 transitions, 86 flow
[2023-09-01 09:53:37,499 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 20 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-09-01 09:53:37,500 INFO  L231             Difference]: Finished difference. Result has 23 places, 15 transitions, 42 flow
[2023-09-01 09:53:37,500 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=23, PETRI_TRANSITIONS=15}
[2023-09-01 09:53:37,501 INFO  L281   CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places.
[2023-09-01 09:53:37,501 INFO  L495      AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 42 flow
[2023-09-01 09:53:37,501 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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)
[2023-09-01 09:53:37,501 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-09-01 09:53:37,502 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-09-01 09:53:37,502 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-09-01 09:53:37,502 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-09-01 09:53:37,503 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-09-01 09:53:37,503 INFO  L85        PathProgramCache]: Analyzing trace with hash -1349620641, now seen corresponding path program 1 times
[2023-09-01 09:53:37,503 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-09-01 09:53:37,503 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684227367]
[2023-09-01 09:53:37,503 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-09-01 09:53:37,504 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-09-01 09:53:37,534 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-09-01 09:53:37,706 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-09-01 09:53:37,706 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-09-01 09:53:37,707 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684227367]
[2023-09-01 09:53:37,707 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684227367] provided 1 perfect and 0 imperfect interpolant sequences
[2023-09-01 09:53:37,707 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-09-01 09:53:37,707 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-09-01 09:53:37,707 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457834565]
[2023-09-01 09:53:37,708 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-09-01 09:53:37,708 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-09-01 09:53:37,708 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-09-01 09:53:37,709 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-09-01 09:53:37,710 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-09-01 09:53:37,721 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 74 out of 174
[2023-09-01 09:53:37,722 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 42 flow. Second operand  has 4 states, 4 states have (on average 76.25) internal successors, (305), 4 states have internal predecessors, (305), 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)
[2023-09-01 09:53:37,722 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-09-01 09:53:37,722 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 174
[2023-09-01 09:53:37,722 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-09-01 09:53:37,825 INFO  L130       PetriNetUnfolder]: 60/134 cut-off events.
[2023-09-01 09:53:37,826 INFO  L131       PetriNetUnfolder]: For 8/8 co-relation queries the response was YES.
[2023-09-01 09:53:37,827 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 306 conditions, 134 events. 60/134 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 420 event pairs, 13 based on Foata normal form. 20/154 useless extension candidates. Maximal degree in co-relation 295. Up to 60 conditions per place. 
[2023-09-01 09:53:37,828 INFO  L137   encePairwiseOnDemand]: 169/174 looper letters, 20 selfloop transitions, 3 changer transitions 15/39 dead transitions.
[2023-09-01 09:53:37,829 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 39 transitions, 177 flow
[2023-09-01 09:53:37,829 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2023-09-01 09:53:37,829 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-09-01 09:53:37,830 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 410 transitions.
[2023-09-01 09:53:37,831 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47126436781609193
[2023-09-01 09:53:37,831 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 410 transitions.
[2023-09-01 09:53:37,831 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 410 transitions.
[2023-09-01 09:53:37,831 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-09-01 09:53:37,832 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 410 transitions.
[2023-09-01 09:53:37,833 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 6 states, 5 states have (on average 82.0) internal successors, (410), 5 states have internal predecessors, (410), 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)
[2023-09-01 09:53:37,835 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 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)
[2023-09-01 09:53:37,836 INFO  L81            ComplementDD]: Finished complementDD. Result  has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 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)
[2023-09-01 09:53:37,836 INFO  L175             Difference]: Start difference. First operand has 23 places, 15 transitions, 42 flow. Second operand 5 states and 410 transitions.
[2023-09-01 09:53:37,836 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 39 transitions, 177 flow
[2023-09-01 09:53:37,837 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 39 transitions, 167 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-09-01 09:53:37,838 INFO  L231             Difference]: Finished difference. Result has 28 places, 17 transitions, 65 flow
[2023-09-01 09:53:37,838 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=65, PETRI_PLACES=28, PETRI_TRANSITIONS=17}
[2023-09-01 09:53:37,839 INFO  L281   CegarLoopForPetriNet]: 24 programPoint places, 4 predicate places.
[2023-09-01 09:53:37,842 INFO  L495      AbstractCegarLoop]: Abstraction has has 28 places, 17 transitions, 65 flow
[2023-09-01 09:53:37,843 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 76.25) internal successors, (305), 4 states have internal predecessors, (305), 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)
[2023-09-01 09:53:37,843 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-09-01 09:53:37,843 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-09-01 09:53:37,843 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-09-01 09:53:37,844 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-09-01 09:53:37,844 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-09-01 09:53:37,844 INFO  L85        PathProgramCache]: Analyzing trace with hash -245840460, now seen corresponding path program 1 times
[2023-09-01 09:53:37,845 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-09-01 09:53:37,845 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212897809]
[2023-09-01 09:53:37,845 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-09-01 09:53:37,845 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-09-01 09:53:37,904 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-09-01 09:53:38,249 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-09-01 09:53:38,249 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-09-01 09:53:38,250 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212897809]
[2023-09-01 09:53:38,250 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212897809] provided 1 perfect and 0 imperfect interpolant sequences
[2023-09-01 09:53:38,250 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-09-01 09:53:38,250 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-09-01 09:53:38,251 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57879604]
[2023-09-01 09:53:38,251 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-09-01 09:53:38,253 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-09-01 09:53:38,253 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-09-01 09:53:38,254 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-09-01 09:53:38,254 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-09-01 09:53:38,267 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 74 out of 174
[2023-09-01 09:53:38,267 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 17 transitions, 65 flow. Second operand  has 5 states, 5 states have (on average 76.4) internal successors, (382), 5 states have internal predecessors, (382), 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)
[2023-09-01 09:53:38,268 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-09-01 09:53:38,268 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 174
[2023-09-01 09:53:38,271 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-09-01 09:53:38,350 INFO  L130       PetriNetUnfolder]: 24/67 cut-off events.
[2023-09-01 09:53:38,351 INFO  L131       PetriNetUnfolder]: For 17/17 co-relation queries the response was YES.
[2023-09-01 09:53:38,352 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 191 conditions, 67 events. 24/67 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 148 event pairs, 10 based on Foata normal form. 8/75 useless extension candidates. Maximal degree in co-relation 177. Up to 29 conditions per place. 
[2023-09-01 09:53:38,353 INFO  L137   encePairwiseOnDemand]: 169/174 looper letters, 18 selfloop transitions, 5 changer transitions 8/32 dead transitions.
[2023-09-01 09:53:38,353 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 32 transitions, 171 flow
[2023-09-01 09:53:38,354 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-09-01 09:53:38,354 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-09-01 09:53:38,355 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 477 transitions.
[2023-09-01 09:53:38,356 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45689655172413796
[2023-09-01 09:53:38,358 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 477 transitions.
[2023-09-01 09:53:38,358 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 477 transitions.
[2023-09-01 09:53:38,359 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-09-01 09:53:38,359 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 477 transitions.
[2023-09-01 09:53:38,360 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 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)
[2023-09-01 09:53:38,361 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 174.0) internal successors, (1218), 7 states have internal predecessors, (1218), 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)
[2023-09-01 09:53:38,362 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 174.0) internal successors, (1218), 7 states have internal predecessors, (1218), 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)
[2023-09-01 09:53:38,362 INFO  L175             Difference]: Start difference. First operand has 28 places, 17 transitions, 65 flow. Second operand 6 states and 477 transitions.
[2023-09-01 09:53:38,362 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 32 transitions, 171 flow
[2023-09-01 09:53:38,365 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 32 transitions, 152 flow, removed 6 selfloop flow, removed 3 redundant places.
[2023-09-01 09:53:38,366 INFO  L231             Difference]: Finished difference. Result has 31 places, 17 transitions, 72 flow
[2023-09-01 09:53:38,366 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=72, PETRI_PLACES=31, PETRI_TRANSITIONS=17}
[2023-09-01 09:53:38,368 INFO  L281   CegarLoopForPetriNet]: 24 programPoint places, 7 predicate places.
[2023-09-01 09:53:38,368 INFO  L495      AbstractCegarLoop]: Abstraction has has 31 places, 17 transitions, 72 flow
[2023-09-01 09:53:38,368 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 76.4) internal successors, (382), 5 states have internal predecessors, (382), 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)
[2023-09-01 09:53:38,369 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-09-01 09:53:38,369 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-09-01 09:53:38,369 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-09-01 09:53:38,369 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-09-01 09:53:38,370 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-09-01 09:53:38,370 INFO  L85        PathProgramCache]: Analyzing trace with hash 587847154, now seen corresponding path program 1 times
[2023-09-01 09:53:38,370 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-09-01 09:53:38,370 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432557999]
[2023-09-01 09:53:38,370 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-09-01 09:53:38,371 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-09-01 09:53:38,411 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-09-01 09:53:38,635 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-09-01 09:53:38,636 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-09-01 09:53:38,636 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432557999]
[2023-09-01 09:53:38,636 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432557999] provided 1 perfect and 0 imperfect interpolant sequences
[2023-09-01 09:53:38,636 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-09-01 09:53:38,636 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-09-01 09:53:38,637 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361539721]
[2023-09-01 09:53:38,637 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-09-01 09:53:38,637 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-09-01 09:53:38,637 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-09-01 09:53:38,638 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-09-01 09:53:38,638 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-09-01 09:53:38,647 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 74 out of 174
[2023-09-01 09:53:38,648 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 17 transitions, 72 flow. Second operand  has 4 states, 4 states have (on average 77.75) internal successors, (311), 4 states have internal predecessors, (311), 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)
[2023-09-01 09:53:38,648 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-09-01 09:53:38,648 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 174
[2023-09-01 09:53:38,648 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-09-01 09:53:38,718 INFO  L130       PetriNetUnfolder]: 24/71 cut-off events.
[2023-09-01 09:53:38,718 INFO  L131       PetriNetUnfolder]: For 65/65 co-relation queries the response was YES.
[2023-09-01 09:53:38,718 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 212 conditions, 71 events. 24/71 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 182 event pairs, 1 based on Foata normal form. 1/72 useless extension candidates. Maximal degree in co-relation 196. Up to 41 conditions per place. 
[2023-09-01 09:53:38,719 INFO  L137   encePairwiseOnDemand]: 168/174 looper letters, 21 selfloop transitions, 7 changer transitions 9/37 dead transitions.
[2023-09-01 09:53:38,719 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 37 transitions, 225 flow
[2023-09-01 09:53:38,719 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2023-09-01 09:53:38,720 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-09-01 09:53:38,721 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 404 transitions.
[2023-09-01 09:53:38,721 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46436781609195404
[2023-09-01 09:53:38,721 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 404 transitions.
[2023-09-01 09:53:38,721 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 404 transitions.
[2023-09-01 09:53:38,721 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-09-01 09:53:38,722 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 404 transitions.
[2023-09-01 09:53:38,723 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 6 states, 5 states have (on average 80.8) internal successors, (404), 5 states have internal predecessors, (404), 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)
[2023-09-01 09:53:38,725 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 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)
[2023-09-01 09:53:38,725 INFO  L81            ComplementDD]: Finished complementDD. Result  has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 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)
[2023-09-01 09:53:38,726 INFO  L175             Difference]: Start difference. First operand has 31 places, 17 transitions, 72 flow. Second operand 5 states and 404 transitions.
[2023-09-01 09:53:38,726 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 37 transitions, 225 flow
[2023-09-01 09:53:38,727 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 37 transitions, 194 flow, removed 10 selfloop flow, removed 5 redundant places.
[2023-09-01 09:53:38,728 INFO  L231             Difference]: Finished difference. Result has 30 places, 21 transitions, 92 flow
[2023-09-01 09:53:38,728 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=92, PETRI_PLACES=30, PETRI_TRANSITIONS=21}
[2023-09-01 09:53:38,731 INFO  L281   CegarLoopForPetriNet]: 24 programPoint places, 6 predicate places.
[2023-09-01 09:53:38,731 INFO  L495      AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 92 flow
[2023-09-01 09:53:38,731 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 77.75) internal successors, (311), 4 states have internal predecessors, (311), 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)
[2023-09-01 09:53:38,731 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-09-01 09:53:38,731 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-09-01 09:53:38,732 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-09-01 09:53:38,732 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-09-01 09:53:38,732 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-09-01 09:53:38,732 INFO  L85        PathProgramCache]: Analyzing trace with hash -772790802, now seen corresponding path program 2 times
[2023-09-01 09:53:38,732 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-09-01 09:53:38,733 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510331646]
[2023-09-01 09:53:38,733 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-09-01 09:53:38,733 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-09-01 09:53:38,773 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-09-01 09:53:38,998 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-09-01 09:53:38,998 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-09-01 09:53:38,999 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510331646]
[2023-09-01 09:53:38,999 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510331646] provided 1 perfect and 0 imperfect interpolant sequences
[2023-09-01 09:53:38,999 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-09-01 09:53:38,999 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-09-01 09:53:38,999 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182885072]
[2023-09-01 09:53:39,000 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-09-01 09:53:39,000 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-09-01 09:53:39,000 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-09-01 09:53:39,001 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-09-01 09:53:39,005 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-09-01 09:53:39,014 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 77 out of 174
[2023-09-01 09:53:39,015 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 92 flow. Second operand  has 4 states, 4 states have (on average 80.75) internal successors, (323), 4 states have internal predecessors, (323), 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)
[2023-09-01 09:53:39,015 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-09-01 09:53:39,015 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 174
[2023-09-01 09:53:39,015 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-09-01 09:53:39,074 INFO  L130       PetriNetUnfolder]: 23/78 cut-off events.
[2023-09-01 09:53:39,074 INFO  L131       PetriNetUnfolder]: For 59/59 co-relation queries the response was YES.
[2023-09-01 09:53:39,074 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 258 conditions, 78 events. 23/78 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 215 event pairs, 3 based on Foata normal form. 1/79 useless extension candidates. Maximal degree in co-relation 243. Up to 43 conditions per place. 
[2023-09-01 09:53:39,075 INFO  L137   encePairwiseOnDemand]: 171/174 looper letters, 18 selfloop transitions, 1 changer transitions 15/34 dead transitions.
[2023-09-01 09:53:39,075 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 212 flow
[2023-09-01 09:53:39,075 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-09-01 09:53:39,076 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-09-01 09:53:39,077 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 337 transitions.
[2023-09-01 09:53:39,077 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48419540229885055
[2023-09-01 09:53:39,077 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 337 transitions.
[2023-09-01 09:53:39,077 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 337 transitions.
[2023-09-01 09:53:39,078 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-09-01 09:53:39,078 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 337 transitions.
[2023-09-01 09:53:39,079 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 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)
[2023-09-01 09:53:39,080 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 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)
[2023-09-01 09:53:39,082 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 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)
[2023-09-01 09:53:39,082 INFO  L175             Difference]: Start difference. First operand has 30 places, 21 transitions, 92 flow. Second operand 4 states and 337 transitions.
[2023-09-01 09:53:39,082 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 212 flow
[2023-09-01 09:53:39,085 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 34 transitions, 212 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-09-01 09:53:39,085 INFO  L231             Difference]: Finished difference. Result has 34 places, 17 transitions, 73 flow
[2023-09-01 09:53:39,085 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=73, PETRI_PLACES=34, PETRI_TRANSITIONS=17}
[2023-09-01 09:53:39,088 INFO  L281   CegarLoopForPetriNet]: 24 programPoint places, 10 predicate places.
[2023-09-01 09:53:39,088 INFO  L495      AbstractCegarLoop]: Abstraction has has 34 places, 17 transitions, 73 flow
[2023-09-01 09:53:39,088 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 80.75) internal successors, (323), 4 states have internal predecessors, (323), 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)
[2023-09-01 09:53:39,088 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-09-01 09:53:39,089 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-09-01 09:53:39,089 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-09-01 09:53:39,089 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-09-01 09:53:39,089 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-09-01 09:53:39,090 INFO  L85        PathProgramCache]: Analyzing trace with hash -577357974, now seen corresponding path program 3 times
[2023-09-01 09:53:39,090 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-09-01 09:53:39,090 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680945379]
[2023-09-01 09:53:39,090 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-09-01 09:53:39,090 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-09-01 09:53:39,131 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-09-01 09:53:39,762 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-09-01 09:53:39,763 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-09-01 09:53:39,763 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680945379]
[2023-09-01 09:53:39,763 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680945379] provided 1 perfect and 0 imperfect interpolant sequences
[2023-09-01 09:53:39,763 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-09-01 09:53:39,763 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-09-01 09:53:39,763 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883992390]
[2023-09-01 09:53:39,764 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-09-01 09:53:39,764 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-09-01 09:53:39,764 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-09-01 09:53:39,765 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-09-01 09:53:39,765 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-09-01 09:53:39,779 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 76 out of 174
[2023-09-01 09:53:39,780 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 17 transitions, 73 flow. Second operand  has 5 states, 5 states have (on average 78.8) internal successors, (394), 5 states have internal predecessors, (394), 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)
[2023-09-01 09:53:39,780 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-09-01 09:53:39,781 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 174
[2023-09-01 09:53:39,781 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-09-01 09:53:39,848 INFO  L130       PetriNetUnfolder]: 6/36 cut-off events.
[2023-09-01 09:53:39,849 INFO  L131       PetriNetUnfolder]: For 39/39 co-relation queries the response was YES.
[2023-09-01 09:53:39,849 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 126 conditions, 36 events. 6/36 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 58 event pairs, 1 based on Foata normal form. 1/37 useless extension candidates. Maximal degree in co-relation 113. Up to 18 conditions per place. 
[2023-09-01 09:53:39,849 INFO  L137   encePairwiseOnDemand]: 169/174 looper letters, 14 selfloop transitions, 2 changer transitions 10/27 dead transitions.
[2023-09-01 09:53:39,849 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 27 transitions, 172 flow
[2023-09-01 09:53:39,850 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-09-01 09:53:39,850 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-09-01 09:53:39,851 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 479 transitions.
[2023-09-01 09:53:39,851 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45881226053639845
[2023-09-01 09:53:39,852 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 479 transitions.
[2023-09-01 09:53:39,852 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 479 transitions.
[2023-09-01 09:53:39,852 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-09-01 09:53:39,852 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 479 transitions.
[2023-09-01 09:53:39,853 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 79.83333333333333) internal successors, (479), 6 states have internal predecessors, (479), 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)
[2023-09-01 09:53:39,855 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 174.0) internal successors, (1218), 7 states have internal predecessors, (1218), 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)
[2023-09-01 09:53:39,855 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 174.0) internal successors, (1218), 7 states have internal predecessors, (1218), 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)
[2023-09-01 09:53:39,855 INFO  L175             Difference]: Start difference. First operand has 34 places, 17 transitions, 73 flow. Second operand 6 states and 479 transitions.
[2023-09-01 09:53:39,855 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 27 transitions, 172 flow
[2023-09-01 09:53:39,857 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 27 transitions, 160 flow, removed 4 selfloop flow, removed 4 redundant places.
[2023-09-01 09:53:39,857 INFO  L231             Difference]: Finished difference. Result has 36 places, 17 transitions, 76 flow
[2023-09-01 09:53:39,858 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=76, PETRI_PLACES=36, PETRI_TRANSITIONS=17}
[2023-09-01 09:53:39,858 INFO  L281   CegarLoopForPetriNet]: 24 programPoint places, 12 predicate places.
[2023-09-01 09:53:39,858 INFO  L495      AbstractCegarLoop]: Abstraction has has 36 places, 17 transitions, 76 flow
[2023-09-01 09:53:39,859 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 78.8) internal successors, (394), 5 states have internal predecessors, (394), 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)
[2023-09-01 09:53:39,859 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-09-01 09:53:39,859 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-09-01 09:53:39,859 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-09-01 09:53:39,860 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-09-01 09:53:39,860 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-09-01 09:53:39,860 INFO  L85        PathProgramCache]: Analyzing trace with hash -965855808, now seen corresponding path program 4 times
[2023-09-01 09:53:39,861 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-09-01 09:53:39,861 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746911731]
[2023-09-01 09:53:39,861 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-09-01 09:53:39,861 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-09-01 09:53:39,910 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-09-01 09:53:39,911 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-09-01 09:53:39,935 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-09-01 09:53:39,956 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-09-01 09:53:39,957 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-09-01 09:53:39,957 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining)
[2023-09-01 09:53:39,959 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining)
[2023-09-01 09:53:39,959 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining)
[2023-09-01 09:53:39,959 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining)
[2023-09-01 09:53:39,959 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining)
[2023-09-01 09:53:39,960 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-09-01 09:53:39,960 INFO  L445         BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1]
[2023-09-01 09:53:39,965 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-09-01 09:53:39,965 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2023-09-01 09:53:40,011 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 09:53:40 BasicIcfg
[2023-09-01 09:53:40,015 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-09-01 09:53:40,016 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2023-09-01 09:53:40,016 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2023-09-01 09:53:40,016 INFO  L275        PluginConnector]: Witness Printer initialized
[2023-09-01 09:53:40,016 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:53:33" (3/4) ...
[2023-09-01 09:53:40,018 INFO  L131         WitnessPrinter]: Generating witness for reachability counterexample
[2023-09-01 09:53:40,093 INFO  L141         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2023-09-01 09:53:40,094 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-09-01 09:53:40,095 INFO  L158              Benchmark]: Toolchain (without parser) took 7989.93ms. Allocated memory was 69.2MB in the beginning and 146.8MB in the end (delta: 77.6MB). Free memory was 45.5MB in the beginning and 88.5MB in the end (delta: -42.9MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB.
[2023-09-01 09:53:40,095 INFO  L158              Benchmark]: CDTParser took 0.86ms. Allocated memory is still 54.5MB. Free memory is still 31.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-09-01 09:53:40,095 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 591.83ms. Allocated memory is still 69.2MB. Free memory was 45.3MB in the beginning and 40.1MB in the end (delta: 5.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2023-09-01 09:53:40,096 INFO  L158              Benchmark]: Boogie Procedure Inliner took 46.99ms. Allocated memory is still 69.2MB. Free memory was 40.1MB in the beginning and 37.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-09-01 09:53:40,096 INFO  L158              Benchmark]: Boogie Preprocessor took 63.43ms. Allocated memory is still 69.2MB. Free memory was 37.5MB in the beginning and 36.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-09-01 09:53:40,096 INFO  L158              Benchmark]: RCFGBuilder took 652.48ms. Allocated memory is still 69.2MB. Free memory was 35.7MB in the beginning and 42.0MB in the end (delta: -6.3MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB.
[2023-09-01 09:53:40,097 INFO  L158              Benchmark]: TraceAbstraction took 6550.92ms. Allocated memory was 69.2MB in the beginning and 146.8MB in the end (delta: 77.6MB). Free memory was 41.3MB in the beginning and 95.8MB in the end (delta: -54.5MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB.
[2023-09-01 09:53:40,097 INFO  L158              Benchmark]: Witness Printer took 78.80ms. Allocated memory is still 146.8MB. Free memory was 95.8MB in the beginning and 88.5MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2023-09-01 09:53:40,098 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.86ms. Allocated memory is still 54.5MB. Free memory is still 31.9MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 591.83ms. Allocated memory is still 69.2MB. Free memory was 45.3MB in the beginning and 40.1MB in the end (delta: 5.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 46.99ms. Allocated memory is still 69.2MB. Free memory was 40.1MB in the beginning and 37.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 63.43ms. Allocated memory is still 69.2MB. Free memory was 37.5MB in the beginning and 36.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * RCFGBuilder took 652.48ms. Allocated memory is still 69.2MB. Free memory was 35.7MB in the beginning and 42.0MB in the end (delta: -6.3MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB.
 * TraceAbstraction took 6550.92ms. Allocated memory was 69.2MB in the beginning and 146.8MB in the end (delta: 77.6MB). Free memory was 41.3MB in the beginning and 95.8MB in the end (delta: -54.5MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB.
 * Witness Printer took 78.80ms. Allocated memory is still 146.8MB. Free memory was 95.8MB in the beginning and 88.5MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 2.9s, 94 PlacesBefore, 24 PlacesAfterwards, 89 TransitionsBefore, 18 TransitionsAfterwards, 1068 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 83 TotalNumberOfCompositions, 2425 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1196, independent: 1080, independent conditional: 0, independent unconditional: 1080, dependent: 116, dependent conditional: 0, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 600, independent: 575, independent conditional: 0, independent unconditional: 575, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1196, independent: 505, independent conditional: 0, independent unconditional: 505, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 600, unknown conditional: 0, unknown unconditional: 600] , Statistics on independence cache: Total cache size (in pairs): 43, Positive cache size: 33, Positive conditional cache size: 0, Positive unconditional cache size: 33, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - CounterExampleResult [Line: 19]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L709]               0  int __unbuffered_cnt = 0;
[L711]               0  int __unbuffered_p0_EAX = 0;
[L713]               0  int __unbuffered_p1_EAX = 0;
[L715]               0  int __unbuffered_p1_EBX = 0;
[L716]               0  _Bool main$tmp_guard0;
[L717]               0  _Bool main$tmp_guard1;
[L719]               0  int x = 0;
[L721]               0  int y = 0;
[L722]               0  _Bool y$flush_delayed;
[L723]               0  int y$mem_tmp;
[L724]               0  _Bool y$r_buff0_thd0;
[L725]               0  _Bool y$r_buff0_thd1;
[L726]               0  _Bool y$r_buff0_thd2;
[L727]               0  _Bool y$r_buff1_thd0;
[L728]               0  _Bool y$r_buff1_thd1;
[L729]               0  _Bool y$r_buff1_thd2;
[L730]               0  _Bool y$read_delayed;
[L731]               0  int *y$read_delayed_var;
[L732]               0  int y$w_buff0;
[L733]               0  _Bool y$w_buff0_used;
[L734]               0  int y$w_buff1;
[L735]               0  _Bool y$w_buff1_used;
[L737]               0  int z = 0;
[L738]               0  _Bool weak$$choice0;
[L739]               0  _Bool weak$$choice2;
[L815]               0  pthread_t t1649;
[L816]  FCALL, FORK  0  pthread_create(&t1649, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1649, ((void *)0), P0, ((void *)0))=-2, t1649={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L817]               0  pthread_t t1650;
[L818]  FCALL, FORK  0  pthread_create(&t1650, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1650, ((void *)0), P1, ((void *)0))=-1, t1649={5:0}, t1650={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L773]               2  y$w_buff1 = y$w_buff0
[L774]               2  y$w_buff0 = 1
[L775]               2  y$w_buff1_used = y$w_buff0_used
[L776]               2  y$w_buff0_used = (_Bool)1
[L777]  CALL         2  __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L19]   COND FALSE   2  !(!expression)
[L777]  RET          2  __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L778]               2  y$r_buff1_thd0 = y$r_buff0_thd0
[L779]               2  y$r_buff1_thd1 = y$r_buff0_thd1
[L780]               2  y$r_buff1_thd2 = y$r_buff0_thd2
[L781]               2  y$r_buff0_thd2 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L784]               2  z = 1
[L787]               2  __unbuffered_p1_EAX = z
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L790]               2  __unbuffered_p1_EBX = x
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L743]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L748]               1  weak$$choice0 = __VERIFIER_nondet_bool()
[L749]               1  weak$$choice2 = __VERIFIER_nondet_bool()
[L750]               1  y$flush_delayed = weak$$choice2
[L751]               1  y$mem_tmp = y
[L752]               1  y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L753]               1  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L754]               1  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L755]               1  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L756]               1  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L757]               1  y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L758]               1  y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L759]               1  __unbuffered_p0_EAX = y
[L760]               1  y = y$flush_delayed ? y$mem_tmp : y
[L761]               1  y$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L766]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L768]               1  return 0;
[L793]               2  y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L794]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L795]               2  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L796]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L797]               2  y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L800]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L802]               2  return 0;
[L820]               0  main$tmp_guard0 = __unbuffered_cnt == 2
[L822]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L4]    COND FALSE   0  !(!cond)
[L822]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L824]               0  y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L825]               0  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L826]               0  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L827]               0  y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L828]               0  y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
        VAL             [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1649={5:0}, t1650={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L831]               0  main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0)
[L833]  CALL         0  __VERIFIER_assert(main$tmp_guard1)
[L19]   COND TRUE    0  !expression
[L19]                0  reach_error()
        VAL             [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]

  - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable
    Unable to prove that call to reach_error is unreachable
 Reason: Not analyzed. 
  - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 818]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 5 procedures, 110 locations, 5 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: 6.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 149 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 111 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 386 IncrementalHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 24 mSDtfsCounter, 386 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=5, InterpolantAutomatonStates: 32, 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.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 93 NumberOfCodeBlocks, 93 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 71 ConstructedInterpolants, 0 QuantifiedInterpolants, 302 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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
RESULT: Ultimate proved your program to be incorrect!
[2023-09-01 09:53:40,136 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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