/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix046_pso.opt.i


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


This is Ultimate 0.1.25-7bb8cbd
[2020-10-16 01:27:39,039 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-16 01:27:39,042 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-16 01:27:39,081 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-16 01:27:39,082 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-16 01:27:39,091 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-16 01:27:39,094 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-16 01:27:39,098 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-16 01:27:39,101 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-16 01:27:39,104 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-16 01:27:39,105 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-16 01:27:39,105 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-16 01:27:39,106 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-16 01:27:39,106 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-16 01:27:39,108 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-16 01:27:39,110 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-16 01:27:39,113 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-16 01:27:39,114 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-16 01:27:39,115 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-16 01:27:39,122 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-16 01:27:39,125 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-16 01:27:39,126 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-16 01:27:39,127 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-16 01:27:39,128 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-16 01:27:39,140 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-16 01:27:39,140 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-16 01:27:39,141 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-16 01:27:39,142 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-16 01:27:39,144 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-16 01:27:39,145 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-16 01:27:39,146 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-16 01:27:39,146 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-16 01:27:39,147 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-16 01:27:39,148 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-16 01:27:39,149 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-16 01:27:39,149 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-16 01:27:39,150 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-16 01:27:39,150 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-16 01:27:39,150 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-16 01:27:39,151 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-16 01:27:39,152 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-16 01:27:39,153 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-SemanticLbe.epf
[2020-10-16 01:27:39,193 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-16 01:27:39,194 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-16 01:27:39,196 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-16 01:27:39,196 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-16 01:27:39,196 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-16 01:27:39,196 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-16 01:27:39,197 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-16 01:27:39,197 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-16 01:27:39,197 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-16 01:27:39,197 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-16 01:27:39,198 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-16 01:27:39,199 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-16 01:27:39,199 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-16 01:27:39,200 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-16 01:27:39,200 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-16 01:27:39,200 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-16 01:27:39,200 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-16 01:27:39,201 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-16 01:27:39,201 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-16 01:27:39,201 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-16 01:27:39,201 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-16 01:27:39,201 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 01:27:39,202 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-16 01:27:39,202 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-16 01:27:39,202 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-16 01:27:39,202 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-16 01:27:39,203 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-16 01:27:39,203 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2020-10-16 01:27:39,203 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-16 01:27:39,535 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-16 01:27:39,557 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-16 01:27:39,561 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-16 01:27:39,563 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-16 01:27:39,565 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-16 01:27:39,566 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046_pso.opt.i
[2020-10-16 01:27:39,641 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9639a8db9/61023b52e3e142bdac60302c99fd3371/FLAG3e3604046
[2020-10-16 01:27:40,223 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-16 01:27:40,223 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046_pso.opt.i
[2020-10-16 01:27:40,240 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9639a8db9/61023b52e3e142bdac60302c99fd3371/FLAG3e3604046
[2020-10-16 01:27:40,492 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9639a8db9/61023b52e3e142bdac60302c99fd3371
[2020-10-16 01:27:40,501 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-16 01:27:40,503 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-16 01:27:40,504 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-16 01:27:40,504 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-16 01:27:40,508 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-16 01:27:40,510 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:27:40" (1/1) ...
[2020-10-16 01:27:40,512 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c725171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:40, skipping insertion in model container
[2020-10-16 01:27:40,513 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:27:40" (1/1) ...
[2020-10-16 01:27:40,521 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-16 01:27:40,565 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-16 01:27:41,070 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 01:27:41,084 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-16 01:27:41,147 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 01:27:41,231 INFO  L208         MainTranslator]: Completed translation
[2020-10-16 01:27:41,231 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:41 WrapperNode
[2020-10-16 01:27:41,232 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-16 01:27:41,232 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-16 01:27:41,233 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-16 01:27:41,233 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-16 01:27:41,242 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:41" (1/1) ...
[2020-10-16 01:27:41,262 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:41" (1/1) ...
[2020-10-16 01:27:41,301 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-16 01:27:41,301 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-16 01:27:41,302 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-16 01:27:41,302 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-16 01:27:41,312 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:41" (1/1) ...
[2020-10-16 01:27:41,313 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:41" (1/1) ...
[2020-10-16 01:27:41,318 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:41" (1/1) ...
[2020-10-16 01:27:41,318 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:41" (1/1) ...
[2020-10-16 01:27:41,329 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:41" (1/1) ...
[2020-10-16 01:27:41,333 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:41" (1/1) ...
[2020-10-16 01:27:41,337 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:41" (1/1) ...
[2020-10-16 01:27:41,343 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-16 01:27:41,343 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-16 01:27:41,344 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-16 01:27:41,344 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-16 01:27:41,345 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:41" (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
[2020-10-16 01:27:41,409 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-16 01:27:41,410 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-16 01:27:41,410 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-16 01:27:41,410 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-16 01:27:41,410 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-16 01:27:41,410 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-16 01:27:41,410 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-16 01:27:41,411 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-16 01:27:41,411 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-16 01:27:41,411 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-16 01:27:41,411 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2020-10-16 01:27:41,411 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2020-10-16 01:27:41,411 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-16 01:27:41,412 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-16 01:27:41,412 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-16 01:27:41,414 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-16 01:27:43,347 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-16 01:27:43,348 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-16 01:27:43,350 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:27:43 BoogieIcfgContainer
[2020-10-16 01:27:43,350 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-16 01:27:43,351 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-16 01:27:43,351 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-16 01:27:43,355 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-16 01:27:43,355 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:27:40" (1/3) ...
[2020-10-16 01:27:43,356 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@682e48eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:27:43, skipping insertion in model container
[2020-10-16 01:27:43,356 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:41" (2/3) ...
[2020-10-16 01:27:43,356 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@682e48eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:27:43, skipping insertion in model container
[2020-10-16 01:27:43,357 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:27:43" (3/3) ...
[2020-10-16 01:27:43,358 INFO  L111   eAbstractionObserver]: Analyzing ICFG mix046_pso.opt.i
[2020-10-16 01:27:43,369 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-16 01:27:43,377 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-16 01:27:43,378 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-16 01:27:43,406 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,407 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,407 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,407 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,408 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,408 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,408 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,408 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,409 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,409 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,409 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,409 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,410 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,410 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,410 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,410 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,410 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,411 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,411 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,411 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,411 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,411 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,412 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,412 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,412 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,413 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,413 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,413 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,414 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,414 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,414 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,414 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,414 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,415 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,415 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,415 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,415 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,416 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,416 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,416 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,416 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,417 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,420 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,421 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,421 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,421 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,424 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,425 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,425 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,425 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,425 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,426 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,426 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,426 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,426 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,426 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,431 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,432 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,432 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,432 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,432 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,432 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,433 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,433 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,433 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,433 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,433 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,433 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,435 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,435 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,436 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,436 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:43,452 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2020-10-16 01:27:43,473 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-16 01:27:43,473 INFO  L378      AbstractCegarLoop]: Hoare is false
[2020-10-16 01:27:43,473 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-16 01:27:43,473 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-16 01:27:43,474 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-16 01:27:43,474 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-16 01:27:43,474 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-16 01:27:43,474 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-16 01:27:43,488 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 244 flow
[2020-10-16 01:27:43,539 INFO  L129       PetriNetUnfolder]: 2/108 cut-off events.
[2020-10-16 01:27:43,539 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 01:27:43,544 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. 
[2020-10-16 01:27:43,545 INFO  L82        GeneralOperation]: Start removeDead. Operand has 123 places, 112 transitions, 244 flow
[2020-10-16 01:27:43,552 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 119 places, 108 transitions, 228 flow
[2020-10-16 01:27:43,556 INFO  L129   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-16 01:27:43,559 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 108 transitions, 228 flow
[2020-10-16 01:27:43,562 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 108 transitions, 228 flow
[2020-10-16 01:27:43,563 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 119 places, 108 transitions, 228 flow
[2020-10-16 01:27:43,596 INFO  L129       PetriNetUnfolder]: 2/108 cut-off events.
[2020-10-16 01:27:43,597 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 01:27:43,598 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. 
[2020-10-16 01:27:43,602 INFO  L117        LiptonReduction]: Number of co-enabled transitions 2540
[2020-10-16 01:27:43,928 WARN  L193               SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45
[2020-10-16 01:27:44,352 WARN  L193               SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-16 01:27:44,475 WARN  L193               SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 53
[2020-10-16 01:27:44,500 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:44,501 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:44,503 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:27:44,503 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:44,549 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:44,550 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:44,552 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:27:44,552 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:44,590 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:44,591 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:44,592 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term
[2020-10-16 01:27:44,593 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:44,620 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:44,621 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:44,622 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:27:44,623 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:44,779 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:44,780 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:44,781 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:27:44,781 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:44,785 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:27:44,786 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 01:27:44,789 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 01:27:44,789 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:44,840 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:27:44,840 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:44,847 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:44,848 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:44,849 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:44,850 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:44,853 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:44,853 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:27:44,856 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:44,857 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:27:44,858 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:44,858 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:27:44,861 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 01:27:44,861 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:44,863 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:44,863 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:44,866 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:44,866 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:44,953 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:44,953 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:44,954 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:27:44,955 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:44,981 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:44,982 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:44,983 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:27:44,984 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:45,052 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:45,053 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:45,054 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:27:45,054 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:45,069 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:45,070 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:45,070 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:27:45,071 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:45,108 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:27:45,109 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:45,121 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:45,121 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:45,122 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:45,122 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:45,125 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:45,126 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:27:45,127 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:45,128 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:27:45,129 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:45,129 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:27:45,132 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 01:27:45,132 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:45,135 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:45,135 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:45,137 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:45,137 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:45,181 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:45,182 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:45,182 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:27:45,183 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:45,185 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:27:45,186 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 01:27:45,189 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 01:27:45,189 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:46,455 WARN  L193               SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 230 DAG size of output: 189
[2020-10-16 01:27:46,469 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2020-10-16 01:27:46,469 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:46,470 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:27:46,470 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:47,683 WARN  L193               SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 147 DAG size of output: 127
[2020-10-16 01:27:47,702 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:47,702 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:47,703 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:27:47,703 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:47,736 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:47,736 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:47,737 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term
[2020-10-16 01:27:47,737 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:47,787 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:47,788 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:47,796 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:47,796 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:47,797 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:47,798 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:47,801 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:47,801 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:27:47,804 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:47,805 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:27:47,807 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:47,807 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:27:47,809 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 01:27:47,809 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:47,812 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:47,812 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:47,813 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:47,814 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:47,866 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:47,867 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:47,867 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:27:47,868 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:47,870 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:27:47,871 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 01:27:47,873 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 01:27:47,874 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:47,930 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:47,930 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:47,931 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:27:47,931 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:47,949 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:47,949 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:47,950 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:27:47,951 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:48,015 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:48,015 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:48,016 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:27:48,016 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:48,036 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:48,037 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:48,038 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:27:48,038 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:48,115 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:27:48,116 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:48,117 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:48,117 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:48,119 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:48,119 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:48,120 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:27:48,121 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:48,133 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:48,134 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:48,134 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:48,135 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:48,136 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:48,137 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:27:48,138 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:27:48,138 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:27:48,191 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 01:27:48,192 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:48,567 WARN  L193               SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-10-16 01:27:48,925 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:27:48,926 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:48,926 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-16 01:27:48,927 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:48,927 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:48,928 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:48,929 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:48,929 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:48,931 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:48,932 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:48,933 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:48,934 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:48,935 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:27:48,936 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:48,937 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:48,938 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:48,939 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:48,939 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:48,957 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:27:48,957 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:27:48,959 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:27:48,960 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:49,215 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 01:27:49,216 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:49,306 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:27:49,307 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:27:49,309 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:27:49,309 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:49,327 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:27:49,328 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:49,329 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-16 01:27:49,329 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:49,330 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:49,330 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:49,331 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:49,331 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:49,333 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:49,333 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:49,335 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:49,335 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:49,337 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:27:49,337 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:49,339 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:49,339 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:49,341 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:49,341 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:50,428 WARN  L193               SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 138 DAG size of output: 129
[2020-10-16 01:27:50,755 WARN  L193               SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 126
[2020-10-16 01:27:51,434 WARN  L193               SmtUtils]: Spent 677.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 111
[2020-10-16 01:27:51,743 WARN  L193               SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 108
[2020-10-16 01:27:51,899 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:27:51,900 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:51,901 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:51,901 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:51,903 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:51,903 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:51,904 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:27:51,905 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:51,918 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:27:51,918 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:51,919 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:51,919 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:51,921 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:51,921 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:27:51,922 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:27:51,923 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:27:52,854 WARN  L193               SmtUtils]: Spent 587.00 ms on a formula simplification that was a NOOP. DAG size: 136
[2020-10-16 01:27:53,452 WARN  L193               SmtUtils]: Spent 595.00 ms on a formula simplification that was a NOOP. DAG size: 134
[2020-10-16 01:27:53,456 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:27:53,457 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:53,458 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:53,458 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:53,459 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:53,460 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:27:53,461 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:27:53,462 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:27:53,477 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:53,477 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:53,478 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:53,478 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:53,479 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:53,479 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:53,480 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:27:53,480 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:53,649 WARN  L193               SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 54
[2020-10-16 01:27:54,039 WARN  L193               SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97
[2020-10-16 01:27:54,183 WARN  L193               SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 95
[2020-10-16 01:27:54,191 INFO  L132        LiptonReduction]: Checked pairs total: 6449
[2020-10-16 01:27:54,191 INFO  L134        LiptonReduction]: Total number of compositions: 89
[2020-10-16 01:27:54,194 INFO  L182   CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10641
[2020-10-16 01:27:54,203 INFO  L129       PetriNetUnfolder]: 0/17 cut-off events.
[2020-10-16 01:27:54,203 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 01:27:54,204 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:27:54,205 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:27:54,205 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:27:54,209 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:27:54,210 INFO  L82        PathProgramCache]: Analyzing trace with hash 445514123, now seen corresponding path program 1 times
[2020-10-16 01:27:54,218 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:27:54,218 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314198597]
[2020-10-16 01:27:54,218 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:27:54,380 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:27:54,521 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:27:54,522 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314198597]
[2020-10-16 01:27:54,523 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:27:54,523 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 01:27:54,524 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364113153]
[2020-10-16 01:27:54,534 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 01:27:54,535 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:27:54,550 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 01:27:54,553 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 01:27:54,555 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 171 out of 201
[2020-10-16 01:27:54,558 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand 3 states.
[2020-10-16 01:27:54,558 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:27:54,558 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 201
[2020-10-16 01:27:54,560 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:27:54,667 INFO  L129       PetriNetUnfolder]: 23/89 cut-off events.
[2020-10-16 01:27:54,668 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 01:27:54,669 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 150 conditions, 89 events. 23/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 326 event pairs, 3 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 139. Up to 37 conditions per place. 
[2020-10-16 01:27:54,672 INFO  L132   encePairwiseOnDemand]: 198/201 looper letters, 7 selfloop transitions, 2 changer transitions 2/31 dead transitions.
[2020-10-16 01:27:54,672 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 31 transitions, 96 flow
[2020-10-16 01:27:54,673 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 01:27:54,676 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2020-10-16 01:27:54,690 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions.
[2020-10-16 01:27:54,698 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8706467661691543
[2020-10-16 01:27:54,701 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 525 transitions.
[2020-10-16 01:27:54,702 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 525 transitions.
[2020-10-16 01:27:54,704 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:27:54,708 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 525 transitions.
[2020-10-16 01:27:54,713 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 4 states.
[2020-10-16 01:27:54,722 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states.
[2020-10-16 01:27:54,722 INFO  L81            ComplementDD]: Finished complementDD. Result 4 states.
[2020-10-16 01:27:54,725 INFO  L185             Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 3 states and 525 transitions.
[2020-10-16 01:27:54,726 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 31 transitions, 96 flow
[2020-10-16 01:27:54,729 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 92 flow, removed 0 selfloop flow, removed 4 redundant places.
[2020-10-16 01:27:54,731 INFO  L241             Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow
[2020-10-16 01:27:54,735 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26}
[2020-10-16 01:27:54,736 INFO  L342   CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places.
[2020-10-16 01:27:54,736 INFO  L481      AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow
[2020-10-16 01:27:54,736 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 01:27:54,736 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:27:54,737 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:27:54,737 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-16 01:27:54,737 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:27:54,737 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:27:54,738 INFO  L82        PathProgramCache]: Analyzing trace with hash -1357577055, now seen corresponding path program 1 times
[2020-10-16 01:27:54,738 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:27:54,738 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714759340]
[2020-10-16 01:27:54,738 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:27:54,808 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:27:54,857 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:27:54,858 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714759340]
[2020-10-16 01:27:54,858 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:27:54,858 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 01:27:54,859 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105652574]
[2020-10-16 01:27:54,860 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 01:27:54,860 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:27:54,861 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 01:27:54,861 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 01:27:54,863 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 178 out of 201
[2020-10-16 01:27:54,863 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand 3 states.
[2020-10-16 01:27:54,864 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:27:54,864 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 201
[2020-10-16 01:27:54,864 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:27:54,878 INFO  L129       PetriNetUnfolder]: 0/26 cut-off events.
[2020-10-16 01:27:54,878 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 01:27:54,879 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 42 conditions, 26 events. 0/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 32 event pairs, 0 based on Foata normal form. 1/27 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. 
[2020-10-16 01:27:54,879 INFO  L132   encePairwiseOnDemand]: 198/201 looper letters, 1 selfloop transitions, 2 changer transitions 0/26 dead transitions.
[2020-10-16 01:27:54,879 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 26 transitions, 70 flow
[2020-10-16 01:27:54,880 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 01:27:54,880 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2020-10-16 01:27:54,882 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 538 transitions.
[2020-10-16 01:27:54,882 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8922056384742952
[2020-10-16 01:27:54,883 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 538 transitions.
[2020-10-16 01:27:54,883 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 538 transitions.
[2020-10-16 01:27:54,883 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:27:54,883 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 538 transitions.
[2020-10-16 01:27:54,885 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 4 states.
[2020-10-16 01:27:54,887 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states.
[2020-10-16 01:27:54,887 INFO  L81            ComplementDD]: Finished complementDD. Result 4 states.
[2020-10-16 01:27:54,887 INFO  L185             Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 3 states and 538 transitions.
[2020-10-16 01:27:54,887 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 26 transitions, 70 flow
[2020-10-16 01:27:54,888 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 26 transitions, 66 flow, removed 0 selfloop flow, removed 2 redundant places.
[2020-10-16 01:27:54,888 INFO  L241             Difference]: Finished difference. Result has 38 places, 26 transitions, 68 flow
[2020-10-16 01:27:54,889 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=38, PETRI_TRANSITIONS=26}
[2020-10-16 01:27:54,889 INFO  L342   CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places.
[2020-10-16 01:27:54,890 INFO  L481      AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 68 flow
[2020-10-16 01:27:54,890 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 01:27:54,890 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:27:54,890 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:27:54,890 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-16 01:27:54,890 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:27:54,891 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:27:54,891 INFO  L82        PathProgramCache]: Analyzing trace with hash 990818122, now seen corresponding path program 1 times
[2020-10-16 01:27:54,891 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:27:54,891 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581819532]
[2020-10-16 01:27:54,892 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:27:54,916 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:27:55,001 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:27:55,002 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581819532]
[2020-10-16 01:27:55,002 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:27:55,002 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 01:27:55,003 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362606280]
[2020-10-16 01:27:55,003 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 01:27:55,003 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:27:55,003 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 01:27:55,004 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2020-10-16 01:27:55,006 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 157 out of 201
[2020-10-16 01:27:55,007 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 68 flow. Second operand 5 states.
[2020-10-16 01:27:55,007 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:27:55,007 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 201
[2020-10-16 01:27:55,007 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:27:55,116 INFO  L129       PetriNetUnfolder]: 105/268 cut-off events.
[2020-10-16 01:27:55,116 INFO  L130       PetriNetUnfolder]: For 21/21 co-relation queries the response was YES.
[2020-10-16 01:27:55,118 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 504 conditions, 268 events. 105/268 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1390 event pairs, 48 based on Foata normal form. 10/269 useless extension candidates. Maximal degree in co-relation 494. Up to 105 conditions per place. 
[2020-10-16 01:27:55,120 INFO  L132   encePairwiseOnDemand]: 194/201 looper letters, 12 selfloop transitions, 11 changer transitions 0/40 dead transitions.
[2020-10-16 01:27:55,120 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 142 flow
[2020-10-16 01:27:55,121 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 01:27:55,121 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-10-16 01:27:55,123 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 809 transitions.
[2020-10-16 01:27:55,124 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8049751243781095
[2020-10-16 01:27:55,124 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 809 transitions.
[2020-10-16 01:27:55,124 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 809 transitions.
[2020-10-16 01:27:55,125 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:27:55,125 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 809 transitions.
[2020-10-16 01:27:55,127 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 6 states.
[2020-10-16 01:27:55,129 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states.
[2020-10-16 01:27:55,129 INFO  L81            ComplementDD]: Finished complementDD. Result 6 states.
[2020-10-16 01:27:55,129 INFO  L185             Difference]: Start difference. First operand has 38 places, 26 transitions, 68 flow. Second operand 5 states and 809 transitions.
[2020-10-16 01:27:55,130 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 142 flow
[2020-10-16 01:27:55,131 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 40 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places.
[2020-10-16 01:27:55,132 INFO  L241             Difference]: Finished difference. Result has 43 places, 35 transitions, 133 flow
[2020-10-16 01:27:55,132 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=133, PETRI_PLACES=43, PETRI_TRANSITIONS=35}
[2020-10-16 01:27:55,133 INFO  L342   CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places.
[2020-10-16 01:27:55,133 INFO  L481      AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 133 flow
[2020-10-16 01:27:55,133 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 01:27:55,133 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:27:55,133 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:27:55,133 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-16 01:27:55,134 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:27:55,134 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:27:55,134 INFO  L82        PathProgramCache]: Analyzing trace with hash 2080844396, now seen corresponding path program 1 times
[2020-10-16 01:27:55,134 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:27:55,135 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106930265]
[2020-10-16 01:27:55,135 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:27:55,159 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:27:55,244 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:27:55,245 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106930265]
[2020-10-16 01:27:55,245 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:27:55,245 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 01:27:55,246 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321884210]
[2020-10-16 01:27:55,246 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 01:27:55,246 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:27:55,247 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 01:27:55,247 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 01:27:55,249 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 159 out of 201
[2020-10-16 01:27:55,250 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 133 flow. Second operand 5 states.
[2020-10-16 01:27:55,250 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:27:55,250 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 201
[2020-10-16 01:27:55,250 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:27:55,367 INFO  L129       PetriNetUnfolder]: 52/172 cut-off events.
[2020-10-16 01:27:55,367 INFO  L130       PetriNetUnfolder]: For 117/141 co-relation queries the response was YES.
[2020-10-16 01:27:55,370 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 416 conditions, 172 events. 52/172 cut-off events. For 117/141 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 788 event pairs, 26 based on Foata normal form. 8/177 useless extension candidates. Maximal degree in co-relation 403. Up to 82 conditions per place. 
[2020-10-16 01:27:55,371 INFO  L132   encePairwiseOnDemand]: 196/201 looper letters, 10 selfloop transitions, 7 changer transitions 0/41 dead transitions.
[2020-10-16 01:27:55,372 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 41 transitions, 191 flow
[2020-10-16 01:27:55,373 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 01:27:55,373 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-10-16 01:27:55,374 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 650 transitions.
[2020-10-16 01:27:55,375 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8084577114427861
[2020-10-16 01:27:55,375 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 650 transitions.
[2020-10-16 01:27:55,375 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 650 transitions.
[2020-10-16 01:27:55,376 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:27:55,376 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 650 transitions.
[2020-10-16 01:27:55,378 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 5 states.
[2020-10-16 01:27:55,380 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states.
[2020-10-16 01:27:55,380 INFO  L81            ComplementDD]: Finished complementDD. Result 5 states.
[2020-10-16 01:27:55,380 INFO  L185             Difference]: Start difference. First operand has 43 places, 35 transitions, 133 flow. Second operand 4 states and 650 transitions.
[2020-10-16 01:27:55,380 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 41 transitions, 191 flow
[2020-10-16 01:27:55,383 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 41 transitions, 191 flow, removed 0 selfloop flow, removed 0 redundant places.
[2020-10-16 01:27:55,384 INFO  L241             Difference]: Finished difference. Result has 48 places, 39 transitions, 176 flow
[2020-10-16 01:27:55,384 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=48, PETRI_TRANSITIONS=39}
[2020-10-16 01:27:55,385 INFO  L342   CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places.
[2020-10-16 01:27:55,385 INFO  L481      AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 176 flow
[2020-10-16 01:27:55,385 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 01:27:55,385 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:27:55,385 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:27:55,385 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-16 01:27:55,386 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:27:55,386 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:27:55,386 INFO  L82        PathProgramCache]: Analyzing trace with hash -7580004, now seen corresponding path program 1 times
[2020-10-16 01:27:55,386 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:27:55,387 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849184681]
[2020-10-16 01:27:55,387 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:27:55,427 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:27:55,522 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:27:55,523 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849184681]
[2020-10-16 01:27:55,523 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:27:55,523 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 01:27:55,524 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071285481]
[2020-10-16 01:27:55,524 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 01:27:55,524 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:27:55,524 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 01:27:55,524 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-16 01:27:55,527 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 158 out of 201
[2020-10-16 01:27:55,527 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 176 flow. Second operand 6 states.
[2020-10-16 01:27:55,527 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:27:55,528 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 201
[2020-10-16 01:27:55,528 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:27:55,783 INFO  L129       PetriNetUnfolder]: 50/176 cut-off events.
[2020-10-16 01:27:55,784 INFO  L130       PetriNetUnfolder]: For 232/260 co-relation queries the response was YES.
[2020-10-16 01:27:55,785 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 501 conditions, 176 events. 50/176 cut-off events. For 232/260 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 869 event pairs, 2 based on Foata normal form. 12/185 useless extension candidates. Maximal degree in co-relation 484. Up to 54 conditions per place. 
[2020-10-16 01:27:55,787 INFO  L132   encePairwiseOnDemand]: 195/201 looper letters, 11 selfloop transitions, 13 changer transitions 0/48 dead transitions.
[2020-10-16 01:27:55,787 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 48 transitions, 270 flow
[2020-10-16 01:27:55,788 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 01:27:55,788 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2020-10-16 01:27:55,791 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 968 transitions.
[2020-10-16 01:27:55,792 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.802653399668325
[2020-10-16 01:27:55,792 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 968 transitions.
[2020-10-16 01:27:55,792 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 968 transitions.
[2020-10-16 01:27:55,793 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:27:55,793 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 968 transitions.
[2020-10-16 01:27:55,796 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 7 states.
[2020-10-16 01:27:55,798 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states.
[2020-10-16 01:27:55,798 INFO  L81            ComplementDD]: Finished complementDD. Result 7 states.
[2020-10-16 01:27:55,798 INFO  L185             Difference]: Start difference. First operand has 48 places, 39 transitions, 176 flow. Second operand 6 states and 968 transitions.
[2020-10-16 01:27:55,798 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 48 transitions, 270 flow
[2020-10-16 01:27:55,800 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 48 transitions, 270 flow, removed 0 selfloop flow, removed 0 redundant places.
[2020-10-16 01:27:55,802 INFO  L241             Difference]: Finished difference. Result has 55 places, 44 transitions, 243 flow
[2020-10-16 01:27:55,802 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=243, PETRI_PLACES=55, PETRI_TRANSITIONS=44}
[2020-10-16 01:27:55,802 INFO  L342   CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places.
[2020-10-16 01:27:55,802 INFO  L481      AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 243 flow
[2020-10-16 01:27:55,803 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 01:27:55,803 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:27:55,803 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:27:55,803 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-16 01:27:55,803 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:27:55,803 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:27:55,804 INFO  L82        PathProgramCache]: Analyzing trace with hash 1348041785, now seen corresponding path program 1 times
[2020-10-16 01:27:55,804 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:27:55,804 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653740602]
[2020-10-16 01:27:55,804 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:27:55,825 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:27:55,962 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:27:55,962 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653740602]
[2020-10-16 01:27:55,962 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:27:55,962 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 01:27:55,963 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430446992]
[2020-10-16 01:27:55,963 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 01:27:55,963 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:27:55,963 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 01:27:55,964 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-16 01:27:55,966 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 154 out of 201
[2020-10-16 01:27:55,967 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 243 flow. Second operand 6 states.
[2020-10-16 01:27:55,967 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:27:55,967 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 201
[2020-10-16 01:27:55,967 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:27:56,147 INFO  L129       PetriNetUnfolder]: 58/204 cut-off events.
[2020-10-16 01:27:56,148 INFO  L130       PetriNetUnfolder]: For 506/543 co-relation queries the response was YES.
[2020-10-16 01:27:56,149 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 699 conditions, 204 events. 58/204 cut-off events. For 506/543 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 2 based on Foata normal form. 10/211 useless extension candidates. Maximal degree in co-relation 678. Up to 85 conditions per place. 
[2020-10-16 01:27:56,151 INFO  L132   encePairwiseOnDemand]: 194/201 looper letters, 17 selfloop transitions, 11 changer transitions 0/52 dead transitions.
[2020-10-16 01:27:56,151 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 52 transitions, 352 flow
[2020-10-16 01:27:56,152 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 01:27:56,152 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-10-16 01:27:56,155 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 787 transitions.
[2020-10-16 01:27:56,155 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7830845771144279
[2020-10-16 01:27:56,155 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 787 transitions.
[2020-10-16 01:27:56,156 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 787 transitions.
[2020-10-16 01:27:56,156 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:27:56,157 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 787 transitions.
[2020-10-16 01:27:56,158 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 6 states.
[2020-10-16 01:27:56,162 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states.
[2020-10-16 01:27:56,162 INFO  L81            ComplementDD]: Finished complementDD. Result 6 states.
[2020-10-16 01:27:56,162 INFO  L185             Difference]: Start difference. First operand has 55 places, 44 transitions, 243 flow. Second operand 5 states and 787 transitions.
[2020-10-16 01:27:56,162 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 52 transitions, 352 flow
[2020-10-16 01:27:56,169 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 52 transitions, 344 flow, removed 4 selfloop flow, removed 0 redundant places.
[2020-10-16 01:27:56,171 INFO  L241             Difference]: Finished difference. Result has 61 places, 49 transitions, 310 flow
[2020-10-16 01:27:56,171 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=310, PETRI_PLACES=61, PETRI_TRANSITIONS=49}
[2020-10-16 01:27:56,171 INFO  L342   CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places.
[2020-10-16 01:27:56,172 INFO  L481      AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 310 flow
[2020-10-16 01:27:56,172 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 01:27:56,172 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:27:56,172 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:27:56,172 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-16 01:27:56,172 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:27:56,173 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:27:56,173 INFO  L82        PathProgramCache]: Analyzing trace with hash -932065179, now seen corresponding path program 2 times
[2020-10-16 01:27:56,173 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:27:56,173 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231963412]
[2020-10-16 01:27:56,173 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:27:56,202 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:27:56,352 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:27:56,352 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231963412]
[2020-10-16 01:27:56,353 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:27:56,353 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 01:27:56,353 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692008040]
[2020-10-16 01:27:56,353 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 01:27:56,354 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:27:56,354 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 01:27:56,354 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2020-10-16 01:27:56,357 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 152 out of 201
[2020-10-16 01:27:56,358 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 310 flow. Second operand 7 states.
[2020-10-16 01:27:56,358 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:27:56,358 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 201
[2020-10-16 01:27:56,358 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:27:56,543 INFO  L129       PetriNetUnfolder]: 58/198 cut-off events.
[2020-10-16 01:27:56,543 INFO  L130       PetriNetUnfolder]: For 687/757 co-relation queries the response was YES.
[2020-10-16 01:27:56,545 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 755 conditions, 198 events. 58/198 cut-off events. For 687/757 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1030 event pairs, 0 based on Foata normal form. 18/214 useless extension candidates. Maximal degree in co-relation 730. Up to 55 conditions per place. 
[2020-10-16 01:27:56,547 INFO  L132   encePairwiseOnDemand]: 196/201 looper letters, 14 selfloop transitions, 14 changer transitions 0/52 dead transitions.
[2020-10-16 01:27:56,547 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 52 transitions, 390 flow
[2020-10-16 01:27:56,548 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 01:27:56,548 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-10-16 01:27:56,550 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 776 transitions.
[2020-10-16 01:27:56,551 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7721393034825871
[2020-10-16 01:27:56,551 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 776 transitions.
[2020-10-16 01:27:56,551 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 776 transitions.
[2020-10-16 01:27:56,552 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:27:56,552 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 776 transitions.
[2020-10-16 01:27:56,554 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 6 states.
[2020-10-16 01:27:56,556 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states.
[2020-10-16 01:27:56,556 INFO  L81            ComplementDD]: Finished complementDD. Result 6 states.
[2020-10-16 01:27:56,556 INFO  L185             Difference]: Start difference. First operand has 61 places, 49 transitions, 310 flow. Second operand 5 states and 776 transitions.
[2020-10-16 01:27:56,556 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 52 transitions, 390 flow
[2020-10-16 01:27:56,559 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 52 transitions, 375 flow, removed 4 selfloop flow, removed 1 redundant places.
[2020-10-16 01:27:56,560 INFO  L241             Difference]: Finished difference. Result has 65 places, 49 transitions, 337 flow
[2020-10-16 01:27:56,561 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=337, PETRI_PLACES=65, PETRI_TRANSITIONS=49}
[2020-10-16 01:27:56,561 INFO  L342   CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places.
[2020-10-16 01:27:56,561 INFO  L481      AbstractCegarLoop]: Abstraction has has 65 places, 49 transitions, 337 flow
[2020-10-16 01:27:56,561 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 01:27:56,561 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:27:56,562 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:27:56,562 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-16 01:27:56,562 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:27:56,562 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:27:56,562 INFO  L82        PathProgramCache]: Analyzing trace with hash 1371822505, now seen corresponding path program 1 times
[2020-10-16 01:27:56,563 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:27:56,563 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399714638]
[2020-10-16 01:27:56,563 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:27:56,593 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:27:56,621 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:27:56,621 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399714638]
[2020-10-16 01:27:56,621 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:27:56,621 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 01:27:56,622 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190630860]
[2020-10-16 01:27:56,622 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 01:27:56,622 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:27:56,623 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 01:27:56,623 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 01:27:56,624 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 169 out of 201
[2020-10-16 01:27:56,625 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 49 transitions, 337 flow. Second operand 4 states.
[2020-10-16 01:27:56,625 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:27:56,625 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 201
[2020-10-16 01:27:56,625 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:27:56,849 INFO  L129       PetriNetUnfolder]: 512/1012 cut-off events.
[2020-10-16 01:27:56,849 INFO  L130       PetriNetUnfolder]: For 2975/3388 co-relation queries the response was YES.
[2020-10-16 01:27:56,857 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 3084 conditions, 1012 events. 512/1012 cut-off events. For 2975/3388 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 7195 event pairs, 240 based on Foata normal form. 123/984 useless extension candidates. Maximal degree in co-relation 3057. Up to 598 conditions per place. 
[2020-10-16 01:27:56,865 INFO  L132   encePairwiseOnDemand]: 194/201 looper letters, 13 selfloop transitions, 10 changer transitions 0/62 dead transitions.
[2020-10-16 01:27:56,865 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 62 transitions, 409 flow
[2020-10-16 01:27:56,866 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 01:27:56,866 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-10-16 01:27:56,868 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 867 transitions.
[2020-10-16 01:27:56,869 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8626865671641791
[2020-10-16 01:27:56,869 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 867 transitions.
[2020-10-16 01:27:56,869 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 867 transitions.
[2020-10-16 01:27:56,870 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:27:56,870 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 867 transitions.
[2020-10-16 01:27:56,872 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 6 states.
[2020-10-16 01:27:56,874 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states.
[2020-10-16 01:27:56,874 INFO  L81            ComplementDD]: Finished complementDD. Result 6 states.
[2020-10-16 01:27:56,874 INFO  L185             Difference]: Start difference. First operand has 65 places, 49 transitions, 337 flow. Second operand 5 states and 867 transitions.
[2020-10-16 01:27:56,874 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 62 transitions, 409 flow
[2020-10-16 01:27:56,882 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 62 transitions, 356 flow, removed 6 selfloop flow, removed 6 redundant places.
[2020-10-16 01:27:56,883 INFO  L241             Difference]: Finished difference. Result has 66 places, 58 transitions, 371 flow
[2020-10-16 01:27:56,884 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=371, PETRI_PLACES=66, PETRI_TRANSITIONS=58}
[2020-10-16 01:27:56,884 INFO  L342   CegarLoopForPetriNet]: 41 programPoint places, 25 predicate places.
[2020-10-16 01:27:56,884 INFO  L481      AbstractCegarLoop]: Abstraction has has 66 places, 58 transitions, 371 flow
[2020-10-16 01:27:56,884 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 01:27:56,884 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:27:56,885 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:27:56,885 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-16 01:27:56,885 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:27:56,885 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:27:56,885 INFO  L82        PathProgramCache]: Analyzing trace with hash 1328558480, now seen corresponding path program 1 times
[2020-10-16 01:27:56,886 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:27:56,886 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050798683]
[2020-10-16 01:27:56,886 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:27:56,918 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:27:56,975 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:27:56,976 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050798683]
[2020-10-16 01:27:56,976 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:27:56,976 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 01:27:56,976 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57302869]
[2020-10-16 01:27:56,977 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 01:27:56,977 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:27:56,977 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 01:27:56,977 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 01:27:56,979 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 169 out of 201
[2020-10-16 01:27:56,980 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 58 transitions, 371 flow. Second operand 5 states.
[2020-10-16 01:27:56,980 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:27:56,981 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 201
[2020-10-16 01:27:56,981 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:27:57,204 INFO  L129       PetriNetUnfolder]: 378/805 cut-off events.
[2020-10-16 01:27:57,205 INFO  L130       PetriNetUnfolder]: For 3472/5817 co-relation queries the response was YES.
[2020-10-16 01:27:57,212 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 3275 conditions, 805 events. 378/805 cut-off events. For 3472/5817 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 5577 event pairs, 71 based on Foata normal form. 264/955 useless extension candidates. Maximal degree in co-relation 3248. Up to 557 conditions per place. 
[2020-10-16 01:27:57,219 INFO  L132   encePairwiseOnDemand]: 194/201 looper letters, 11 selfloop transitions, 19 changer transitions 0/69 dead transitions.
[2020-10-16 01:27:57,219 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 69 transitions, 487 flow
[2020-10-16 01:27:57,220 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 01:27:57,221 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-10-16 01:27:57,223 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1214 transitions.
[2020-10-16 01:27:57,224 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8628287135749823
[2020-10-16 01:27:57,224 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1214 transitions.
[2020-10-16 01:27:57,224 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1214 transitions.
[2020-10-16 01:27:57,225 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:27:57,226 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1214 transitions.
[2020-10-16 01:27:57,228 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 8 states.
[2020-10-16 01:27:57,231 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states.
[2020-10-16 01:27:57,231 INFO  L81            ComplementDD]: Finished complementDD. Result 8 states.
[2020-10-16 01:27:57,231 INFO  L185             Difference]: Start difference. First operand has 66 places, 58 transitions, 371 flow. Second operand 7 states and 1214 transitions.
[2020-10-16 01:27:57,231 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 69 transitions, 487 flow
[2020-10-16 01:27:57,238 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 69 transitions, 480 flow, removed 1 selfloop flow, removed 1 redundant places.
[2020-10-16 01:27:57,240 INFO  L241             Difference]: Finished difference. Result has 74 places, 65 transitions, 482 flow
[2020-10-16 01:27:57,240 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=482, PETRI_PLACES=74, PETRI_TRANSITIONS=65}
[2020-10-16 01:27:57,240 INFO  L342   CegarLoopForPetriNet]: 41 programPoint places, 33 predicate places.
[2020-10-16 01:27:57,241 INFO  L481      AbstractCegarLoop]: Abstraction has has 74 places, 65 transitions, 482 flow
[2020-10-16 01:27:57,241 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 01:27:57,241 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:27:57,241 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:27:57,241 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-16 01:27:57,241 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:27:57,242 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:27:57,242 INFO  L82        PathProgramCache]: Analyzing trace with hash -599861684, now seen corresponding path program 1 times
[2020-10-16 01:27:57,242 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:27:57,242 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411120782]
[2020-10-16 01:27:57,242 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:27:57,287 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:27:57,330 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:27:57,331 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411120782]
[2020-10-16 01:27:57,331 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:27:57,332 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 01:27:57,332 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480254368]
[2020-10-16 01:27:57,332 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 01:27:57,332 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:27:57,333 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 01:27:57,333 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 01:27:57,335 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 169 out of 201
[2020-10-16 01:27:57,336 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 65 transitions, 482 flow. Second operand 6 states.
[2020-10-16 01:27:57,337 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:27:57,337 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 201
[2020-10-16 01:27:57,337 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:27:57,603 INFO  L129       PetriNetUnfolder]: 277/620 cut-off events.
[2020-10-16 01:27:57,603 INFO  L130       PetriNetUnfolder]: For 4751/9076 co-relation queries the response was YES.
[2020-10-16 01:27:57,609 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 3404 conditions, 620 events. 277/620 cut-off events. For 4751/9076 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 4075 event pairs, 8 based on Foata normal form. 370/900 useless extension candidates. Maximal degree in co-relation 3373. Up to 496 conditions per place. 
[2020-10-16 01:27:57,614 INFO  L132   encePairwiseOnDemand]: 194/201 looper letters, 6 selfloop transitions, 28 changer transitions 4/75 dead transitions.
[2020-10-16 01:27:57,614 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 75 transitions, 658 flow
[2020-10-16 01:27:57,615 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-10-16 01:27:57,615 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-10-16 01:27:57,620 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1561 transitions.
[2020-10-16 01:27:57,621 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8629076838032061
[2020-10-16 01:27:57,621 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1561 transitions.
[2020-10-16 01:27:57,621 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1561 transitions.
[2020-10-16 01:27:57,623 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:27:57,623 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1561 transitions.
[2020-10-16 01:27:57,627 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 10 states.
[2020-10-16 01:27:57,632 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states.
[2020-10-16 01:27:57,633 INFO  L81            ComplementDD]: Finished complementDD. Result 10 states.
[2020-10-16 01:27:57,633 INFO  L185             Difference]: Start difference. First operand has 74 places, 65 transitions, 482 flow. Second operand 9 states and 1561 transitions.
[2020-10-16 01:27:57,633 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 75 transitions, 658 flow
[2020-10-16 01:27:57,650 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 75 transitions, 595 flow, removed 19 selfloop flow, removed 5 redundant places.
[2020-10-16 01:27:57,653 INFO  L241             Difference]: Finished difference. Result has 80 places, 71 transitions, 571 flow
[2020-10-16 01:27:57,657 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=571, PETRI_PLACES=80, PETRI_TRANSITIONS=71}
[2020-10-16 01:27:57,657 INFO  L342   CegarLoopForPetriNet]: 41 programPoint places, 39 predicate places.
[2020-10-16 01:27:57,657 INFO  L481      AbstractCegarLoop]: Abstraction has has 80 places, 71 transitions, 571 flow
[2020-10-16 01:27:57,657 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 01:27:57,657 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:27:57,657 INFO  L255   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]
[2020-10-16 01:27:57,658 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-16 01:27:57,658 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:27:57,658 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:27:57,658 INFO  L82        PathProgramCache]: Analyzing trace with hash -1485706564, now seen corresponding path program 1 times
[2020-10-16 01:27:57,658 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:27:57,659 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535482182]
[2020-10-16 01:27:57,659 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:27:57,700 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:27:57,778 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:27:57,778 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535482182]
[2020-10-16 01:27:57,779 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:27:57,779 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-10-16 01:27:57,779 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843366623]
[2020-10-16 01:27:57,779 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-10-16 01:27:57,780 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:27:57,780 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-10-16 01:27:57,780 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2020-10-16 01:27:57,782 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 158 out of 201
[2020-10-16 01:27:57,783 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 71 transitions, 571 flow. Second operand 9 states.
[2020-10-16 01:27:57,784 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:27:57,784 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 201
[2020-10-16 01:27:57,784 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:27:58,182 INFO  L129       PetriNetUnfolder]: 850/1730 cut-off events.
[2020-10-16 01:27:58,183 INFO  L130       PetriNetUnfolder]: For 11839/21329 co-relation queries the response was YES.
[2020-10-16 01:27:58,201 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 9229 conditions, 1730 events. 850/1730 cut-off events. For 11839/21329 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 13467 event pairs, 16 based on Foata normal form. 319/1807 useless extension candidates. Maximal degree in co-relation 9196. Up to 1015 conditions per place. 
[2020-10-16 01:27:58,214 INFO  L132   encePairwiseOnDemand]: 193/201 looper letters, 33 selfloop transitions, 41 changer transitions 5/114 dead transitions.
[2020-10-16 01:27:58,215 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 114 transitions, 1131 flow
[2020-10-16 01:27:58,215 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-10-16 01:27:58,215 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-10-16 01:27:58,219 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1466 transitions.
[2020-10-16 01:27:58,220 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.810392482034273
[2020-10-16 01:27:58,220 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1466 transitions.
[2020-10-16 01:27:58,220 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1466 transitions.
[2020-10-16 01:27:58,221 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:27:58,221 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1466 transitions.
[2020-10-16 01:27:58,224 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 10 states.
[2020-10-16 01:27:58,228 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states.
[2020-10-16 01:27:58,228 INFO  L81            ComplementDD]: Finished complementDD. Result 10 states.
[2020-10-16 01:27:58,228 INFO  L185             Difference]: Start difference. First operand has 80 places, 71 transitions, 571 flow. Second operand 9 states and 1466 transitions.
[2020-10-16 01:27:58,228 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 114 transitions, 1131 flow
[2020-10-16 01:27:58,542 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 114 transitions, 924 flow, removed 68 selfloop flow, removed 4 redundant places.
[2020-10-16 01:27:58,545 INFO  L241             Difference]: Finished difference. Result has 90 places, 103 transitions, 864 flow
[2020-10-16 01:27:58,545 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=864, PETRI_PLACES=90, PETRI_TRANSITIONS=103}
[2020-10-16 01:27:58,546 INFO  L342   CegarLoopForPetriNet]: 41 programPoint places, 49 predicate places.
[2020-10-16 01:27:58,546 INFO  L481      AbstractCegarLoop]: Abstraction has has 90 places, 103 transitions, 864 flow
[2020-10-16 01:27:58,546 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-10-16 01:27:58,546 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:27:58,546 INFO  L255   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]
[2020-10-16 01:27:58,546 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-16 01:27:58,546 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:27:58,547 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:27:58,547 INFO  L82        PathProgramCache]: Analyzing trace with hash -1268595774, now seen corresponding path program 2 times
[2020-10-16 01:27:58,547 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:27:58,547 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157843210]
[2020-10-16 01:27:58,547 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:27:58,567 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:27:58,603 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:27:58,603 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157843210]
[2020-10-16 01:27:58,603 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:27:58,604 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 01:27:58,604 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360331370]
[2020-10-16 01:27:58,605 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 01:27:58,605 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:27:58,605 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 01:27:58,605 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 01:27:58,608 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 173 out of 201
[2020-10-16 01:27:58,609 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 103 transitions, 864 flow. Second operand 4 states.
[2020-10-16 01:27:58,609 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:27:58,609 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 201
[2020-10-16 01:27:58,609 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:27:59,068 INFO  L129       PetriNetUnfolder]: 1152/2617 cut-off events.
[2020-10-16 01:27:59,069 INFO  L130       PetriNetUnfolder]: For 14796/17803 co-relation queries the response was YES.
[2020-10-16 01:27:59,104 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 12178 conditions, 2617 events. 1152/2617 cut-off events. For 14796/17803 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 24108 event pairs, 71 based on Foata normal form. 45/2382 useless extension candidates. Maximal degree in co-relation 12138. Up to 835 conditions per place. 
[2020-10-16 01:27:59,122 INFO  L132   encePairwiseOnDemand]: 198/201 looper letters, 4 selfloop transitions, 2 changer transitions 0/105 dead transitions.
[2020-10-16 01:27:59,122 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 105 transitions, 890 flow
[2020-10-16 01:27:59,123 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 01:27:59,123 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-10-16 01:27:59,125 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 699 transitions.
[2020-10-16 01:27:59,125 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8694029850746269
[2020-10-16 01:27:59,126 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 699 transitions.
[2020-10-16 01:27:59,126 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 699 transitions.
[2020-10-16 01:27:59,126 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:27:59,127 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 699 transitions.
[2020-10-16 01:27:59,128 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 5 states.
[2020-10-16 01:27:59,130 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states.
[2020-10-16 01:27:59,130 INFO  L81            ComplementDD]: Finished complementDD. Result 5 states.
[2020-10-16 01:27:59,130 INFO  L185             Difference]: Start difference. First operand has 90 places, 103 transitions, 864 flow. Second operand 4 states and 699 transitions.
[2020-10-16 01:27:59,130 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 105 transitions, 890 flow
[2020-10-16 01:27:59,475 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 105 transitions, 871 flow, removed 2 selfloop flow, removed 2 redundant places.
[2020-10-16 01:27:59,477 INFO  L241             Difference]: Finished difference. Result has 92 places, 104 transitions, 860 flow
[2020-10-16 01:27:59,477 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=847, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=860, PETRI_PLACES=92, PETRI_TRANSITIONS=104}
[2020-10-16 01:27:59,477 INFO  L342   CegarLoopForPetriNet]: 41 programPoint places, 51 predicate places.
[2020-10-16 01:27:59,478 INFO  L481      AbstractCegarLoop]: Abstraction has has 92 places, 104 transitions, 860 flow
[2020-10-16 01:27:59,478 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 01:27:59,478 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:27:59,478 INFO  L255   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]
[2020-10-16 01:27:59,478 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-16 01:27:59,478 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:27:59,478 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:27:59,479 INFO  L82        PathProgramCache]: Analyzing trace with hash 4966590, now seen corresponding path program 3 times
[2020-10-16 01:27:59,479 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:27:59,479 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160380714]
[2020-10-16 01:27:59,479 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:27:59,495 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:27:59,558 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:27:59,559 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160380714]
[2020-10-16 01:27:59,559 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:27:59,559 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 01:27:59,559 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618646545]
[2020-10-16 01:27:59,560 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 01:27:59,560 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:27:59,560 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 01:27:59,561 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2020-10-16 01:27:59,562 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 159 out of 201
[2020-10-16 01:27:59,563 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 104 transitions, 860 flow. Second operand 6 states.
[2020-10-16 01:27:59,563 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:27:59,563 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 201
[2020-10-16 01:27:59,563 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:28:00,745 INFO  L129       PetriNetUnfolder]: 2542/5891 cut-off events.
[2020-10-16 01:28:00,745 INFO  L130       PetriNetUnfolder]: For 38152/43038 co-relation queries the response was YES.
[2020-10-16 01:28:00,805 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 27714 conditions, 5891 events. 2542/5891 cut-off events. For 38152/43038 co-relation queries the response was YES. Maximal size of possible extension queue 1147. Compared 62380 event pairs, 39 based on Foata normal form. 230/5585 useless extension candidates. Maximal degree in co-relation 27673. Up to 1897 conditions per place. 
[2020-10-16 01:28:00,831 INFO  L132   encePairwiseOnDemand]: 196/201 looper letters, 14 selfloop transitions, 9 changer transitions 0/116 dead transitions.
[2020-10-16 01:28:00,831 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 116 transitions, 1042 flow
[2020-10-16 01:28:00,832 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 01:28:00,832 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2020-10-16 01:28:00,835 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 969 transitions.
[2020-10-16 01:28:00,835 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8034825870646766
[2020-10-16 01:28:00,835 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 969 transitions.
[2020-10-16 01:28:00,835 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 969 transitions.
[2020-10-16 01:28:00,836 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:28:00,836 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 969 transitions.
[2020-10-16 01:28:00,839 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 7 states.
[2020-10-16 01:28:00,841 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states.
[2020-10-16 01:28:00,841 INFO  L81            ComplementDD]: Finished complementDD. Result 7 states.
[2020-10-16 01:28:00,841 INFO  L185             Difference]: Start difference. First operand has 92 places, 104 transitions, 860 flow. Second operand 6 states and 969 transitions.
[2020-10-16 01:28:00,841 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 116 transitions, 1042 flow
[2020-10-16 01:28:02,043 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 116 transitions, 1041 flow, removed 0 selfloop flow, removed 1 redundant places.
[2020-10-16 01:28:02,045 INFO  L241             Difference]: Finished difference. Result has 99 places, 110 transitions, 953 flow
[2020-10-16 01:28:02,046 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=953, PETRI_PLACES=99, PETRI_TRANSITIONS=110}
[2020-10-16 01:28:02,046 INFO  L342   CegarLoopForPetriNet]: 41 programPoint places, 58 predicate places.
[2020-10-16 01:28:02,046 INFO  L481      AbstractCegarLoop]: Abstraction has has 99 places, 110 transitions, 953 flow
[2020-10-16 01:28:02,046 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 01:28:02,046 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:28:02,047 INFO  L255   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]
[2020-10-16 01:28:02,047 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-16 01:28:02,047 INFO  L429      AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:28:02,047 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:28:02,047 INFO  L82        PathProgramCache]: Analyzing trace with hash -1105661182, now seen corresponding path program 4 times
[2020-10-16 01:28:02,048 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:28:02,048 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356508797]
[2020-10-16 01:28:02,048 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:28:02,073 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:28:02,134 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:28:02,135 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356508797]
[2020-10-16 01:28:02,135 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:28:02,135 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-16 01:28:02,136 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868076519]
[2020-10-16 01:28:02,136 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 01:28:02,136 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:28:02,136 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 01:28:02,137 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-10-16 01:28:02,138 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 169 out of 201
[2020-10-16 01:28:02,139 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 110 transitions, 953 flow. Second operand 7 states.
[2020-10-16 01:28:02,139 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:28:02,139 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 201
[2020-10-16 01:28:02,139 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:28:03,471 INFO  L129       PetriNetUnfolder]: 2345/5467 cut-off events.
[2020-10-16 01:28:03,472 INFO  L130       PetriNetUnfolder]: For 39818/61140 co-relation queries the response was YES.
[2020-10-16 01:28:03,547 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 29454 conditions, 5467 events. 2345/5467 cut-off events. For 39818/61140 co-relation queries the response was YES. Maximal size of possible extension queue 1109. Compared 57921 event pairs, 68 based on Foata normal form. 3051/8092 useless extension candidates. Maximal degree in co-relation 29409. Up to 1873 conditions per place. 
[2020-10-16 01:28:03,558 INFO  L132   encePairwiseOnDemand]: 194/201 looper letters, 2 selfloop transitions, 55 changer transitions 29/115 dead transitions.
[2020-10-16 01:28:03,559 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 115 transitions, 1155 flow
[2020-10-16 01:28:03,559 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2020-10-16 01:28:03,560 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2020-10-16 01:28:03,563 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1900 transitions.
[2020-10-16 01:28:03,564 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8593396653098145
[2020-10-16 01:28:03,564 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1900 transitions.
[2020-10-16 01:28:03,565 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1900 transitions.
[2020-10-16 01:28:03,566 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:28:03,566 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1900 transitions.
[2020-10-16 01:28:03,569 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 12 states.
[2020-10-16 01:28:03,573 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states.
[2020-10-16 01:28:03,574 INFO  L81            ComplementDD]: Finished complementDD. Result 12 states.
[2020-10-16 01:28:03,574 INFO  L185             Difference]: Start difference. First operand has 99 places, 110 transitions, 953 flow. Second operand 11 states and 1900 transitions.
[2020-10-16 01:28:03,574 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 115 transitions, 1155 flow
[2020-10-16 01:28:04,902 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 115 transitions, 1122 flow, removed 6 selfloop flow, removed 4 redundant places.
[2020-10-16 01:28:04,905 INFO  L241             Difference]: Finished difference. Result has 108 places, 86 transitions, 842 flow
[2020-10-16 01:28:04,905 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=920, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=842, PETRI_PLACES=108, PETRI_TRANSITIONS=86}
[2020-10-16 01:28:04,906 INFO  L342   CegarLoopForPetriNet]: 41 programPoint places, 67 predicate places.
[2020-10-16 01:28:04,906 INFO  L481      AbstractCegarLoop]: Abstraction has has 108 places, 86 transitions, 842 flow
[2020-10-16 01:28:04,906 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 01:28:04,906 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:28:04,906 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:28:04,906 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-10-16 01:28:04,907 INFO  L429      AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:28:04,907 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:28:04,907 INFO  L82        PathProgramCache]: Analyzing trace with hash 1971461444, now seen corresponding path program 1 times
[2020-10-16 01:28:04,907 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:28:04,907 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947154424]
[2020-10-16 01:28:04,908 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:28:04,939 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 01:28:04,939 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 01:28:04,972 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 01:28:04,973 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 01:28:05,011 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-16 01:28:05,011 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-16 01:28:05,012 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2020-10-16 01:28:05,013 WARN  L264   etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available.
[2020-10-16 01:28:05,027 WARN  L124   codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L846-->L853: Formula: (let ((.cse6 (= (mod ~z$r_buff1_thd0~0_In415832768 256) 0)) (.cse7 (= (mod ~z$w_buff1_used~0_In415832768 256) 0)) (.cse9 (= (mod ~z$r_buff0_thd0~0_In415832768 256) 0)) (.cse8 (= (mod ~z$w_buff0_used~0_In415832768 256) 0))) (let ((.cse0 (or .cse9 .cse8)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse4 (not .cse7)) (.cse5 (not .cse6)) (.cse3 (or .cse6 .cse7))) (and (or (and .cse0 (= ~z$w_buff0_used~0_Out415832768 ~z$w_buff0_used~0_In415832768)) (and .cse1 .cse2 (= ~z$w_buff0_used~0_Out415832768 0))) (= ~z$r_buff0_thd0~0_Out415832768 ~z$r_buff0_thd0~0_In415832768) (= ~z$r_buff1_thd0~0_Out415832768 ~z$r_buff1_thd0~0_In415832768) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out415832768 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In415832768| ULTIMATE.start_assume_abort_if_not_~cond_Out415832768) (or (and .cse0 (or (and (= ~z~0_Out415832768 ~z~0_In415832768) .cse3) (and .cse4 (= ~z~0_Out415832768 ~z$w_buff1~0_In415832768) .cse5))) (and .cse1 (= ~z~0_Out415832768 ~z$w_buff0~0_In415832768) .cse2)) (or (and .cse4 (= ~z$w_buff1_used~0_Out415832768 0) .cse5) (and (= ~z$w_buff1_used~0_Out415832768 ~z$w_buff1_used~0_In415832768) .cse3)))))  InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In415832768|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In415832768, ~z$w_buff0_used~0=~z$w_buff0_used~0_In415832768, ~z$w_buff0~0=~z$w_buff0~0_In415832768, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In415832768, ~z$w_buff1_used~0=~z$w_buff1_used~0_In415832768, ~z$w_buff1~0=~z$w_buff1~0_In415832768, ~z~0=~z~0_In415832768}  OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out415832768, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out415832768|, ~z$w_buff0~0=~z$w_buff0~0_In415832768, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out415832768|, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out415832768, ~z$w_buff1~0=~z$w_buff1~0_In415832768, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out415832768|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out415832768|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out415832768|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out415832768|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In415832768|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out415832768, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out415832768, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out415832768, ~z~0=~z~0_Out415832768}  AuxVars[]  AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23] because there is no mapped edge
[2020-10-16 01:28:05,034 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:05,034 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:05,036 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:05,036 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:05,036 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:05,037 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:05,037 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:05,037 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:05,037 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:05,037 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:05,037 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:05,037 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:05,038 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:05,038 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:05,038 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:05,038 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:05,039 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:05,039 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:05,039 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:05,039 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:05,039 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:05,039 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:05,040 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:05,040 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:05,040 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:05,040 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:05,041 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:05,041 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:05,041 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:05,041 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:05,041 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:05,041 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:05,042 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:05,042 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:05,042 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:05,042 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:05,042 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:05,042 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:05,043 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:05,043 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:05,043 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:05,043 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:05,043 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:05,043 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:05,044 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:05,044 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:05,134 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:28:05 BasicIcfg
[2020-10-16 01:28:05,134 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-16 01:28:05,136 INFO  L168              Benchmark]: Toolchain (without parser) took 24633.36 ms. Allocated memory was 253.2 MB in the beginning and 852.5 MB in the end (delta: 599.3 MB). Free memory was 208.0 MB in the beginning and 640.5 MB in the end (delta: -432.5 MB). Peak memory consumption was 166.7 MB. Max. memory is 14.2 GB.
[2020-10-16 01:28:05,136 INFO  L168              Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 253.2 MB. Free memory is still 229.6 MB. There was no memory consumed. Max. memory is 14.2 GB.
[2020-10-16 01:28:05,137 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 727.77 ms. Allocated memory was 253.2 MB in the beginning and 319.8 MB in the end (delta: 66.6 MB). Free memory was 208.0 MB in the beginning and 270.6 MB in the end (delta: -62.6 MB). Peak memory consumption was 29.7 MB. Max. memory is 14.2 GB.
[2020-10-16 01:28:05,138 INFO  L168              Benchmark]: Boogie Procedure Inliner took 68.82 ms. Allocated memory is still 319.8 MB. Free memory was 268.0 MB in the beginning and 265.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
[2020-10-16 01:28:05,139 INFO  L168              Benchmark]: Boogie Preprocessor took 41.59 ms. Allocated memory is still 319.8 MB. Free memory was 265.5 MB in the beginning and 263.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
[2020-10-16 01:28:05,140 INFO  L168              Benchmark]: RCFGBuilder took 2006.79 ms. Allocated memory was 319.8 MB in the beginning and 361.8 MB in the end (delta: 41.9 MB). Free memory was 263.0 MB in the beginning and 206.7 MB in the end (delta: 56.3 MB). Peak memory consumption was 98.3 MB. Max. memory is 14.2 GB.
[2020-10-16 01:28:05,140 INFO  L168              Benchmark]: TraceAbstraction took 21782.84 ms. Allocated memory was 361.8 MB in the beginning and 852.5 MB in the end (delta: 490.7 MB). Free memory was 206.7 MB in the beginning and 640.5 MB in the end (delta: -433.8 MB). Peak memory consumption was 56.9 MB. Max. memory is 14.2 GB.
[2020-10-16 01:28:05,145 INFO  L336   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.42 ms. Allocated memory is still 253.2 MB. Free memory is still 229.6 MB. There was no memory consumed. Max. memory is 14.2 GB.
 * CACSL2BoogieTranslator took 727.77 ms. Allocated memory was 253.2 MB in the beginning and 319.8 MB in the end (delta: 66.6 MB). Free memory was 208.0 MB in the beginning and 270.6 MB in the end (delta: -62.6 MB). Peak memory consumption was 29.7 MB. Max. memory is 14.2 GB.
 * Boogie Procedure Inliner took 68.82 ms. Allocated memory is still 319.8 MB. Free memory was 268.0 MB in the beginning and 265.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * Boogie Preprocessor took 41.59 ms. Allocated memory is still 319.8 MB. Free memory was 265.5 MB in the beginning and 263.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * RCFGBuilder took 2006.79 ms. Allocated memory was 319.8 MB in the beginning and 361.8 MB in the end (delta: 41.9 MB). Free memory was 263.0 MB in the beginning and 206.7 MB in the end (delta: 56.3 MB). Peak memory consumption was 98.3 MB. Max. memory is 14.2 GB.
 * TraceAbstraction took 21782.84 ms. Allocated memory was 361.8 MB in the beginning and 852.5 MB in the end (delta: 490.7 MB). Free memory was 206.7 MB in the beginning and 640.5 MB in the end (delta: -433.8 MB). Peak memory consumption was 56.9 MB. Max. memory is 14.2 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    1709 VarBasedMoverChecksPositive, 80 VarBasedMoverChecksNegative, 16 SemBasedMoverChecksPositive, 64 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 219 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.6s, 119 PlacesBefore, 41 PlacesAfterwards, 108 TransitionsBefore, 28 TransitionsAfterwards, 2540 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 89 TotalNumberOfCompositions, 6449 MoverChecksTotal
  - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L699]               0  int __unbuffered_cnt = 0;
[L701]               0  int __unbuffered_p0_EAX = 0;
[L703]               0  int __unbuffered_p3_EAX = 0;
[L705]               0  int __unbuffered_p3_EBX = 0;
[L707]               0  int a = 0;
[L709]               0  int b = 0;
[L710]               0  _Bool main$tmp_guard0;
[L711]               0  _Bool main$tmp_guard1;
[L713]               0  int x = 0;
[L715]               0  int y = 0;
[L717]               0  int z = 0;
[L718]               0  _Bool z$flush_delayed;
[L719]               0  int z$mem_tmp;
[L720]               0  _Bool z$r_buff0_thd0;
[L721]               0  _Bool z$r_buff0_thd1;
[L722]               0  _Bool z$r_buff0_thd2;
[L723]               0  _Bool z$r_buff0_thd3;
[L724]               0  _Bool z$r_buff0_thd4;
[L725]               0  _Bool z$r_buff1_thd0;
[L726]               0  _Bool z$r_buff1_thd1;
[L727]               0  _Bool z$r_buff1_thd2;
[L728]               0  _Bool z$r_buff1_thd3;
[L729]               0  _Bool z$r_buff1_thd4;
[L730]               0  _Bool z$read_delayed;
[L731]               0  int *z$read_delayed_var;
[L732]               0  int z$w_buff0;
[L733]               0  _Bool z$w_buff0_used;
[L734]               0  int z$w_buff1;
[L735]               0  _Bool z$w_buff1_used;
[L736]               0  _Bool weak$$choice0;
[L737]               0  _Bool weak$$choice2;
[L835]               0  pthread_t t1229;
[L836]  FCALL, FORK  0  pthread_create(&t1229, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L837]               0  pthread_t t1230;
[L838]  FCALL, FORK  0  pthread_create(&t1230, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L839]               0  pthread_t t1231;
[L840]  FCALL, FORK  0  pthread_create(&t1231, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L841]               0  pthread_t t1232;
[L842]  FCALL, FORK  0  pthread_create(&t1232, ((void *)0), P3, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L791]               4  z$w_buff1 = z$w_buff0
[L792]               4  z$w_buff0 = 2
[L793]               4  z$w_buff1_used = z$w_buff0_used
[L794]               4  z$w_buff0_used = (_Bool)1
[L7]    COND FALSE   4  !(!expression)
[L796]               4  z$r_buff1_thd0 = z$r_buff0_thd0
[L797]               4  z$r_buff1_thd1 = z$r_buff0_thd1
[L798]               4  z$r_buff1_thd2 = z$r_buff0_thd2
[L799]               4  z$r_buff1_thd3 = z$r_buff0_thd3
[L800]               4  z$r_buff1_thd4 = z$r_buff0_thd4
[L801]               4  z$r_buff0_thd4 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L804]               4  a = 1
[L807]               4  __unbuffered_p3_EAX = a
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L810]               4  __unbuffered_p3_EBX = b
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L741]               1  b = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L744]               1  __unbuffered_p0_EAX = x
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L756]               2  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L759]               2  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L771]               3  y = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L764]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L766]               2  return 0;
[L749]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L751]               1  return 0;
[L774]               3  z = 1
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L777]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L777]  EXPR         3  z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z
[L777]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L777]               3  z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L778]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L778]               3  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L779]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L779]               3  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L780]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L780]               3  z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L781]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L781]               3  z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L784]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L786]               3  return 0;
[L813]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L813]  EXPR         4  z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z
[L813]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L813]               4  z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L814]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L814]               4  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L815]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used
[L815]               4  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used
[L816]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L816]               4  z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L817]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4
[L817]               4  z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4
[L820]               4  __unbuffered_cnt = __unbuffered_cnt + 1
[L822]               4  return 0;
[L844]               0  main$tmp_guard0 = __unbuffered_cnt == 4
[L855]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L856]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L857]               0  z$flush_delayed = weak$$choice2
[L858]               0  z$mem_tmp = z
[L859]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1)
[L859]               0  z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1)
[L860]  EXPR         0  weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L860]               0  z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L861]  EXPR         0  weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L861]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)
[L861]  EXPR         0  weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L861]               0  z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L862]  EXPR         0  weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L862]               0  z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L863]  EXPR         0  weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L863]               0  z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L864]  EXPR         0  weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L864]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)
[L864]  EXPR         0  weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L864]               0  z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L865]  EXPR         0  weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L865]               0  z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L866]               0  main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0)
[L867]  EXPR         0  z$flush_delayed ? z$mem_tmp : z
[L867]               0  z = z$flush_delayed ? z$mem_tmp : z
[L868]               0  z$flush_delayed = (_Bool)0
[L7]    COND TRUE    0  !expression
[L7]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 5 procedures, 111 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 21.5s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.7s, HoareTripleCheckerStatistics: 53 SDtfs, 51 SDslu, 35 SDs, 0 SdLazy, 422 SolverSat, 149 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=953occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 265 NumberOfCodeBlocks, 265 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 225 ConstructedInterpolants, 0 QuantifiedInterpolants, 23794 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...