/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe001_rmo.oepc.i


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


This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239
[2021-03-25 14:47:21,676 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2021-03-25 14:47:21,677 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2021-03-25 14:47:21,704 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-03-25 14:47:21,704 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-03-25 14:47:21,706 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-03-25 14:47:21,708 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-03-25 14:47:21,712 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2021-03-25 14:47:21,713 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-03-25 14:47:21,716 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-03-25 14:47:21,717 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2021-03-25 14:47:21,718 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-03-25 14:47:21,718 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-03-25 14:47:21,719 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-03-25 14:47:21,720 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-03-25 14:47:21,721 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-03-25 14:47:21,723 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-03-25 14:47:21,723 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-03-25 14:47:21,725 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-03-25 14:47:21,731 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2021-03-25 14:47:21,732 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-03-25 14:47:21,733 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-03-25 14:47:21,734 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2021-03-25 14:47:21,734 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-03-25 14:47:21,736 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-03-25 14:47:21,736 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-03-25 14:47:21,736 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-03-25 14:47:21,736 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-03-25 14:47:21,737 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-03-25 14:47:21,737 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-03-25 14:47:21,737 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-03-25 14:47:21,738 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-03-25 14:47:21,738 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-03-25 14:47:21,739 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2021-03-25 14:47:21,739 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-03-25 14:47:21,739 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2021-03-25 14:47:21,740 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-03-25 14:47:21,740 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-03-25 14:47:21,740 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2021-03-25 14:47:21,741 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2021-03-25 14:47:21,741 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2021-03-25 14:47:21,746 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf
[2021-03-25 14:47:21,772 INFO  L113        SettingsManager]: Loading preferences was successful
[2021-03-25 14:47:21,772 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2021-03-25 14:47:21,775 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-03-25 14:47:21,775 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2021-03-25 14:47:21,775 INFO  L138        SettingsManager]:  * Use SBE=true
[2021-03-25 14:47:21,775 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-03-25 14:47:21,775 INFO  L138        SettingsManager]:  * sizeof long=4
[2021-03-25 14:47:21,775 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2021-03-25 14:47:21,775 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2021-03-25 14:47:21,775 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2021-03-25 14:47:21,776 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2021-03-25 14:47:21,776 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-03-25 14:47:21,776 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2021-03-25 14:47:21,776 INFO  L138        SettingsManager]:  * sizeof long double=12
[2021-03-25 14:47:21,776 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2021-03-25 14:47:21,776 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2021-03-25 14:47:21,777 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2021-03-25 14:47:21,777 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-03-25 14:47:21,777 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2021-03-25 14:47:21,777 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2021-03-25 14:47:21,777 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2021-03-25 14:47:21,777 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-03-25 14:47:21,777 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-03-25 14:47:21,777 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2021-03-25 14:47:21,777 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-03-25 14:47:21,778 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2021-03-25 14:47:21,778 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-03-25 14:47:21,778 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2021-03-25 14:47:21,778 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2021-03-25 14:47:21,778 INFO  L138        SettingsManager]:  * Apply repeated Lipton Reduction=true
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
[2021-03-25 14:47:22,016 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2021-03-25 14:47:22,033 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-03-25 14:47:22,035 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-03-25 14:47:22,035 INFO  L271        PluginConnector]: Initializing CDTParser...
[2021-03-25 14:47:22,036 INFO  L275        PluginConnector]: CDTParser initialized
[2021-03-25 14:47:22,037 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_rmo.oepc.i
[2021-03-25 14:47:22,077 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c9024572/0507dcd6bfdd4caaae2883b16a8cdb2c/FLAGdc1276bb3
[2021-03-25 14:47:22,553 INFO  L306              CDTParser]: Found 1 translation units.
[2021-03-25 14:47:22,554 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_rmo.oepc.i
[2021-03-25 14:47:22,569 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c9024572/0507dcd6bfdd4caaae2883b16a8cdb2c/FLAGdc1276bb3
[2021-03-25 14:47:22,584 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c9024572/0507dcd6bfdd4caaae2883b16a8cdb2c
[2021-03-25 14:47:22,586 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-03-25 14:47:22,588 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2021-03-25 14:47:22,590 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-03-25 14:47:22,590 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-03-25 14:47:22,592 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2021-03-25 14:47:22,593 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:47:22" (1/1) ...
[2021-03-25 14:47:22,594 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@701182a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:47:22, skipping insertion in model container
[2021-03-25 14:47:22,594 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:47:22" (1/1) ...
[2021-03-25 14:47:22,598 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2021-03-25 14:47:22,636 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2021-03-25 14:47:22,792 WARN  L226   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_rmo.oepc.i[993,1006]
[2021-03-25 14:47:22,929 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-03-25 14:47:22,938 INFO  L203         MainTranslator]: Completed pre-run
[2021-03-25 14:47:22,948 WARN  L226   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_rmo.oepc.i[993,1006]
[2021-03-25 14:47:23,014 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-03-25 14:47:23,071 INFO  L208         MainTranslator]: Completed translation
[2021-03-25 14:47:23,071 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:47:23 WrapperNode
[2021-03-25 14:47:23,071 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-03-25 14:47:23,073 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-03-25 14:47:23,073 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-03-25 14:47:23,074 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2021-03-25 14:47:23,078 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:47:23" (1/1) ...
[2021-03-25 14:47:23,106 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:47:23" (1/1) ...
[2021-03-25 14:47:23,126 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-03-25 14:47:23,126 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-03-25 14:47:23,126 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2021-03-25 14:47:23,126 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2021-03-25 14:47:23,131 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:47:23" (1/1) ...
[2021-03-25 14:47:23,131 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:47:23" (1/1) ...
[2021-03-25 14:47:23,134 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:47:23" (1/1) ...
[2021-03-25 14:47:23,134 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:47:23" (1/1) ...
[2021-03-25 14:47:23,141 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:47:23" (1/1) ...
[2021-03-25 14:47:23,144 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:47:23" (1/1) ...
[2021-03-25 14:47:23,146 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:47:23" (1/1) ...
[2021-03-25 14:47:23,149 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-03-25 14:47:23,150 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-03-25 14:47:23,150 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2021-03-25 14:47:23,150 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2021-03-25 14:47:23,150 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:47:23" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-03-25 14:47:23,197 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2021-03-25 14:47:23,197 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2021-03-25 14:47:23,197 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-03-25 14:47:23,197 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-03-25 14:47:23,198 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-03-25 14:47:23,198 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2021-03-25 14:47:23,198 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2021-03-25 14:47:23,198 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2021-03-25 14:47:23,198 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2021-03-25 14:47:23,198 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2021-03-25 14:47:23,198 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2021-03-25 14:47:23,198 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2021-03-25 14:47:23,198 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-03-25 14:47:23,198 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-03-25 14:47:23,198 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-03-25 14:47:23,199 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2021-03-25 14:47:25,285 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-03-25 14:47:25,285 INFO  L299             CfgBuilder]: Removed 8 assume(true) statements.
[2021-03-25 14:47:25,287 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:47:25 BoogieIcfgContainer
[2021-03-25 14:47:25,287 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-03-25 14:47:25,289 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-03-25 14:47:25,289 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2021-03-25 14:47:25,291 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2021-03-25 14:47:25,291 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:47:22" (1/3) ...
[2021-03-25 14:47:25,292 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1498ea10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:47:25, skipping insertion in model container
[2021-03-25 14:47:25,292 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:47:23" (2/3) ...
[2021-03-25 14:47:25,292 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1498ea10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:47:25, skipping insertion in model container
[2021-03-25 14:47:25,292 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:47:25" (3/3) ...
[2021-03-25 14:47:25,293 INFO  L111   eAbstractionObserver]: Analyzing ICFG safe001_rmo.oepc.i
[2021-03-25 14:47:25,297 INFO  L149   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-03-25 14:47:25,300 INFO  L161   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2021-03-25 14:47:25,300 INFO  L323   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-03-25 14:47:25,336 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,336 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,337 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,337 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,337 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,337 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,337 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,337 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,337 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,337 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,337 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,337 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,337 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,337 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,337 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,338 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,338 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,338 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,338 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,338 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,338 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,338 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,338 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,339 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,339 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,339 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,339 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,339 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,339 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,339 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,339 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,339 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,339 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,340 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,340 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,340 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,340 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,341 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,341 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,341 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,341 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,341 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,341 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,341 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,341 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,341 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,341 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,341 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,342 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,342 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,342 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,342 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,343 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,343 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,343 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,343 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,343 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,344 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,344 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,344 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,344 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,344 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,344 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,344 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,344 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,344 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,344 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,344 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,345 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,345 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,345 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,345 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,345 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,345 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,345 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,346 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,346 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,346 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,346 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,346 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,346 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,346 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,346 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,346 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,346 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,346 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,347 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,347 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,347 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,347 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,347 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,347 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,347 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,347 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,347 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,347 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,349 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,349 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,350 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,352 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,352 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,352 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,352 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,355 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,356 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,356 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,356 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,356 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,356 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,356 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,356 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,356 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,356 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,356 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,356 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,356 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,356 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,357 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,357 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,357 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,357 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,357 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,357 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,357 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,357 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,357 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,358 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,358 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,358 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,358 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,358 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,358 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,358 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,358 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,358 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,358 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,358 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,358 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,359 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,359 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,359 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,359 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,359 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,359 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,359 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,359 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,359 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,359 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,359 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,359 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,359 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,359 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,359 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,359 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,359 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,360 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,360 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,360 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,360 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,360 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,360 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,360 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,360 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,360 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,360 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,360 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,360 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,361 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,361 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,361 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,361 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,362 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,362 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,362 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,362 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,362 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,362 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,362 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,362 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,362 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,362 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,362 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,363 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,363 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,364 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,364 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,364 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,364 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,364 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,364 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,364 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,364 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,364 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,364 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,364 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,364 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,364 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,364 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,364 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,364 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,364 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,364 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,364 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,365 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,365 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,365 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,365 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,365 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,365 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,365 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,365 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,365 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,365 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,365 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,365 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,365 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,365 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,365 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,365 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,365 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,365 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,366 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,366 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,366 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,366 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,366 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,370 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,370 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,370 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,370 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,371 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,371 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,371 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,371 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,371 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,375 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,375 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,376 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,376 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,376 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,376 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,376 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,376 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,376 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,376 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,376 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,376 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,376 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,378 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,378 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,378 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,378 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,378 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,378 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,378 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,378 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,379 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,379 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,379 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,380 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,380 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,380 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,380 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,380 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,380 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,381 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,381 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,381 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,381 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,381 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,381 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,381 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,381 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,381 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,381 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,381 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,381 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,381 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,381 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,381 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,382 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,382 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,382 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,382 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,382 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,382 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,382 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,382 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,382 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,382 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,382 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,382 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,382 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,382 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,382 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,382 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,383 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,383 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,383 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,383 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,384 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,384 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,384 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,384 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,384 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,384 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,384 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,384 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,384 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,384 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,384 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,384 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,384 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,384 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,384 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,385 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,385 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,385 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,385 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,385 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,385 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,385 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,385 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,385 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,385 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,385 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,385 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,385 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-25 14:47:25,386 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-03-25 14:47:25,397 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 4 error locations.
[2021-03-25 14:47:25,417 INFO  L376      AbstractCegarLoop]: Interprodecural is true
[2021-03-25 14:47:25,417 INFO  L377      AbstractCegarLoop]: Hoare is false
[2021-03-25 14:47:25,417 INFO  L378      AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-03-25 14:47:25,417 INFO  L379      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-03-25 14:47:25,417 INFO  L380      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-03-25 14:47:25,417 INFO  L381      AbstractCegarLoop]: Difference is false
[2021-03-25 14:47:25,417 INFO  L382      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-03-25 14:47:25,419 INFO  L386      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2021-03-25 14:47:25,428 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 241 flow
[2021-03-25 14:47:25,465 INFO  L129       PetriNetUnfolder]: 2/110 cut-off events.
[2021-03-25 14:47:25,465 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-03-25 14:47:25,467 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. 
[2021-03-25 14:47:25,467 INFO  L82        GeneralOperation]: Start removeDead. Operand has 121 places, 113 transitions, 241 flow
[2021-03-25 14:47:25,470 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 107 places, 98 transitions, 205 flow
[2021-03-25 14:47:25,471 INFO  L165   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-03-25 14:47:25,479 INFO  L137   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 98 transitions, 205 flow
[2021-03-25 14:47:25,481 INFO  L129        LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 98 transitions, 205 flow
[2021-03-25 14:47:25,484 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 107 places, 98 transitions, 205 flow
[2021-03-25 14:47:25,510 INFO  L129       PetriNetUnfolder]: 1/98 cut-off events.
[2021-03-25 14:47:25,510 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-03-25 14:47:25,511 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 1/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. 
[2021-03-25 14:47:25,514 INFO  L142        LiptonReduction]: Number of co-enabled transitions 1018
[2021-03-25 14:47:27,647 WARN  L205               SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70
[2021-03-25 14:47:28,064 WARN  L205               SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 93
[2021-03-25 14:47:28,177 WARN  L205               SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 91
[2021-03-25 14:47:30,295 WARN  L205               SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 197
[2021-03-25 14:47:30,583 WARN  L205               SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 195
[2021-03-25 14:47:31,875 WARN  L205               SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 322 DAG size of output: 277
[2021-03-25 14:47:32,518 WARN  L205               SmtUtils]: Spent 641.00 ms on a formula simplification that was a NOOP. DAG size: 274
[2021-03-25 14:47:33,204 WARN  L205               SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 191
[2021-03-25 14:47:33,482 WARN  L205               SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 189
[2021-03-25 14:47:34,747 WARN  L205               SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 315 DAG size of output: 271
[2021-03-25 14:47:35,332 WARN  L205               SmtUtils]: Spent 583.00 ms on a formula simplification that was a NOOP. DAG size: 268
[2021-03-25 14:47:36,889 WARN  L205               SmtUtils]: Spent 965.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 258
[2021-03-25 14:47:37,318 WARN  L205               SmtUtils]: Spent 426.00 ms on a formula simplification that was a NOOP. DAG size: 256
[2021-03-25 14:47:39,147 WARN  L205               SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 394 DAG size of output: 350
[2021-03-25 14:47:39,979 WARN  L205               SmtUtils]: Spent 829.00 ms on a formula simplification that was a NOOP. DAG size: 347
[2021-03-25 14:47:40,818 INFO  L154        LiptonReduction]: Checked pairs total: 1814
[2021-03-25 14:47:40,818 INFO  L156        LiptonReduction]: Total number of compositions: 63
[2021-03-25 14:47:40,819 INFO  L199   CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15349
[2021-03-25 14:47:40,833 INFO  L129       PetriNetUnfolder]: 1/37 cut-off events.
[2021-03-25 14:47:40,833 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-03-25 14:47:40,833 INFO  L255   CegarLoopForPetriNet]: Found error trace
[2021-03-25 14:47:40,834 INFO  L263   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-25 14:47:40,834 INFO  L428      AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-25 14:47:40,839 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-25 14:47:40,839 INFO  L82        PathProgramCache]: Analyzing trace with hash 376533481, now seen corresponding path program 1 times
[2021-03-25 14:47:40,844 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-25 14:47:40,844 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918947720]
[2021-03-25 14:47:40,844 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-25 14:47:40,996 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-25 14:47:41,075 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:47:41,075 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-25 14:47:41,076 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:47:41,080 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-25 14:47:41,090 INFO  L142       QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size
[2021-03-25 14:47:41,090 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4
[2021-03-25 14:47:41,096 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-25 14:47:41,096 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918947720]
[2021-03-25 14:47:41,097 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-25 14:47:41,097 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-03-25 14:47:41,097 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167285501]
[2021-03-25 14:47:41,102 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-03-25 14:47:41,102 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-25 14:47:41,110 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-03-25 14:47:41,111 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-03-25 14:47:41,112 INFO  L508   CegarLoopForPetriNet]: Number of universal loopers: 159 out of 176
[2021-03-25 14:47:41,116 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand  has 4 states, 4 states have (on average 159.75) internal successors, (639), 4 states have internal predecessors, (639), 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)
[2021-03-25 14:47:41,116 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-25 14:47:41,116 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 176
[2021-03-25 14:47:41,117 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-25 14:47:41,159 INFO  L129       PetriNetUnfolder]: 0/41 cut-off events.
[2021-03-25 14:47:41,160 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-03-25 14:47:41,160 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 58 conditions, 41 events. 0/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 39 event pairs, 0 based on Foata normal form. 4/44 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. 
[2021-03-25 14:47:41,161 INFO  L132   encePairwiseOnDemand]: 171/176 looper letters, 2 selfloop transitions, 2 changer transitions 3/38 dead transitions.
[2021-03-25 14:47:41,161 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 38 transitions, 97 flow
[2021-03-25 14:47:41,162 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-03-25 14:47:41,163 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2021-03-25 14:47:41,171 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 805 transitions.
[2021-03-25 14:47:41,175 INFO  L553   CegarLoopForPetriNet]: DFA transition density 0.9147727272727273
[2021-03-25 14:47:41,175 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 805 transitions.
[2021-03-25 14:47:41,175 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 805 transitions.
[2021-03-25 14:47:41,178 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-25 14:47:41,179 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 805 transitions.
[2021-03-25 14:47:41,183 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 6 states, 5 states have (on average 161.0) internal successors, (805), 5 states have internal predecessors, (805), 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)
[2021-03-25 14:47:41,191 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 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)
[2021-03-25 14:47:41,191 INFO  L81            ComplementDD]: Finished complementDD. Result  has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 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)
[2021-03-25 14:47:41,192 INFO  L185             Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 5 states and 805 transitions.
[2021-03-25 14:47:41,193 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 38 transitions, 97 flow
[2021-03-25 14:47:41,194 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 38 transitions, 94 flow, removed 0 selfloop flow, removed 3 redundant places.
[2021-03-25 14:47:41,195 INFO  L241             Difference]: Finished difference. Result has 50 places, 35 transitions, 88 flow
[2021-03-25 14:47:41,197 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=50, PETRI_TRANSITIONS=35}
[2021-03-25 14:47:41,197 INFO  L343   CegarLoopForPetriNet]: 47 programPoint places, 3 predicate places.
[2021-03-25 14:47:41,197 INFO  L165   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-03-25 14:47:41,197 INFO  L137   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 35 transitions, 88 flow
[2021-03-25 14:47:41,198 INFO  L129        LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 35 transitions, 88 flow
[2021-03-25 14:47:41,199 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 47 places, 35 transitions, 88 flow
[2021-03-25 14:47:41,203 INFO  L129       PetriNetUnfolder]: 0/35 cut-off events.
[2021-03-25 14:47:41,204 INFO  L130       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2021-03-25 14:47:41,204 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 52 conditions, 35 events. 0/35 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 22 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. 
[2021-03-25 14:47:41,204 INFO  L142        LiptonReduction]: Number of co-enabled transitions 204
[2021-03-25 14:47:42,306 WARN  L205               SmtUtils]: Spent 841.00 ms on a formula simplification. DAG size of input: 259 DAG size of output: 244
[2021-03-25 14:47:42,721 WARN  L205               SmtUtils]: Spent 412.00 ms on a formula simplification that was a NOOP. DAG size: 239
[2021-03-25 14:47:44,413 WARN  L205               SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 350 DAG size of output: 335
[2021-03-25 14:47:45,214 WARN  L205               SmtUtils]: Spent 798.00 ms on a formula simplification that was a NOOP. DAG size: 329
[2021-03-25 14:47:46,192 INFO  L154        LiptonReduction]: Checked pairs total: 895
[2021-03-25 14:47:46,192 INFO  L156        LiptonReduction]: Total number of compositions: 12
[2021-03-25 14:47:46,192 INFO  L199   CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4995
[2021-03-25 14:47:46,193 INFO  L480      AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 64 flow
[2021-03-25 14:47:46,193 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 4 states, 4 states have (on average 159.75) internal successors, (639), 4 states have internal predecessors, (639), 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)
[2021-03-25 14:47:46,193 INFO  L255   CegarLoopForPetriNet]: Found error trace
[2021-03-25 14:47:46,193 INFO  L263   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-25 14:47:46,193 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-03-25 14:47:46,194 INFO  L428      AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-25 14:47:46,194 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-25 14:47:46,194 INFO  L82        PathProgramCache]: Analyzing trace with hash -1237164072, now seen corresponding path program 1 times
[2021-03-25 14:47:46,194 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-25 14:47:46,194 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911753782]
[2021-03-25 14:47:46,194 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-25 14:47:46,221 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-25 14:47:46,270 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:47:46,271 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-25 14:47:46,272 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:47:46,272 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-25 14:47:46,275 INFO  L142       QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size
[2021-03-25 14:47:46,276 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4
[2021-03-25 14:47:46,278 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-25 14:47:46,278 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911753782]
[2021-03-25 14:47:46,279 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-25 14:47:46,279 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-03-25 14:47:46,279 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833623367]
[2021-03-25 14:47:46,280 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-03-25 14:47:46,280 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-25 14:47:46,280 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-03-25 14:47:46,280 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-03-25 14:47:46,282 INFO  L508   CegarLoopForPetriNet]: Number of universal loopers: 165 out of 188
[2021-03-25 14:47:46,282 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 64 flow. Second operand  has 4 states, 4 states have (on average 165.75) internal successors, (663), 4 states have internal predecessors, (663), 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)
[2021-03-25 14:47:46,283 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-25 14:47:46,283 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 188
[2021-03-25 14:47:46,283 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-25 14:47:46,300 INFO  L129       PetriNetUnfolder]: 3/35 cut-off events.
[2021-03-25 14:47:46,300 INFO  L130       PetriNetUnfolder]: For 27/27 co-relation queries the response was YES.
[2021-03-25 14:47:46,301 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 69 conditions, 35 events. 3/35 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 64 event pairs, 1 based on Foata normal form. 1/34 useless extension candidates. Maximal degree in co-relation 54. Up to 10 conditions per place. 
[2021-03-25 14:47:46,301 INFO  L132   encePairwiseOnDemand]: 184/188 looper letters, 3 selfloop transitions, 3 changer transitions 0/25 dead transitions.
[2021-03-25 14:47:46,301 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 25 transitions, 80 flow
[2021-03-25 14:47:46,302 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-03-25 14:47:46,302 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-03-25 14:47:46,303 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions.
[2021-03-25 14:47:46,303 INFO  L553   CegarLoopForPetriNet]: DFA transition density 0.8900709219858156
[2021-03-25 14:47:46,303 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 502 transitions.
[2021-03-25 14:47:46,303 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 502 transitions.
[2021-03-25 14:47:46,304 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-25 14:47:46,304 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 502 transitions.
[2021-03-25 14:47:46,304 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 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)
[2021-03-25 14:47:46,305 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 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)
[2021-03-25 14:47:46,306 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 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)
[2021-03-25 14:47:46,306 INFO  L185             Difference]: Start difference. First operand has 35 places, 23 transitions, 64 flow. Second operand 3 states and 502 transitions.
[2021-03-25 14:47:46,306 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 25 transitions, 80 flow
[2021-03-25 14:47:46,306 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 72 flow, removed 2 selfloop flow, removed 4 redundant places.
[2021-03-25 14:47:46,307 INFO  L241             Difference]: Finished difference. Result has 34 places, 25 transitions, 75 flow
[2021-03-25 14:47:46,307 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=34, PETRI_TRANSITIONS=25}
[2021-03-25 14:47:46,307 INFO  L343   CegarLoopForPetriNet]: 47 programPoint places, -13 predicate places.
[2021-03-25 14:47:46,307 INFO  L165   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-03-25 14:47:46,307 INFO  L137   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 25 transitions, 75 flow
[2021-03-25 14:47:46,308 INFO  L129        LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 25 transitions, 75 flow
[2021-03-25 14:47:46,308 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 34 places, 25 transitions, 75 flow
[2021-03-25 14:47:46,317 INFO  L129       PetriNetUnfolder]: 3/31 cut-off events.
[2021-03-25 14:47:46,317 INFO  L130       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2021-03-25 14:47:46,317 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 57 conditions, 31 events. 3/31 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 1 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 45. Up to 10 conditions per place. 
[2021-03-25 14:47:46,317 INFO  L142        LiptonReduction]: Number of co-enabled transitions 210
[2021-03-25 14:47:46,812 WARN  L205               SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 106
[2021-03-25 14:47:46,925 WARN  L205               SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 102
[2021-03-25 14:47:47,040 WARN  L205               SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 106
[2021-03-25 14:47:47,144 WARN  L205               SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 102
[2021-03-25 14:47:47,756 WARN  L205               SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 157
[2021-03-25 14:47:48,016 WARN  L205               SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 153
[2021-03-25 14:47:48,540 WARN  L205               SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 157
[2021-03-25 14:47:48,800 WARN  L205               SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 153
[2021-03-25 14:47:48,802 INFO  L154        LiptonReduction]: Checked pairs total: 558
[2021-03-25 14:47:48,802 INFO  L156        LiptonReduction]: Total number of compositions: 3
[2021-03-25 14:47:48,802 INFO  L199   CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2495
[2021-03-25 14:47:48,803 INFO  L480      AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 69 flow
[2021-03-25 14:47:48,803 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 4 states, 4 states have (on average 165.75) internal successors, (663), 4 states have internal predecessors, (663), 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)
[2021-03-25 14:47:48,803 INFO  L255   CegarLoopForPetriNet]: Found error trace
[2021-03-25 14:47:48,804 INFO  L263   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-25 14:47:48,804 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-03-25 14:47:48,804 INFO  L428      AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-25 14:47:48,804 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-25 14:47:48,804 INFO  L82        PathProgramCache]: Analyzing trace with hash -1816375874, now seen corresponding path program 1 times
[2021-03-25 14:47:48,804 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-25 14:47:48,804 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98419756]
[2021-03-25 14:47:48,804 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-25 14:47:48,834 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-25 14:47:48,880 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:47:48,880 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-25 14:47:48,884 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:47:48,885 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-03-25 14:47:48,890 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-25 14:47:48,890 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98419756]
[2021-03-25 14:47:48,890 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-25 14:47:48,890 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-03-25 14:47:48,890 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255018534]
[2021-03-25 14:47:48,891 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-03-25 14:47:48,891 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-25 14:47:48,891 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-03-25 14:47:48,891 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2021-03-25 14:47:48,892 INFO  L508   CegarLoopForPetriNet]: Number of universal loopers: 170 out of 191
[2021-03-25 14:47:48,893 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 69 flow. Second operand  has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 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)
[2021-03-25 14:47:48,893 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-25 14:47:48,893 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 191
[2021-03-25 14:47:48,893 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-25 14:47:48,912 INFO  L129       PetriNetUnfolder]: 3/32 cut-off events.
[2021-03-25 14:47:48,913 INFO  L130       PetriNetUnfolder]: For 12/14 co-relation queries the response was YES.
[2021-03-25 14:47:48,913 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 64 conditions, 32 events. 3/32 cut-off events. For 12/14 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 66 event pairs, 1 based on Foata normal form. 1/31 useless extension candidates. Maximal degree in co-relation 53. Up to 10 conditions per place. 
[2021-03-25 14:47:48,913 INFO  L132   encePairwiseOnDemand]: 188/191 looper letters, 1 selfloop transitions, 2 changer transitions 0/22 dead transitions.
[2021-03-25 14:47:48,913 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 22 transitions, 75 flow
[2021-03-25 14:47:48,914 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-03-25 14:47:48,914 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-03-25 14:47:48,915 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions.
[2021-03-25 14:47:48,915 INFO  L553   CegarLoopForPetriNet]: DFA transition density 0.8970331588132635
[2021-03-25 14:47:48,915 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 514 transitions.
[2021-03-25 14:47:48,915 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 514 transitions.
[2021-03-25 14:47:48,915 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-25 14:47:48,915 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 514 transitions.
[2021-03-25 14:47:48,916 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 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)
[2021-03-25 14:47:48,917 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 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)
[2021-03-25 14:47:48,917 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 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)
[2021-03-25 14:47:48,917 INFO  L185             Difference]: Start difference. First operand has 31 places, 22 transitions, 69 flow. Second operand 3 states and 514 transitions.
[2021-03-25 14:47:48,918 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 22 transitions, 75 flow
[2021-03-25 14:47:48,918 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 22 transitions, 72 flow, removed 0 selfloop flow, removed 1 redundant places.
[2021-03-25 14:47:48,919 INFO  L241             Difference]: Finished difference. Result has 33 places, 22 transitions, 74 flow
[2021-03-25 14:47:48,919 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=33, PETRI_TRANSITIONS=22}
[2021-03-25 14:47:48,919 INFO  L343   CegarLoopForPetriNet]: 47 programPoint places, -14 predicate places.
[2021-03-25 14:47:48,919 INFO  L165   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-03-25 14:47:48,919 INFO  L137   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 22 transitions, 74 flow
[2021-03-25 14:47:48,920 INFO  L129        LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 22 transitions, 74 flow
[2021-03-25 14:47:48,920 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 33 places, 22 transitions, 74 flow
[2021-03-25 14:47:48,924 INFO  L129       PetriNetUnfolder]: 3/28 cut-off events.
[2021-03-25 14:47:48,924 INFO  L130       PetriNetUnfolder]: For 9/9 co-relation queries the response was YES.
[2021-03-25 14:47:48,924 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 59 conditions, 28 events. 3/28 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 56 event pairs, 1 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 48. Up to 10 conditions per place. 
[2021-03-25 14:47:48,924 INFO  L142        LiptonReduction]: Number of co-enabled transitions 208
[2021-03-25 14:47:52,232 INFO  L154        LiptonReduction]: Checked pairs total: 185
[2021-03-25 14:47:52,233 INFO  L156        LiptonReduction]: Total number of compositions: 0
[2021-03-25 14:47:52,233 INFO  L199   CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3314
[2021-03-25 14:47:52,233 INFO  L480      AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 74 flow
[2021-03-25 14:47:52,234 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 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)
[2021-03-25 14:47:52,234 INFO  L255   CegarLoopForPetriNet]: Found error trace
[2021-03-25 14:47:52,234 INFO  L263   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-25 14:47:52,234 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-03-25 14:47:52,234 INFO  L428      AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-25 14:47:52,234 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-25 14:47:52,234 INFO  L82        PathProgramCache]: Analyzing trace with hash -1031186792, now seen corresponding path program 1 times
[2021-03-25 14:47:52,234 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-25 14:47:52,234 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213660541]
[2021-03-25 14:47:52,234 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-25 14:47:52,266 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-25 14:47:52,280 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:47:52,281 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-25 14:47:52,281 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:47:52,281 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-25 14:47:52,284 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-25 14:47:52,284 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213660541]
[2021-03-25 14:47:52,284 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-25 14:47:52,284 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-03-25 14:47:52,284 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768452135]
[2021-03-25 14:47:52,284 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-03-25 14:47:52,284 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-25 14:47:52,284 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-03-25 14:47:52,285 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-03-25 14:47:52,285 INFO  L508   CegarLoopForPetriNet]: Number of universal loopers: 170 out of 191
[2021-03-25 14:47:52,286 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 74 flow. Second operand  has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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)
[2021-03-25 14:47:52,286 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-25 14:47:52,286 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 191
[2021-03-25 14:47:52,286 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-25 14:47:52,298 INFO  L129       PetriNetUnfolder]: 0/29 cut-off events.
[2021-03-25 14:47:52,298 INFO  L130       PetriNetUnfolder]: For 27/45 co-relation queries the response was YES.
[2021-03-25 14:47:52,298 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 65 conditions, 29 events. 0/29 cut-off events. For 27/45 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 68 event pairs, 0 based on Foata normal form. 3/31 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. 
[2021-03-25 14:47:52,298 INFO  L132   encePairwiseOnDemand]: 188/191 looper letters, 3 selfloop transitions, 3 changer transitions 0/22 dead transitions.
[2021-03-25 14:47:52,298 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 22 transitions, 86 flow
[2021-03-25 14:47:52,299 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-03-25 14:47:52,299 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-03-25 14:47:52,300 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 516 transitions.
[2021-03-25 14:47:52,300 INFO  L553   CegarLoopForPetriNet]: DFA transition density 0.900523560209424
[2021-03-25 14:47:52,300 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 516 transitions.
[2021-03-25 14:47:52,300 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 516 transitions.
[2021-03-25 14:47:52,301 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-25 14:47:52,301 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 516 transitions.
[2021-03-25 14:47:52,302 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 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)
[2021-03-25 14:47:52,302 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 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)
[2021-03-25 14:47:52,303 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 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)
[2021-03-25 14:47:52,303 INFO  L185             Difference]: Start difference. First operand has 33 places, 22 transitions, 74 flow. Second operand 3 states and 516 transitions.
[2021-03-25 14:47:52,303 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 22 transitions, 86 flow
[2021-03-25 14:47:52,303 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 22 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-03-25 14:47:52,304 INFO  L241             Difference]: Finished difference. Result has 34 places, 22 transitions, 81 flow
[2021-03-25 14:47:52,304 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=34, PETRI_TRANSITIONS=22}
[2021-03-25 14:47:52,304 INFO  L343   CegarLoopForPetriNet]: 47 programPoint places, -13 predicate places.
[2021-03-25 14:47:52,304 INFO  L165   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-03-25 14:47:52,304 INFO  L137   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 22 transitions, 81 flow
[2021-03-25 14:47:52,304 INFO  L129        LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 22 transitions, 81 flow
[2021-03-25 14:47:52,304 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 34 places, 22 transitions, 81 flow
[2021-03-25 14:47:52,308 INFO  L129       PetriNetUnfolder]: 0/29 cut-off events.
[2021-03-25 14:47:52,308 INFO  L130       PetriNetUnfolder]: For 19/25 co-relation queries the response was YES.
[2021-03-25 14:47:52,308 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 62 conditions, 29 events. 0/29 cut-off events. For 19/25 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 75 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. 
[2021-03-25 14:47:52,308 INFO  L142        LiptonReduction]: Number of co-enabled transitions 208
[2021-03-25 14:47:52,309 INFO  L154        LiptonReduction]: Checked pairs total: 215
[2021-03-25 14:47:52,309 INFO  L156        LiptonReduction]: Total number of compositions: 0
[2021-03-25 14:47:52,309 INFO  L199   CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5
[2021-03-25 14:47:52,310 INFO  L480      AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 81 flow
[2021-03-25 14:47:52,310 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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)
[2021-03-25 14:47:52,310 INFO  L255   CegarLoopForPetriNet]: Found error trace
[2021-03-25 14:47:52,310 INFO  L263   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-25 14:47:52,310 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-03-25 14:47:52,310 INFO  L428      AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-25 14:47:52,311 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-25 14:47:52,311 INFO  L82        PathProgramCache]: Analyzing trace with hash -1031187009, now seen corresponding path program 1 times
[2021-03-25 14:47:52,311 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-25 14:47:52,311 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543481738]
[2021-03-25 14:47:52,311 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-25 14:47:52,384 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-25 14:47:52,438 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:47:52,439 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16
[2021-03-25 14:47:52,447 INFO  L142       QuantifierPusher]: treesize reduction 20, result has 47.4 percent of original size
[2021-03-25 14:47:52,449 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18
[2021-03-25 14:47:52,457 INFO  L142       QuantifierPusher]: treesize reduction 17, result has 66.0 percent of original size
[2021-03-25 14:47:52,458 INFO  L147       QuantifierPusher]: treesize reduction 3, result has 90.9 percent of original size 30
[2021-03-25 14:47:52,481 INFO  L142       QuantifierPusher]: treesize reduction 88, result has 38.0 percent of original size
[2021-03-25 14:47:52,484 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 54
[2021-03-25 14:47:52,507 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-25 14:47:52,507 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543481738]
[2021-03-25 14:47:52,507 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-25 14:47:52,507 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-03-25 14:47:52,507 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111604892]
[2021-03-25 14:47:52,508 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-03-25 14:47:52,508 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-25 14:47:52,508 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-03-25 14:47:52,508 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2021-03-25 14:47:52,510 INFO  L508   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 191
[2021-03-25 14:47:52,511 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 81 flow. Second operand  has 6 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 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)
[2021-03-25 14:47:52,511 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-25 14:47:52,512 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 191
[2021-03-25 14:47:52,512 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-25 14:47:52,768 INFO  L129       PetriNetUnfolder]: 178/410 cut-off events.
[2021-03-25 14:47:52,768 INFO  L130       PetriNetUnfolder]: For 289/327 co-relation queries the response was YES.
[2021-03-25 14:47:52,769 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 916 conditions, 410 events. 178/410 cut-off events. For 289/327 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2199 event pairs, 40 based on Foata normal form. 22/422 useless extension candidates. Maximal degree in co-relation 903. Up to 145 conditions per place. 
[2021-03-25 14:47:52,770 INFO  L132   encePairwiseOnDemand]: 182/191 looper letters, 14 selfloop transitions, 13 changer transitions 0/38 dead transitions.
[2021-03-25 14:47:52,771 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 38 transitions, 171 flow
[2021-03-25 14:47:52,775 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2021-03-25 14:47:52,775 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2021-03-25 14:47:52,777 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 786 transitions.
[2021-03-25 14:47:52,777 INFO  L553   CegarLoopForPetriNet]: DFA transition density 0.6858638743455497
[2021-03-25 14:47:52,777 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 786 transitions.
[2021-03-25 14:47:52,777 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 786 transitions.
[2021-03-25 14:47:52,777 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-25 14:47:52,777 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 786 transitions.
[2021-03-25 14:47:52,779 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 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)
[2021-03-25 14:47:52,780 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 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)
[2021-03-25 14:47:52,781 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 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)
[2021-03-25 14:47:52,781 INFO  L185             Difference]: Start difference. First operand has 34 places, 22 transitions, 81 flow. Second operand 6 states and 786 transitions.
[2021-03-25 14:47:52,781 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 38 transitions, 171 flow
[2021-03-25 14:47:52,782 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 166 flow, removed 1 selfloop flow, removed 1 redundant places.
[2021-03-25 14:47:52,783 INFO  L241             Difference]: Finished difference. Result has 41 places, 30 transitions, 150 flow
[2021-03-25 14:47:52,783 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=150, PETRI_PLACES=41, PETRI_TRANSITIONS=30}
[2021-03-25 14:47:52,783 INFO  L343   CegarLoopForPetriNet]: 47 programPoint places, -6 predicate places.
[2021-03-25 14:47:52,783 INFO  L165   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-03-25 14:47:52,783 INFO  L137   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 30 transitions, 150 flow
[2021-03-25 14:47:52,784 INFO  L129        LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 30 transitions, 150 flow
[2021-03-25 14:47:52,784 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 41 places, 30 transitions, 150 flow
[2021-03-25 14:47:52,800 INFO  L129       PetriNetUnfolder]: 44/180 cut-off events.
[2021-03-25 14:47:52,800 INFO  L130       PetriNetUnfolder]: For 178/184 co-relation queries the response was YES.
[2021-03-25 14:47:52,801 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 432 conditions, 180 events. 44/180 cut-off events. For 178/184 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1021 event pairs, 6 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 417. Up to 73 conditions per place. 
[2021-03-25 14:47:52,803 INFO  L142        LiptonReduction]: Number of co-enabled transitions 272
[2021-03-25 14:47:53,380 INFO  L154        LiptonReduction]: Checked pairs total: 134
[2021-03-25 14:47:53,380 INFO  L156        LiptonReduction]: Total number of compositions: 0
[2021-03-25 14:47:53,380 INFO  L199   CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 597
[2021-03-25 14:47:53,381 INFO  L480      AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 150 flow
[2021-03-25 14:47:53,381 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 6 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 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)
[2021-03-25 14:47:53,381 INFO  L255   CegarLoopForPetriNet]: Found error trace
[2021-03-25 14:47:53,381 INFO  L263   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-25 14:47:53,381 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-03-25 14:47:53,381 INFO  L428      AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-25 14:47:53,382 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-25 14:47:53,382 INFO  L82        PathProgramCache]: Analyzing trace with hash 398305280, now seen corresponding path program 1 times
[2021-03-25 14:47:53,382 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-25 14:47:53,382 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452622956]
[2021-03-25 14:47:53,382 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-25 14:47:53,414 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-25 14:47:53,488 INFO  L142       QuantifierPusher]: treesize reduction 38, result has 45.7 percent of original size
[2021-03-25 14:47:53,489 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32
[2021-03-25 14:47:53,504 INFO  L142       QuantifierPusher]: treesize reduction 34, result has 46.0 percent of original size
[2021-03-25 14:47:53,505 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29
[2021-03-25 14:47:53,519 INFO  L142       QuantifierPusher]: treesize reduction 5, result has 82.8 percent of original size
[2021-03-25 14:47:53,520 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24
[2021-03-25 14:47:53,533 INFO  L142       QuantifierPusher]: treesize reduction 3, result has 90.6 percent of original size
[2021-03-25 14:47:53,535 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29
[2021-03-25 14:47:53,553 INFO  L142       QuantifierPusher]: treesize reduction 15, result has 50.0 percent of original size
[2021-03-25 14:47:53,555 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15
[2021-03-25 14:47:53,568 INFO  L142       QuantifierPusher]: treesize reduction 7, result has 36.4 percent of original size
[2021-03-25 14:47:53,568 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4
[2021-03-25 14:47:53,575 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-25 14:47:53,575 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452622956]
[2021-03-25 14:47:53,575 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-25 14:47:53,575 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-03-25 14:47:53,575 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181225700]
[2021-03-25 14:47:53,575 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-03-25 14:47:53,575 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-25 14:47:53,576 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-03-25 14:47:53,576 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56
[2021-03-25 14:47:53,577 INFO  L508   CegarLoopForPetriNet]: Number of universal loopers: 112 out of 191
[2021-03-25 14:47:53,578 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 150 flow. Second operand  has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 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)
[2021-03-25 14:47:53,578 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-25 14:47:53,578 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 191
[2021-03-25 14:47:53,578 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-25 14:47:53,809 INFO  L129       PetriNetUnfolder]: 206/481 cut-off events.
[2021-03-25 14:47:53,810 INFO  L130       PetriNetUnfolder]: For 862/912 co-relation queries the response was YES.
[2021-03-25 14:47:53,811 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1403 conditions, 481 events. 206/481 cut-off events. For 862/912 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2812 event pairs, 28 based on Foata normal form. 16/482 useless extension candidates. Maximal degree in co-relation 1386. Up to 208 conditions per place. 
[2021-03-25 14:47:53,812 INFO  L132   encePairwiseOnDemand]: 184/191 looper letters, 17 selfloop transitions, 5 changer transitions 17/50 dead transitions.
[2021-03-25 14:47:53,812 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 50 transitions, 308 flow
[2021-03-25 14:47:53,813 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2021-03-25 14:47:53,814 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2021-03-25 14:47:53,815 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 705 transitions.
[2021-03-25 14:47:53,815 INFO  L553   CegarLoopForPetriNet]: DFA transition density 0.6151832460732984
[2021-03-25 14:47:53,815 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 705 transitions.
[2021-03-25 14:47:53,815 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 705 transitions.
[2021-03-25 14:47:53,815 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-25 14:47:53,816 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 705 transitions.
[2021-03-25 14:47:53,817 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 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)
[2021-03-25 14:47:53,818 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 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)
[2021-03-25 14:47:53,818 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 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)
[2021-03-25 14:47:53,818 INFO  L185             Difference]: Start difference. First operand has 41 places, 30 transitions, 150 flow. Second operand 6 states and 705 transitions.
[2021-03-25 14:47:53,818 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 50 transitions, 308 flow
[2021-03-25 14:47:53,822 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 50 transitions, 307 flow, removed 0 selfloop flow, removed 1 redundant places.
[2021-03-25 14:47:53,823 INFO  L241             Difference]: Finished difference. Result has 49 places, 27 transitions, 167 flow
[2021-03-25 14:47:53,823 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=167, PETRI_PLACES=49, PETRI_TRANSITIONS=27}
[2021-03-25 14:47:53,823 INFO  L343   CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places.
[2021-03-25 14:47:53,824 INFO  L165   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-03-25 14:47:53,824 INFO  L137   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 27 transitions, 167 flow
[2021-03-25 14:47:53,824 INFO  L129        LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 27 transitions, 167 flow
[2021-03-25 14:47:53,824 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 47 places, 27 transitions, 167 flow
[2021-03-25 14:47:53,839 INFO  L129       PetriNetUnfolder]: 37/147 cut-off events.
[2021-03-25 14:47:53,839 INFO  L130       PetriNetUnfolder]: For 528/554 co-relation queries the response was YES.
[2021-03-25 14:47:53,839 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 500 conditions, 147 events. 37/147 cut-off events. For 528/554 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 742 event pairs, 10 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 480. Up to 58 conditions per place. 
[2021-03-25 14:47:53,840 INFO  L142        LiptonReduction]: Number of co-enabled transitions 202
[2021-03-25 14:47:56,470 INFO  L154        LiptonReduction]: Checked pairs total: 80
[2021-03-25 14:47:56,471 INFO  L156        LiptonReduction]: Total number of compositions: 0
[2021-03-25 14:47:56,471 INFO  L199   CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2648
[2021-03-25 14:47:56,471 INFO  L480      AbstractCegarLoop]: Abstraction has has 47 places, 27 transitions, 167 flow
[2021-03-25 14:47:56,472 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 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)
[2021-03-25 14:47:56,472 INFO  L255   CegarLoopForPetriNet]: Found error trace
[2021-03-25 14:47:56,472 INFO  L263   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-25 14:47:56,472 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-03-25 14:47:56,472 INFO  L428      AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-25 14:47:56,472 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-25 14:47:56,472 INFO  L82        PathProgramCache]: Analyzing trace with hash -541337624, now seen corresponding path program 1 times
[2021-03-25 14:47:56,472 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-25 14:47:56,472 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59300858]
[2021-03-25 14:47:56,472 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-25 14:47:56,554 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-25 14:47:56,584 INFO  L142       QuantifierPusher]: treesize reduction 4, result has 50.0 percent of original size
[2021-03-25 14:47:56,584 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4
[2021-03-25 14:47:56,587 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:47:56,587 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-25 14:47:56,591 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:47:56,591 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-25 14:47:56,591 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-25 14:47:56,592 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59300858]
[2021-03-25 14:47:56,592 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-25 14:47:56,592 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-03-25 14:47:56,592 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894677465]
[2021-03-25 14:47:56,592 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-03-25 14:47:56,592 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-25 14:47:56,592 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-03-25 14:47:56,593 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-03-25 14:47:56,593 INFO  L508   CegarLoopForPetriNet]: Number of universal loopers: 162 out of 191
[2021-03-25 14:47:56,594 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 27 transitions, 167 flow. Second operand  has 4 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 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)
[2021-03-25 14:47:56,594 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-25 14:47:56,594 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 191
[2021-03-25 14:47:56,594 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-25 14:47:56,655 INFO  L129       PetriNetUnfolder]: 152/353 cut-off events.
[2021-03-25 14:47:56,655 INFO  L130       PetriNetUnfolder]: For 1160/1276 co-relation queries the response was YES.
[2021-03-25 14:47:56,656 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1121 conditions, 353 events. 152/353 cut-off events. For 1160/1276 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2014 event pairs, 66 based on Foata normal form. 74/395 useless extension candidates. Maximal degree in co-relation 1099. Up to 201 conditions per place. 
[2021-03-25 14:47:56,657 INFO  L132   encePairwiseOnDemand]: 185/191 looper letters, 8 selfloop transitions, 7 changer transitions 2/37 dead transitions.
[2021-03-25 14:47:56,657 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 37 transitions, 221 flow
[2021-03-25 14:47:56,658 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-03-25 14:47:56,658 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2021-03-25 14:47:56,659 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 828 transitions.
[2021-03-25 14:47:56,659 INFO  L553   CegarLoopForPetriNet]: DFA transition density 0.8670157068062827
[2021-03-25 14:47:56,659 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 828 transitions.
[2021-03-25 14:47:56,659 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 828 transitions.
[2021-03-25 14:47:56,660 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-25 14:47:56,660 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 828 transitions.
[2021-03-25 14:47:56,661 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 6 states, 5 states have (on average 165.6) internal successors, (828), 5 states have internal predecessors, (828), 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)
[2021-03-25 14:47:56,662 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 6 states, 6 states have (on average 191.0) internal successors, (1146), 6 states have internal predecessors, (1146), 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)
[2021-03-25 14:47:56,662 INFO  L81            ComplementDD]: Finished complementDD. Result  has 6 states, 6 states have (on average 191.0) internal successors, (1146), 6 states have internal predecessors, (1146), 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)
[2021-03-25 14:47:56,662 INFO  L185             Difference]: Start difference. First operand has 47 places, 27 transitions, 167 flow. Second operand 5 states and 828 transitions.
[2021-03-25 14:47:56,662 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 37 transitions, 221 flow
[2021-03-25 14:47:56,664 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 37 transitions, 194 flow, removed 7 selfloop flow, removed 5 redundant places.
[2021-03-25 14:47:56,665 INFO  L241             Difference]: Finished difference. Result has 49 places, 33 transitions, 198 flow
[2021-03-25 14:47:56,665 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=49, PETRI_TRANSITIONS=33}
[2021-03-25 14:47:56,665 INFO  L343   CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places.
[2021-03-25 14:47:56,665 INFO  L165   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-03-25 14:47:56,666 INFO  L137   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 33 transitions, 198 flow
[2021-03-25 14:47:56,666 INFO  L129        LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 33 transitions, 198 flow
[2021-03-25 14:47:56,666 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 49 places, 33 transitions, 198 flow
[2021-03-25 14:47:56,698 INFO  L129       PetriNetUnfolder]: 145/354 cut-off events.
[2021-03-25 14:47:56,699 INFO  L130       PetriNetUnfolder]: For 845/914 co-relation queries the response was YES.
[2021-03-25 14:47:56,700 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1199 conditions, 354 events. 145/354 cut-off events. For 845/914 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2116 event pairs, 51 based on Foata normal form. 9/325 useless extension candidates. Maximal degree in co-relation 1179. Up to 185 conditions per place. 
[2021-03-25 14:47:56,701 INFO  L142        LiptonReduction]: Number of co-enabled transitions 270
[2021-03-25 14:47:56,706 INFO  L154        LiptonReduction]: Checked pairs total: 48
[2021-03-25 14:47:56,706 INFO  L156        LiptonReduction]: Total number of compositions: 0
[2021-03-25 14:47:56,706 INFO  L199   CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 41
[2021-03-25 14:47:56,710 INFO  L480      AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 198 flow
[2021-03-25 14:47:56,710 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 4 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 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)
[2021-03-25 14:47:56,710 INFO  L255   CegarLoopForPetriNet]: Found error trace
[2021-03-25 14:47:56,710 INFO  L263   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-25 14:47:56,710 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-03-25 14:47:56,710 INFO  L428      AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-25 14:47:56,710 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-25 14:47:56,710 INFO  L82        PathProgramCache]: Analyzing trace with hash -1890243622, now seen corresponding path program 1 times
[2021-03-25 14:47:56,710 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-25 14:47:56,710 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369423411]
[2021-03-25 14:47:56,710 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-25 14:47:56,773 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-25 14:47:56,795 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:47:56,796 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-25 14:47:56,798 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:47:56,798 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-25 14:47:56,801 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:47:56,802 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-25 14:47:56,805 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:47:56,806 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-25 14:47:56,806 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-25 14:47:56,807 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369423411]
[2021-03-25 14:47:56,807 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-25 14:47:56,807 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-03-25 14:47:56,807 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618283791]
[2021-03-25 14:47:56,807 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-03-25 14:47:56,807 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-25 14:47:56,807 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-03-25 14:47:56,807 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-03-25 14:47:56,808 INFO  L508   CegarLoopForPetriNet]: Number of universal loopers: 162 out of 191
[2021-03-25 14:47:56,809 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 198 flow. Second operand  has 5 states, 5 states have (on average 162.8) internal successors, (814), 5 states have internal predecessors, (814), 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)
[2021-03-25 14:47:56,809 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-25 14:47:56,809 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 191
[2021-03-25 14:47:56,809 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-25 14:47:56,870 INFO  L129       PetriNetUnfolder]: 74/235 cut-off events.
[2021-03-25 14:47:56,871 INFO  L130       PetriNetUnfolder]: For 1023/1523 co-relation queries the response was YES.
[2021-03-25 14:47:56,871 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 908 conditions, 235 events. 74/235 cut-off events. For 1023/1523 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1351 event pairs, 12 based on Foata normal form. 137/351 useless extension candidates. Maximal degree in co-relation 886. Up to 141 conditions per place. 
[2021-03-25 14:47:56,872 INFO  L132   encePairwiseOnDemand]: 185/191 looper letters, 6 selfloop transitions, 14 changer transitions 3/43 dead transitions.
[2021-03-25 14:47:56,872 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 43 transitions, 302 flow
[2021-03-25 14:47:56,873 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2021-03-25 14:47:56,873 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2021-03-25 14:47:56,874 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1158 transitions.
[2021-03-25 14:47:56,875 INFO  L553   CegarLoopForPetriNet]: DFA transition density 0.8661181750186986
[2021-03-25 14:47:56,875 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1158 transitions.
[2021-03-25 14:47:56,875 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1158 transitions.
[2021-03-25 14:47:56,875 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-25 14:47:56,875 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1158 transitions.
[2021-03-25 14:47:56,877 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 165.42857142857142) internal successors, (1158), 7 states have internal predecessors, (1158), 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)
[2021-03-25 14:47:56,878 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 191.0) internal successors, (1528), 8 states have internal predecessors, (1528), 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)
[2021-03-25 14:47:56,879 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 191.0) internal successors, (1528), 8 states have internal predecessors, (1528), 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)
[2021-03-25 14:47:56,879 INFO  L185             Difference]: Start difference. First operand has 49 places, 33 transitions, 198 flow. Second operand 7 states and 1158 transitions.
[2021-03-25 14:47:56,879 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 43 transitions, 302 flow
[2021-03-25 14:47:56,880 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 43 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-03-25 14:47:56,881 INFO  L241             Difference]: Finished difference. Result has 56 places, 40 transitions, 290 flow
[2021-03-25 14:47:56,881 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=290, PETRI_PLACES=56, PETRI_TRANSITIONS=40}
[2021-03-25 14:47:56,881 INFO  L343   CegarLoopForPetriNet]: 47 programPoint places, 9 predicate places.
[2021-03-25 14:47:56,881 INFO  L165   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-03-25 14:47:56,881 INFO  L137   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 40 transitions, 290 flow
[2021-03-25 14:47:56,881 INFO  L129        LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 40 transitions, 290 flow
[2021-03-25 14:47:56,882 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 56 places, 40 transitions, 290 flow
[2021-03-25 14:47:56,925 INFO  L129       PetriNetUnfolder]: 65/223 cut-off events.
[2021-03-25 14:47:56,925 INFO  L130       PetriNetUnfolder]: For 838/964 co-relation queries the response was YES.
[2021-03-25 14:47:56,926 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 943 conditions, 223 events. 65/223 cut-off events. For 838/964 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1337 event pairs, 5 based on Foata normal form. 12/218 useless extension candidates. Maximal degree in co-relation 920. Up to 131 conditions per place. 
[2021-03-25 14:47:56,928 INFO  L142        LiptonReduction]: Number of co-enabled transitions 308
[2021-03-25 14:47:56,930 INFO  L154        LiptonReduction]: Checked pairs total: 60
[2021-03-25 14:47:56,930 INFO  L156        LiptonReduction]: Total number of compositions: 0
[2021-03-25 14:47:56,930 INFO  L199   CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 49
[2021-03-25 14:47:56,932 INFO  L480      AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 290 flow
[2021-03-25 14:47:56,932 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 5 states, 5 states have (on average 162.8) internal successors, (814), 5 states have internal predecessors, (814), 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)
[2021-03-25 14:47:56,932 INFO  L255   CegarLoopForPetriNet]: Found error trace
[2021-03-25 14:47:56,932 INFO  L263   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-25 14:47:56,932 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-03-25 14:47:56,932 INFO  L428      AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-25 14:47:56,933 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-25 14:47:56,933 INFO  L82        PathProgramCache]: Analyzing trace with hash -1349566479, now seen corresponding path program 1 times
[2021-03-25 14:47:56,933 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-25 14:47:56,933 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622641657]
[2021-03-25 14:47:56,933 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-25 14:47:57,008 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-25 14:47:57,026 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:47:57,027 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-25 14:47:57,029 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:47:57,030 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-25 14:47:57,033 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:47:57,033 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-25 14:47:57,037 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:47:57,037 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-25 14:47:57,041 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-25 14:47:57,042 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-25 14:47:57,042 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-25 14:47:57,042 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622641657]
[2021-03-25 14:47:57,042 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-25 14:47:57,042 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-03-25 14:47:57,043 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989665114]
[2021-03-25 14:47:57,043 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-03-25 14:47:57,043 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-25 14:47:57,043 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-03-25 14:47:57,043 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2021-03-25 14:47:57,044 INFO  L508   CegarLoopForPetriNet]: Number of universal loopers: 162 out of 191
[2021-03-25 14:47:57,045 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 290 flow. Second operand  has 6 states, 6 states have (on average 162.83333333333334) internal successors, (977), 6 states have internal predecessors, (977), 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)
[2021-03-25 14:47:57,045 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-25 14:47:57,045 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 191
[2021-03-25 14:47:57,045 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-25 14:47:57,134 INFO  L129       PetriNetUnfolder]: 48/181 cut-off events.
[2021-03-25 14:47:57,134 INFO  L130       PetriNetUnfolder]: For 1075/1325 co-relation queries the response was YES.
[2021-03-25 14:47:57,135 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 874 conditions, 181 events. 48/181 cut-off events. For 1075/1325 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1048 event pairs, 2 based on Foata normal form. 139/310 useless extension candidates. Maximal degree in co-relation 849. Up to 124 conditions per place. 
[2021-03-25 14:47:57,136 INFO  L132   encePairwiseOnDemand]: 185/191 looper letters, 2 selfloop transitions, 17 changer transitions 6/43 dead transitions.
[2021-03-25 14:47:57,136 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 43 transitions, 352 flow
[2021-03-25 14:47:57,137 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-03-25 14:47:57,137 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2021-03-25 14:47:57,138 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1483 transitions.
[2021-03-25 14:47:57,139 INFO  L553   CegarLoopForPetriNet]: DFA transition density 0.8627108784176847
[2021-03-25 14:47:57,139 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1483 transitions.
[2021-03-25 14:47:57,139 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1483 transitions.
[2021-03-25 14:47:57,140 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-25 14:47:57,140 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1483 transitions.
[2021-03-25 14:47:57,142 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 164.77777777777777) internal successors, (1483), 9 states have internal predecessors, (1483), 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)
[2021-03-25 14:47:57,144 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 191.0) internal successors, (1910), 10 states have internal predecessors, (1910), 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)
[2021-03-25 14:47:57,145 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 191.0) internal successors, (1910), 10 states have internal predecessors, (1910), 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)
[2021-03-25 14:47:57,145 INFO  L185             Difference]: Start difference. First operand has 56 places, 40 transitions, 290 flow. Second operand 9 states and 1483 transitions.
[2021-03-25 14:47:57,145 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 43 transitions, 352 flow
[2021-03-25 14:47:57,148 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 43 transitions, 297 flow, removed 20 selfloop flow, removed 5 redundant places.
[2021-03-25 14:47:57,149 INFO  L241             Difference]: Finished difference. Result has 62 places, 37 transitions, 261 flow
[2021-03-25 14:47:57,149 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=261, PETRI_PLACES=62, PETRI_TRANSITIONS=37}
[2021-03-25 14:47:57,150 INFO  L343   CegarLoopForPetriNet]: 47 programPoint places, 15 predicate places.
[2021-03-25 14:47:57,150 INFO  L165   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-03-25 14:47:57,150 INFO  L137   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 37 transitions, 261 flow
[2021-03-25 14:47:57,150 INFO  L129        LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 37 transitions, 261 flow
[2021-03-25 14:47:57,150 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 61 places, 37 transitions, 261 flow
[2021-03-25 14:47:57,162 INFO  L129       PetriNetUnfolder]: 18/85 cut-off events.
[2021-03-25 14:47:57,162 INFO  L130       PetriNetUnfolder]: For 244/262 co-relation queries the response was YES.
[2021-03-25 14:47:57,163 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 335 conditions, 85 events. 18/85 cut-off events. For 244/262 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 376 event pairs, 1 based on Foata normal form. 5/87 useless extension candidates. Maximal degree in co-relation 311. Up to 27 conditions per place. 
[2021-03-25 14:47:57,163 INFO  L142        LiptonReduction]: Number of co-enabled transitions 206
[2021-03-25 14:47:58,577 WARN  L205               SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 296 DAG size of output: 244
[2021-03-25 14:47:58,896 WARN  L205               SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 222
[2021-03-25 14:48:01,779 WARN  L205               SmtUtils]: Spent 2.88 s on a formula simplification. DAG size of input: 408 DAG size of output: 327
[2021-03-25 14:48:02,487 WARN  L205               SmtUtils]: Spent 704.00 ms on a formula simplification that was a NOOP. DAG size: 304
[2021-03-25 14:48:02,908 WARN  L205               SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 197
[2021-03-25 14:48:03,260 WARN  L205               SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 197
[2021-03-25 14:48:03,979 WARN  L205               SmtUtils]: Spent 717.00 ms on a formula simplification that was a NOOP. DAG size: 276
[2021-03-25 14:48:04,725 WARN  L205               SmtUtils]: Spent 744.00 ms on a formula simplification that was a NOOP. DAG size: 276
[2021-03-25 14:48:05,147 WARN  L205               SmtUtils]: Spent 417.00 ms on a formula simplification that was a NOOP. DAG size: 234
[2021-03-25 14:48:05,539 WARN  L205               SmtUtils]: Spent 391.00 ms on a formula simplification that was a NOOP. DAG size: 234
[2021-03-25 14:48:06,339 WARN  L205               SmtUtils]: Spent 797.00 ms on a formula simplification that was a NOOP. DAG size: 316
[2021-03-25 14:48:07,166 WARN  L205               SmtUtils]: Spent 825.00 ms on a formula simplification that was a NOOP. DAG size: 316
[2021-03-25 14:48:07,538 WARN  L205               SmtUtils]: Spent 367.00 ms on a formula simplification that was a NOOP. DAG size: 205
[2021-03-25 14:48:07,906 WARN  L205               SmtUtils]: Spent 367.00 ms on a formula simplification that was a NOOP. DAG size: 205
[2021-03-25 14:48:08,688 WARN  L205               SmtUtils]: Spent 779.00 ms on a formula simplification that was a NOOP. DAG size: 284
[2021-03-25 14:48:09,454 WARN  L205               SmtUtils]: Spent 765.00 ms on a formula simplification that was a NOOP. DAG size: 284
[2021-03-25 14:48:09,458 INFO  L154        LiptonReduction]: Checked pairs total: 183
[2021-03-25 14:48:09,458 INFO  L156        LiptonReduction]: Total number of compositions: 9
[2021-03-25 14:48:09,458 INFO  L199   CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 12308
[2021-03-25 14:48:09,459 INFO  L480      AbstractCegarLoop]: Abstraction has has 57 places, 30 transitions, 233 flow
[2021-03-25 14:48:09,459 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 6 states, 6 states have (on average 162.83333333333334) internal successors, (977), 6 states have internal predecessors, (977), 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)
[2021-03-25 14:48:09,459 INFO  L255   CegarLoopForPetriNet]: Found error trace
[2021-03-25 14:48:09,459 INFO  L263   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-25 14:48:09,459 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-03-25 14:48:09,459 INFO  L428      AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-25 14:48:09,460 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-25 14:48:09,460 INFO  L82        PathProgramCache]: Analyzing trace with hash 1843205031, now seen corresponding path program 1 times
[2021-03-25 14:48:09,460 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-25 14:48:09,460 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951888697]
[2021-03-25 14:48:09,460 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-25 14:48:09,528 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-03-25 14:48:09,528 INFO  L223             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-03-25 14:48:09,582 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-03-25 14:48:09,582 INFO  L223             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-03-25 14:48:09,607 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-03-25 14:48:09,608 INFO  L634         BasicCegarLoop]: Counterexample might be feasible
[2021-03-25 14:48:09,608 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-03-25 14:48:09,687 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:48:09 BasicIcfg
[2021-03-25 14:48:09,687 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-03-25 14:48:09,688 INFO  L168              Benchmark]: Toolchain (without parser) took 47099.84 ms. Allocated memory was 255.9 MB in the beginning and 943.7 MB in the end (delta: 687.9 MB). Free memory was 235.5 MB in the beginning and 678.5 MB in the end (delta: -443.1 MB). Peak memory consumption was 244.2 MB. Max. memory is 16.0 GB.
[2021-03-25 14:48:09,688 INFO  L168              Benchmark]: CDTParser took 0.08 ms. Allocated memory is still 255.9 MB. Free memory is still 237.7 MB. There was no memory consumed. Max. memory is 16.0 GB.
[2021-03-25 14:48:09,688 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 482.33 ms. Allocated memory was 255.9 MB in the beginning and 371.2 MB in the end (delta: 115.3 MB). Free memory was 235.0 MB in the beginning and 327.8 MB in the end (delta: -92.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.0 GB.
[2021-03-25 14:48:09,688 INFO  L168              Benchmark]: Boogie Procedure Inliner took 52.75 ms. Allocated memory is still 371.2 MB. Free memory was 327.8 MB in the beginning and 324.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2021-03-25 14:48:09,688 INFO  L168              Benchmark]: Boogie Preprocessor took 23.06 ms. Allocated memory is still 371.2 MB. Free memory was 324.8 MB in the beginning and 321.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB.
[2021-03-25 14:48:09,688 INFO  L168              Benchmark]: RCFGBuilder took 2137.17 ms. Allocated memory was 371.2 MB in the beginning and 484.4 MB in the end (delta: 113.2 MB). Free memory was 321.5 MB in the beginning and 376.2 MB in the end (delta: -54.6 MB). Peak memory consumption was 116.8 MB. Max. memory is 16.0 GB.
[2021-03-25 14:48:09,689 INFO  L168              Benchmark]: TraceAbstraction took 44398.07 ms. Allocated memory was 484.4 MB in the beginning and 943.7 MB in the end (delta: 459.3 MB). Free memory was 375.1 MB in the beginning and 678.5 MB in the end (delta: -303.4 MB). Peak memory consumption was 155.8 MB. Max. memory is 16.0 GB.
[2021-03-25 14:48:09,689 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.08 ms. Allocated memory is still 255.9 MB. Free memory is still 237.7 MB. There was no memory consumed. Max. memory is 16.0 GB.
 * CACSL2BoogieTranslator took 482.33 ms. Allocated memory was 255.9 MB in the beginning and 371.2 MB in the end (delta: 115.3 MB). Free memory was 235.0 MB in the beginning and 327.8 MB in the end (delta: -92.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.0 GB.
 * Boogie Procedure Inliner took 52.75 ms. Allocated memory is still 371.2 MB. Free memory was 327.8 MB in the beginning and 324.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
 * Boogie Preprocessor took 23.06 ms. Allocated memory is still 371.2 MB. Free memory was 324.8 MB in the beginning and 321.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB.
 * RCFGBuilder took 2137.17 ms. Allocated memory was 371.2 MB in the beginning and 484.4 MB in the end (delta: 113.2 MB). Free memory was 321.5 MB in the beginning and 376.2 MB in the end (delta: -54.6 MB). Peak memory consumption was 116.8 MB. Max. memory is 16.0 GB.
 * TraceAbstraction took 44398.07 ms. Allocated memory was 484.4 MB in the beginning and 943.7 MB in the end (delta: 459.3 MB). Free memory was 375.1 MB in the beginning and 678.5 MB in the end (delta: -303.4 MB). Peak memory consumption was 155.8 MB. Max. memory is 16.0 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 15336.7ms, 107 PlacesBefore, 47 PlacesAfterwards, 98 TransitionsBefore, 38 TransitionsAfterwards, 1018 CoEnabledTransitionPairs, 5 FixpointIterations, 39 TrivialSequentialCompositions, 23 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 63 TotalNumberOfCompositions, 1814 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 700, positive: 631, positive conditional: 0, positive unconditional: 631, negative: 69, negative conditional: 0, negative unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 574, positive: 539, positive conditional: 0, positive unconditional: 539, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 574, positive: 539, positive conditional: 0, positive unconditional: 539, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 574, positive: 535, positive conditional: 0, positive unconditional: 535, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 39, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3529, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 592, negative conditional: 0, negative unconditional: 592, unknown: 2925, unknown conditional: 0, unknown unconditional: 2925]  ], Cache Queries: [ total: 700, positive: 92, positive conditional: 0, positive unconditional: 92, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 574, unknown conditional: 0, unknown unconditional: 574] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 36, Positive conditional cache size: 0, Positive unconditional cache size: 36, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 4994.0ms, 50 PlacesBefore, 35 PlacesAfterwards, 35 TransitionsBefore, 23 TransitionsAfterwards, 204 CoEnabledTransitionPairs, 4 FixpointIterations, 11 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 895 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 208, positive: 135, positive conditional: 0, positive unconditional: 135, negative: 73, negative conditional: 0, negative unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 31, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 179, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 171, negative conditional: 0, negative unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 208, positive: 111, positive conditional: 0, positive unconditional: 111, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 31, unknown conditional: 0, unknown unconditional: 31] , Statistics on independence cache: Total cache size (in pairs): 69, Positive cache size: 44, Positive conditional cache size: 0, Positive unconditional cache size: 44, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 2494.4ms, 34 PlacesBefore, 31 PlacesAfterwards, 25 TransitionsBefore, 22 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 558 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 129, positive: 84, positive conditional: 0, positive unconditional: 84, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 203, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 203, negative conditional: 0, negative unconditional: 203, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 129, positive: 74, positive conditional: 0, positive unconditional: 74, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 54, Positive conditional cache size: 0, Positive unconditional cache size: 54, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 3312.8ms, 33 PlacesBefore, 33 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 208 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 185 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 33, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3306, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3306, unknown conditional: 0, unknown unconditional: 3306]  ], Cache Queries: [ total: 33, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 54, Positive conditional cache size: 0, Positive unconditional cache size: 54, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 5.1ms, 34 PlacesBefore, 34 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 208 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 215 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 45, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 45, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 55, Positive conditional cache size: 0, Positive unconditional cache size: 55, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 596.7ms, 41 PlacesBefore, 41 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 272 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 134 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 26, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 573, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 573, negative conditional: 0, negative unconditional: 573, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 26, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 55, Positive conditional cache size: 0, Positive unconditional cache size: 55, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 2646.7ms, 49 PlacesBefore, 47 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 80 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2628, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2628, unknown conditional: 0, unknown unconditional: 2628]  ], Cache Queries: [ total: 11, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 55, Positive conditional cache size: 0, Positive unconditional cache size: 55, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 40.6ms, 49 PlacesBefore, 49 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 48 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 14, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 99, Positive cache size: 60, Positive conditional cache size: 0, Positive unconditional cache size: 60, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 49.1ms, 56 PlacesBefore, 56 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 308 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 60 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 19, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 19, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 63, Positive conditional cache size: 0, Positive unconditional cache size: 63, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 12308.5ms, 62 PlacesBefore, 57 PlacesAfterwards, 37 TransitionsBefore, 30 TransitionsAfterwards, 206 CoEnabledTransitionPairs, 4 FixpointIterations, 1 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 183 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 157, positive: 144, positive conditional: 0, positive unconditional: 144, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 157, positive: 135, positive conditional: 0, positive unconditional: 135, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 23, Positive cache size: 16, Positive conditional cache size: 0, Positive unconditional cache size: 16, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7
  - CounterExampleResult [Line: 19]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L710]               0  int __unbuffered_cnt = 0;
[L712]               0  int __unbuffered_p0_EAX = 0;
[L713]               0  _Bool __unbuffered_p0_EAX$flush_delayed;
[L714]               0  int __unbuffered_p0_EAX$mem_tmp;
[L715]               0  _Bool __unbuffered_p0_EAX$r_buff0_thd0;
[L716]               0  _Bool __unbuffered_p0_EAX$r_buff0_thd1;
[L717]               0  _Bool __unbuffered_p0_EAX$r_buff0_thd2;
[L718]               0  _Bool __unbuffered_p0_EAX$r_buff0_thd3;
[L719]               0  _Bool __unbuffered_p0_EAX$r_buff1_thd0;
[L720]               0  _Bool __unbuffered_p0_EAX$r_buff1_thd1;
[L721]               0  _Bool __unbuffered_p0_EAX$r_buff1_thd2;
[L722]               0  _Bool __unbuffered_p0_EAX$r_buff1_thd3;
[L723]               0  _Bool __unbuffered_p0_EAX$read_delayed;
[L724]               0  int *__unbuffered_p0_EAX$read_delayed_var;
[L725]               0  int __unbuffered_p0_EAX$w_buff0;
[L726]               0  _Bool __unbuffered_p0_EAX$w_buff0_used;
[L727]               0  int __unbuffered_p0_EAX$w_buff1;
[L728]               0  _Bool __unbuffered_p0_EAX$w_buff1_used;
[L730]               0  int __unbuffered_p2_EAX = 0;
[L731]               0  _Bool main$tmp_guard0;
[L732]               0  _Bool main$tmp_guard1;
[L734]               0  int x = 0;
[L736]               0  int y = 0;
[L737]               0  _Bool y$flush_delayed;
[L738]               0  int y$mem_tmp;
[L739]               0  _Bool y$r_buff0_thd0;
[L740]               0  _Bool y$r_buff0_thd1;
[L741]               0  _Bool y$r_buff0_thd2;
[L742]               0  _Bool y$r_buff0_thd3;
[L743]               0  _Bool y$r_buff1_thd0;
[L744]               0  _Bool y$r_buff1_thd1;
[L745]               0  _Bool y$r_buff1_thd2;
[L746]               0  _Bool y$r_buff1_thd3;
[L747]               0  _Bool y$read_delayed;
[L748]               0  int *y$read_delayed_var;
[L749]               0  int y$w_buff0;
[L750]               0  _Bool y$w_buff0_used;
[L751]               0  int y$w_buff1;
[L752]               0  _Bool y$w_buff1_used;
[L753]               0  _Bool weak$$choice0;
[L754]               0  _Bool weak$$choice1;
[L755]               0  _Bool weak$$choice2;
[L850]               0  pthread_t t1813;
[L851]  FCALL, FORK  0  pthread_create(&t1813, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={7: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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]
[L759]               1  weak$$choice0 = __VERIFIER_nondet_bool()
[L760]               1  weak$$choice2 = __VERIFIER_nondet_bool()
[L761]               1  y$flush_delayed = weak$$choice2
[L762]  EXPR         1  \read(y)
[L762]               1  y$mem_tmp = y
[L763]  EXPR         1  !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)
[L763]  EXPR         1  \read(y)
[L763]  EXPR         1  !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)
[L763]               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)
[L764]  EXPR         1  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))
[L764]  EXPR         1  !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)
[L764]  EXPR         1  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))
[L764]               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))
[L765]  EXPR         1  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))
[L765]  EXPR         1  !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)
[L765]  EXPR         1  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))
[L765]               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))
[L766]  EXPR         1  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))
[L766]  EXPR         1  !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)
[L766]  EXPR         1  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))
[L766]               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))
[L767]  EXPR         1  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))
[L767]  EXPR         1  !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)
[L767]  EXPR         1  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))
[L767]               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))
[L768]  EXPR         1  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))
[L768]  EXPR         1  !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)
[L768]  EXPR         1  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))
[L768]               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))
[L769]  EXPR         1  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))
[L769]  EXPR         1  !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)
[L769]  EXPR         1  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))
[L769]               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))
[L770]               1  __unbuffered_p0_EAX$read_delayed = (_Bool)1
[L771]               1  __unbuffered_p0_EAX$read_delayed_var = &y
[L772]  EXPR         1  \read(y)
[L772]               1  __unbuffered_p0_EAX = y
[L773]  EXPR         1  y$flush_delayed ? y$mem_tmp : y
[L773]  EXPR         1  \read(y)
[L773]  EXPR         1  y$flush_delayed ? y$mem_tmp : y
[L773]               1  y = y$flush_delayed ? y$mem_tmp : y
[L774]               1  y$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y={7: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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]
[L777]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={7: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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]
[L782]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L784]               1  return 0;
[L852]               0  pthread_t t1814;
[L853]  FCALL, FORK  0  pthread_create(&t1814, ((void *)0), P1, ((void *)0))
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={7: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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]
[L789]               2  x = 2
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=2, y={7: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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]
[L792]               2  y = 1
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=2, y={7: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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]
[L854]               0  pthread_t t1815;
[L855]  FCALL, FORK  0  pthread_create(&t1815, ((void *)0), P2, ((void *)0))
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=2, y={7: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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]
[L809]               3  weak$$choice0 = __VERIFIER_nondet_bool()
[L810]               3  weak$$choice2 = __VERIFIER_nondet_bool()
[L811]               3  y$flush_delayed = weak$$choice2
[L812]  EXPR         3  \read(y)
[L812]               3  y$mem_tmp = y
[L813]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L813]  EXPR         3  \read(y)
[L813]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L813]               3  y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L814]  EXPR         3  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L814]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)
[L814]  EXPR         3  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L814]               3  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L815]  EXPR         3  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L815]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)
[L815]  EXPR         3  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L815]               3  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L816]  EXPR         3  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L816]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)
[L816]  EXPR         3  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L816]               3  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L817]  EXPR         3  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L817]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L817]  EXPR         3  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L817]               3  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L818]  EXPR         3  weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L818]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)
[L818]  EXPR         3  weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L818]               3  y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L819]  EXPR         3  weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L819]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L819]  EXPR         3  weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L819]               3  y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L820]  EXPR         3  \read(y)
[L820]               3  __unbuffered_p2_EAX = y
[L821]  EXPR         3  y$flush_delayed ? y$mem_tmp : y
[L821]  EXPR         3  \read(y)
[L821]  EXPR         3  y$flush_delayed ? y$mem_tmp : y
[L821]               3  y = y$flush_delayed ? y$mem_tmp : y
[L822]               3  y$flush_delayed = (_Bool)0
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x=2, y={7:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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]
[L825]               3  y = 2
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x=2, y={7:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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]
[L795]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L795]  EXPR         2  y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y
[L795]  EXPR         2  \read(y)
[L795]  EXPR         2  y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y
[L795]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L795]               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)
[L796]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L796]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L797]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L797]               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
[L798]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L798]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L799]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L799]               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
[L802]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L804]               2  return 0;
[L828]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L828]  EXPR         3  y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y
[L828]  EXPR         3  \read(y)
[L828]  EXPR         3  y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y
[L828]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L828]               3  y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L829]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L829]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L830]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L830]               3  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L831]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L831]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L832]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L832]               3  y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L835]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L837]               3  return 0;
[L857]               0  main$tmp_guard0 = __unbuffered_cnt == 3
[L4]    COND FALSE   0  !(!cond)
[L861]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L861]  EXPR         0  y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L861]  EXPR         0  \read(y)
[L861]  EXPR         0  y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L861]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L861]               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)
[L862]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L862]               0  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L863]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L863]               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
[L864]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L864]               0  y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L865]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L865]               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
[L868]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L869]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L870]               0  y$flush_delayed = weak$$choice2
[L871]  EXPR         0  \read(y)
[L871]               0  y$mem_tmp = y
[L872]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L872]  EXPR         0  \read(y)
[L872]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L872]               0  y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L873]  EXPR         0  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L873]               0  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L874]  EXPR         0  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L874]               0  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L875]  EXPR         0  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L875]               0  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L876]  EXPR         0  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L876]               0  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L877]  EXPR         0  weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L877]               0  y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L878]  EXPR         0  weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L878]               0  y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L879]               0  weak$$choice1 = __VERIFIER_nondet_bool()
[L880]  EXPR         0  __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L880]  EXPR         0  weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX
[L880]  EXPR         0  \read(*__unbuffered_p0_EAX$read_delayed_var)
[L880]  EXPR         0  weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX
[L880]  EXPR         0  __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L880]               0  __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L881]  EXPR         0  x == 2 && y == 2
[L881]  EXPR         0  \read(y)
[L881]  EXPR         0  x == 2 && y == 2
[L881]               0  main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1)
[L882]  EXPR         0  y$flush_delayed ? y$mem_tmp : y
[L882]               0  y = y$flush_delayed ? y$mem_tmp : y
[L883]               0  y$flush_delayed = (_Bool)0
[L19]   COND TRUE    0  !expression
[L19]                0  reach_error()
        VAL             [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=255, x=2, y={7:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 8.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 44194.8ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 938.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 15405.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 28 SDtfs, 21 SDslu, 22 SDs, 0 SdLazy, 212 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 270.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 306.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=290occurred in iteration=8, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 36.8ms SsaConstructionTime, 509.2ms SatisfiabilityAnalysisTime, 613.4ms InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 139 ConstructedInterpolants, 0 QuantifiedInterpolants, 800 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...