/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/safe011_rmo.oepc.i


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


This is Ultimate 0.1.25-7bb8cbd
[2020-10-16 01:39:04,244 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-16 01:39:04,247 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-16 01:39:04,282 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-16 01:39:04,282 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-16 01:39:04,290 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-16 01:39:04,293 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-16 01:39:04,296 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-16 01:39:04,298 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-16 01:39:04,301 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-16 01:39:04,302 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-16 01:39:04,303 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-16 01:39:04,303 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-16 01:39:04,305 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-16 01:39:04,307 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-16 01:39:04,309 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-16 01:39:04,310 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-16 01:39:04,311 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-16 01:39:04,313 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-16 01:39:04,321 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-16 01:39:04,323 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-16 01:39:04,323 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-16 01:39:04,324 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-16 01:39:04,325 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-16 01:39:04,338 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-16 01:39:04,338 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-16 01:39:04,339 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-16 01:39:04,341 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-16 01:39:04,342 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-16 01:39:04,343 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-16 01:39:04,343 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-16 01:39:04,347 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-16 01:39:04,347 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-16 01:39:04,348 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-16 01:39:04,349 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-16 01:39:04,349 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-16 01:39:04,350 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-16 01:39:04,350 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-16 01:39:04,350 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-16 01:39:04,350 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-16 01:39:04,354 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-16 01:39:04,355 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:39:04,375 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-16 01:39:04,376 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-16 01:39:04,377 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-16 01:39:04,377 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-16 01:39:04,377 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-16 01:39:04,377 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-16 01:39:04,378 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-16 01:39:04,378 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-16 01:39:04,378 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-16 01:39:04,378 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-16 01:39:04,378 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-16 01:39:04,379 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-16 01:39:04,379 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-16 01:39:04,379 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-16 01:39:04,379 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-16 01:39:04,379 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-16 01:39:04,380 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-16 01:39:04,380 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-16 01:39:04,380 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-16 01:39:04,380 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-16 01:39:04,380 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-16 01:39:04,381 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 01:39:04,381 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-16 01:39:04,381 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-16 01:39:04,381 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-16 01:39:04,382 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-16 01:39:04,382 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-16 01:39:04,382 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2020-10-16 01:39:04,382 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-16 01:39:04,645 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-16 01:39:04,656 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-16 01:39:04,660 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-16 01:39:04,661 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-16 01:39:04,661 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-16 01:39:04,662 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_rmo.oepc.i
[2020-10-16 01:39:04,728 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7560cb2a5/0e281c5c4969440b8c99863899398d33/FLAG8c95fa7c4
[2020-10-16 01:39:05,245 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-16 01:39:05,246 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_rmo.oepc.i
[2020-10-16 01:39:05,264 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7560cb2a5/0e281c5c4969440b8c99863899398d33/FLAG8c95fa7c4
[2020-10-16 01:39:05,594 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7560cb2a5/0e281c5c4969440b8c99863899398d33
[2020-10-16 01:39:05,603 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-16 01:39:05,604 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-16 01:39:05,605 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-16 01:39:05,606 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-16 01:39:05,609 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-16 01:39:05,610 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:39:05" (1/1) ...
[2020-10-16 01:39:05,613 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@132a106a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:05, skipping insertion in model container
[2020-10-16 01:39:05,613 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:39:05" (1/1) ...
[2020-10-16 01:39:05,620 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-16 01:39:05,689 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-16 01:39:06,283 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 01:39:06,298 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-16 01:39:06,395 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 01:39:06,474 INFO  L208         MainTranslator]: Completed translation
[2020-10-16 01:39:06,474 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:06 WrapperNode
[2020-10-16 01:39:06,474 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-16 01:39:06,475 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-16 01:39:06,475 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-16 01:39:06,475 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-16 01:39:06,484 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:39:06" (1/1) ...
[2020-10-16 01:39:06,503 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:39:06" (1/1) ...
[2020-10-16 01:39:06,539 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-16 01:39:06,539 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-16 01:39:06,540 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-16 01:39:06,540 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-16 01:39:06,548 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:06" (1/1) ...
[2020-10-16 01:39:06,548 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:06" (1/1) ...
[2020-10-16 01:39:06,553 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:06" (1/1) ...
[2020-10-16 01:39:06,553 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:06" (1/1) ...
[2020-10-16 01:39:06,564 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:06" (1/1) ...
[2020-10-16 01:39:06,568 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:06" (1/1) ...
[2020-10-16 01:39:06,573 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:06" (1/1) ...
[2020-10-16 01:39:06,578 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-16 01:39:06,578 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-16 01:39:06,578 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-16 01:39:06,579 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-16 01:39:06,579 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:06" (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:39:06,648 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-16 01:39:06,648 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-16 01:39:06,649 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-16 01:39:06,649 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-16 01:39:06,649 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-16 01:39:06,649 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-16 01:39:06,650 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-16 01:39:06,650 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-16 01:39:06,650 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-16 01:39:06,650 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-16 01:39:06,651 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-16 01:39:06,651 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-16 01:39:06,651 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-16 01:39:06,654 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:39:08,511 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-16 01:39:08,511 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-16 01:39:08,513 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:39:08 BoogieIcfgContainer
[2020-10-16 01:39:08,513 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-16 01:39:08,515 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-16 01:39:08,515 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-16 01:39:08,518 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-16 01:39:08,518 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:39:05" (1/3) ...
[2020-10-16 01:39:08,519 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1525183d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:39:08, skipping insertion in model container
[2020-10-16 01:39:08,519 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:06" (2/3) ...
[2020-10-16 01:39:08,520 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1525183d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:39:08, skipping insertion in model container
[2020-10-16 01:39:08,520 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:39:08" (3/3) ...
[2020-10-16 01:39:08,522 INFO  L111   eAbstractionObserver]: Analyzing ICFG safe011_rmo.oepc.i
[2020-10-16 01:39:08,533 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-16 01:39:08,540 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-16 01:39:08,541 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-16 01:39:08,570 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,571 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,571 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,571 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,572 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,572 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,572 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,572 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,573 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,573 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,573 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,573 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,574 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,574 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,574 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,575 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,575 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,575 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,576 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,576 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,576 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,576 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,576 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,577 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,577 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,577 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,578 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,578 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,578 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,578 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,579 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,579 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,579 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,579 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,580 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,580 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,580 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,580 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,581 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,581 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,581 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,582 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,582 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,586 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,586 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,586 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,587 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,587 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,587 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,587 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,588 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,588 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,588 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,594 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,594 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,594 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,594 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,595 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,595 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,595 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,595 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,595 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,596 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,596 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,596 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,598 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,598 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,598 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,598 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,599 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,599 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,599 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,599 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,600 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,600 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:39:08,616 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2020-10-16 01:39:08,637 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-16 01:39:08,637 INFO  L378      AbstractCegarLoop]: Hoare is false
[2020-10-16 01:39:08,637 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-16 01:39:08,638 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-16 01:39:08,638 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-16 01:39:08,638 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-16 01:39:08,638 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-16 01:39:08,638 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-16 01:39:08,651 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow
[2020-10-16 01:39:08,697 INFO  L129       PetriNetUnfolder]: 2/89 cut-off events.
[2020-10-16 01:39:08,723 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 01:39:08,734 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. 
[2020-10-16 01:39:08,734 INFO  L82        GeneralOperation]: Start removeDead. Operand has 100 places, 92 transitions, 199 flow
[2020-10-16 01:39:08,740 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 97 places, 89 transitions, 187 flow
[2020-10-16 01:39:08,743 INFO  L129   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-16 01:39:08,746 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 89 transitions, 187 flow
[2020-10-16 01:39:08,750 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 89 transitions, 187 flow
[2020-10-16 01:39:08,751 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 97 places, 89 transitions, 187 flow
[2020-10-16 01:39:08,774 INFO  L129       PetriNetUnfolder]: 2/89 cut-off events.
[2020-10-16 01:39:08,774 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 01:39:08,775 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. 
[2020-10-16 01:39:08,778 INFO  L117        LiptonReduction]: Number of co-enabled transitions 1650
[2020-10-16 01:39:08,891 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 01:39:08,891 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:08,917 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-16 01:39:08,918 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:08,920 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 01:39:08,921 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:08,959 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-16 01:39:08,960 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:08,961 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 01:39:08,962 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:09,000 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:09,001 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:09,002 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:09,003 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:09,006 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:09,006 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:09,009 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:09,010 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:09,029 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:09,030 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:09,031 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:09,031 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:09,034 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:09,035 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:09,037 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:09,038 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:09,135 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:09,135 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:09,136 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:09,136 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:09,139 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:09,139 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:09,142 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:09,142 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:09,160 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:09,160 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:09,161 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:09,162 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:09,164 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:09,165 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:09,167 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:09,168 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:09,247 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:09,248 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:09,249 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:09,249 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:09,251 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:09,251 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:09,253 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:09,254 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:09,271 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:09,272 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:09,273 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:09,273 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:09,275 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:09,276 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:09,278 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:09,278 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:09,320 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-16 01:39:09,320 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:09,321 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 01:39:09,321 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:09,341 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-16 01:39:09,341 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:09,342 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 01:39:09,342 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:09,482 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:09,482 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:09,483 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:09,483 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:09,485 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:09,486 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:09,487 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:09,488 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:09,502 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:09,503 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:09,504 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:09,504 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:09,506 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:09,506 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:09,508 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:09,508 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:09,781 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-16 01:39:09,782 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:09,782 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 01:39:09,782 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:09,805 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-16 01:39:09,805 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:09,806 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 01:39:09,807 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:09,835 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:09,836 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:09,836 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:09,837 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:09,840 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:09,840 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:09,842 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:09,843 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:09,858 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:09,859 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:09,859 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:09,860 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:09,861 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:09,862 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:09,864 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:09,864 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:09,924 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:09,924 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:09,926 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:09,927 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:09,927 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:09,928 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:09,930 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:09,931 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:39:09,932 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:09,933 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:39:09,934 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:09,934 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:39:09,937 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 01:39:09,937 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:09,939 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:09,939 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:09,940 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:09,940 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:09,982 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 01:39:09,983 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:09,984 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 01:39:09,984 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:09,986 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-16 01:39:09,987 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 01:39:09,989 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 01:39:09,990 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:11,183 WARN  L193               SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 226 DAG size of output: 186
[2020-10-16 01:39:11,190 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term
[2020-10-16 01:39:11,191 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:11,191 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 01:39:11,192 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:11,963 WARN  L193               SmtUtils]: Spent 761.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 122
[2020-10-16 01:39:12,046 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 01:39:12,047 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:12,347 WARN  L193               SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60
[2020-10-16 01:39:12,906 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 01:39:12,907 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:12,944 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:12,944 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:12,945 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:12,946 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:12,947 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:12,947 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:12,949 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:12,949 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:12,971 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:12,971 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:12,972 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:12,972 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:12,974 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:12,975 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:12,976 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:12,977 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:13,048 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:13,049 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:13,049 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:13,050 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:13,051 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:13,051 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:13,054 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:13,054 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:13,069 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:13,070 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:13,070 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:13,071 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:13,072 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:13,072 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:13,075 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:13,075 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:13,112 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:13,113 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:13,114 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:13,114 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:13,117 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:13,118 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:13,122 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:13,122 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:13,142 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:13,142 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:13,143 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:13,143 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:13,145 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:13,147 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:13,149 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:13,149 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:13,191 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:13,192 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:13,192 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:13,193 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:13,194 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:13,194 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:13,196 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:13,196 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:13,210 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:13,211 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:13,211 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:13,212 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:13,213 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:13,213 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:13,215 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:13,215 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:13,342 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:13,342 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:13,343 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:13,343 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:13,344 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:13,345 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:13,346 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:13,346 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:13,359 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:13,360 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:13,361 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:13,361 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:13,362 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:13,363 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:13,364 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:13,364 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:13,406 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:13,407 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:13,407 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:13,408 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:13,410 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:13,410 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:13,412 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:13,412 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:39:13,425 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:13,426 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:13,427 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:13,427 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:39:13,428 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:39:13,429 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:13,430 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:39:13,431 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:39:13,828 WARN  L193               SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78
[2020-10-16 01:39:14,028 WARN  L193               SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 85
[2020-10-16 01:39:14,133 WARN  L193               SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 83
[2020-10-16 01:39:14,139 INFO  L132        LiptonReduction]: Checked pairs total: 4695
[2020-10-16 01:39:14,139 INFO  L134        LiptonReduction]: Total number of compositions: 76
[2020-10-16 01:39:14,150 INFO  L182   CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5409
[2020-10-16 01:39:14,156 INFO  L129       PetriNetUnfolder]: 0/3 cut-off events.
[2020-10-16 01:39:14,156 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 01:39:14,156 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:39:14,157 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2020-10-16 01:39:14,158 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:39:14,162 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:39:14,162 INFO  L82        PathProgramCache]: Analyzing trace with hash 1041180, now seen corresponding path program 1 times
[2020-10-16 01:39:14,170 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:39:14,170 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129995937]
[2020-10-16 01:39:14,170 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:39:14,290 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:39:14,358 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:39:14,359 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129995937]
[2020-10-16 01:39:14,360 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:39:14,360 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 01:39:14,361 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008051132]
[2020-10-16 01:39:14,370 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 01:39:14,370 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:39:14,385 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 01:39:14,387 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 01:39:14,389 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 137 out of 168
[2020-10-16 01:39:14,391 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states.
[2020-10-16 01:39:14,391 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:39:14,391 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 168
[2020-10-16 01:39:14,393 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:39:14,479 INFO  L129       PetriNetUnfolder]: 49/134 cut-off events.
[2020-10-16 01:39:14,480 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 01:39:14,480 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 230 conditions, 134 events. 49/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 602 event pairs, 38 based on Foata normal form. 11/127 useless extension candidates. Maximal degree in co-relation 220. Up to 65 conditions per place. 
[2020-10-16 01:39:14,483 INFO  L132   encePairwiseOnDemand]: 164/168 looper letters, 9 selfloop transitions, 2 changer transitions 0/27 dead transitions.
[2020-10-16 01:39:14,483 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 27 transitions, 85 flow
[2020-10-16 01:39:14,484 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 01:39:14,487 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2020-10-16 01:39:14,497 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions.
[2020-10-16 01:39:14,500 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8432539682539683
[2020-10-16 01:39:14,501 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 425 transitions.
[2020-10-16 01:39:14,501 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions.
[2020-10-16 01:39:14,504 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:39:14,506 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions.
[2020-10-16 01:39:14,510 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 4 states.
[2020-10-16 01:39:14,517 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states.
[2020-10-16 01:39:14,517 INFO  L81            ComplementDD]: Finished complementDD. Result 4 states.
[2020-10-16 01:39:14,520 INFO  L185             Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 425 transitions.
[2020-10-16 01:39:14,521 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 27 transitions, 85 flow
[2020-10-16 01:39:14,523 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 82 flow, removed 0 selfloop flow, removed 3 redundant places.
[2020-10-16 01:39:14,525 INFO  L241             Difference]: Finished difference. Result has 32 places, 23 transitions, 56 flow
[2020-10-16 01:39:14,528 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=32, PETRI_TRANSITIONS=23}
[2020-10-16 01:39:14,529 INFO  L342   CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places.
[2020-10-16 01:39:14,529 INFO  L481      AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow
[2020-10-16 01:39:14,529 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 01:39:14,529 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:39:14,529 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:39:14,529 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-16 01:39:14,530 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:39:14,530 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:39:14,530 INFO  L82        PathProgramCache]: Analyzing trace with hash 626468161, now seen corresponding path program 1 times
[2020-10-16 01:39:14,530 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:39:14,530 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101820736]
[2020-10-16 01:39:14,531 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:39:14,580 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:39:14,665 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:39:14,665 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101820736]
[2020-10-16 01:39:14,665 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:39:14,666 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 01:39:14,666 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096053816]
[2020-10-16 01:39:14,667 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 01:39:14,667 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:39:14,668 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 01:39:14,668 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 01:39:14,670 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 120 out of 168
[2020-10-16 01:39:14,670 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand 4 states.
[2020-10-16 01:39:14,670 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:39:14,671 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 168
[2020-10-16 01:39:14,671 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:39:14,853 INFO  L129       PetriNetUnfolder]: 243/435 cut-off events.
[2020-10-16 01:39:14,853 INFO  L130       PetriNetUnfolder]: For 32/32 co-relation queries the response was YES.
[2020-10-16 01:39:14,855 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 860 conditions, 435 events. 243/435 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2265 event pairs, 137 based on Foata normal form. 0/396 useless extension candidates. Maximal degree in co-relation 851. Up to 239 conditions per place. 
[2020-10-16 01:39:14,858 INFO  L132   encePairwiseOnDemand]: 162/168 looper letters, 11 selfloop transitions, 3 changer transitions 13/39 dead transitions.
[2020-10-16 01:39:14,858 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 39 transitions, 148 flow
[2020-10-16 01:39:14,859 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 01:39:14,859 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-10-16 01:39:14,862 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 629 transitions.
[2020-10-16 01:39:14,863 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7488095238095238
[2020-10-16 01:39:14,863 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 629 transitions.
[2020-10-16 01:39:14,863 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 629 transitions.
[2020-10-16 01:39:14,864 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:39:14,864 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 629 transitions.
[2020-10-16 01:39:14,869 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 6 states.
[2020-10-16 01:39:14,873 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states.
[2020-10-16 01:39:14,873 INFO  L81            ComplementDD]: Finished complementDD. Result 6 states.
[2020-10-16 01:39:14,873 INFO  L185             Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 5 states and 629 transitions.
[2020-10-16 01:39:14,873 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 39 transitions, 148 flow
[2020-10-16 01:39:14,874 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places.
[2020-10-16 01:39:14,875 INFO  L241             Difference]: Finished difference. Result has 37 places, 24 transitions, 77 flow
[2020-10-16 01:39:14,876 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=77, PETRI_PLACES=37, PETRI_TRANSITIONS=24}
[2020-10-16 01:39:14,876 INFO  L342   CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places.
[2020-10-16 01:39:14,876 INFO  L481      AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 77 flow
[2020-10-16 01:39:14,877 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 01:39:14,877 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:39:14,877 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:39:14,878 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-16 01:39:14,878 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:39:14,878 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:39:14,878 INFO  L82        PathProgramCache]: Analyzing trace with hash -2055192665, now seen corresponding path program 1 times
[2020-10-16 01:39:14,879 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:39:14,879 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32978663]
[2020-10-16 01:39:14,879 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:39:14,964 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:39:15,069 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:39:15,069 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32978663]
[2020-10-16 01:39:15,070 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:39:15,070 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 01:39:15,070 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733688330]
[2020-10-16 01:39:15,071 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 01:39:15,071 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:39:15,071 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 01:39:15,072 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 01:39:15,073 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 137 out of 168
[2020-10-16 01:39:15,074 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 77 flow. Second operand 4 states.
[2020-10-16 01:39:15,074 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:39:15,074 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 168
[2020-10-16 01:39:15,074 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:39:15,132 INFO  L129       PetriNetUnfolder]: 7/54 cut-off events.
[2020-10-16 01:39:15,132 INFO  L130       PetriNetUnfolder]: For 32/32 co-relation queries the response was YES.
[2020-10-16 01:39:15,133 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 112 conditions, 54 events. 7/54 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 169 event pairs, 3 based on Foata normal form. 5/55 useless extension candidates. Maximal degree in co-relation 100. Up to 17 conditions per place. 
[2020-10-16 01:39:15,133 INFO  L132   encePairwiseOnDemand]: 164/168 looper letters, 2 selfloop transitions, 2 changer transitions 2/26 dead transitions.
[2020-10-16 01:39:15,133 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 26 transitions, 95 flow
[2020-10-16 01:39:15,134 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 01:39:15,134 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-10-16 01:39:15,136 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 693 transitions.
[2020-10-16 01:39:15,136 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.825
[2020-10-16 01:39:15,136 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 693 transitions.
[2020-10-16 01:39:15,137 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 693 transitions.
[2020-10-16 01:39:15,137 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:39:15,137 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 693 transitions.
[2020-10-16 01:39:15,139 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 6 states.
[2020-10-16 01:39:15,140 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states.
[2020-10-16 01:39:15,140 INFO  L81            ComplementDD]: Finished complementDD. Result 6 states.
[2020-10-16 01:39:15,141 INFO  L185             Difference]: Start difference. First operand has 37 places, 24 transitions, 77 flow. Second operand 5 states and 693 transitions.
[2020-10-16 01:39:15,141 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 26 transitions, 95 flow
[2020-10-16 01:39:15,142 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 26 transitions, 90 flow, removed 1 selfloop flow, removed 2 redundant places.
[2020-10-16 01:39:15,142 INFO  L241             Difference]: Finished difference. Result has 39 places, 24 transitions, 84 flow
[2020-10-16 01:39:15,143 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=84, PETRI_PLACES=39, PETRI_TRANSITIONS=24}
[2020-10-16 01:39:15,143 INFO  L342   CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places.
[2020-10-16 01:39:15,143 INFO  L481      AbstractCegarLoop]: Abstraction has has 39 places, 24 transitions, 84 flow
[2020-10-16 01:39:15,143 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 01:39:15,143 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:39:15,143 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:39:15,144 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-16 01:39:15,144 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:39:15,144 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:39:15,144 INFO  L82        PathProgramCache]: Analyzing trace with hash 96620521, now seen corresponding path program 1 times
[2020-10-16 01:39:15,145 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:39:15,145 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812048486]
[2020-10-16 01:39:15,145 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:39:15,171 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:39:15,231 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:39:15,232 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812048486]
[2020-10-16 01:39:15,232 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:39:15,232 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 01:39:15,232 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441416766]
[2020-10-16 01:39:15,233 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 01:39:15,233 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:39:15,234 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 01:39:15,234 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2020-10-16 01:39:15,236 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 133 out of 168
[2020-10-16 01:39:15,236 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 24 transitions, 84 flow. Second operand 5 states.
[2020-10-16 01:39:15,236 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:39:15,236 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 168
[2020-10-16 01:39:15,237 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:39:15,295 INFO  L129       PetriNetUnfolder]: 8/55 cut-off events.
[2020-10-16 01:39:15,295 INFO  L130       PetriNetUnfolder]: For 49/52 co-relation queries the response was YES.
[2020-10-16 01:39:15,299 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 132 conditions, 55 events. 8/55 cut-off events. For 49/52 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 211 event pairs, 1 based on Foata normal form. 6/58 useless extension candidates. Maximal degree in co-relation 117. Up to 17 conditions per place. 
[2020-10-16 01:39:15,299 INFO  L132   encePairwiseOnDemand]: 163/168 looper letters, 3 selfloop transitions, 3 changer transitions 3/28 dead transitions.
[2020-10-16 01:39:15,299 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 28 transitions, 121 flow
[2020-10-16 01:39:15,300 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 01:39:15,300 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2020-10-16 01:39:15,302 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 809 transitions.
[2020-10-16 01:39:15,302 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8025793650793651
[2020-10-16 01:39:15,302 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 809 transitions.
[2020-10-16 01:39:15,303 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 809 transitions.
[2020-10-16 01:39:15,304 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:39:15,304 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 809 transitions.
[2020-10-16 01:39:15,307 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 7 states.
[2020-10-16 01:39:15,308 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states.
[2020-10-16 01:39:15,308 INFO  L81            ComplementDD]: Finished complementDD. Result 7 states.
[2020-10-16 01:39:15,309 INFO  L185             Difference]: Start difference. First operand has 39 places, 24 transitions, 84 flow. Second operand 6 states and 809 transitions.
[2020-10-16 01:39:15,309 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 28 transitions, 121 flow
[2020-10-16 01:39:15,312 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 28 transitions, 109 flow, removed 3 selfloop flow, removed 4 redundant places.
[2020-10-16 01:39:15,313 INFO  L241             Difference]: Finished difference. Result has 42 places, 25 transitions, 97 flow
[2020-10-16 01:39:15,313 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=97, PETRI_PLACES=42, PETRI_TRANSITIONS=25}
[2020-10-16 01:39:15,313 INFO  L342   CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places.
[2020-10-16 01:39:15,313 INFO  L481      AbstractCegarLoop]: Abstraction has has 42 places, 25 transitions, 97 flow
[2020-10-16 01:39:15,313 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 01:39:15,313 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:39:15,314 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:39:15,314 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-16 01:39:15,314 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:39:15,314 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:39:15,314 INFO  L82        PathProgramCache]: Analyzing trace with hash 1394966630, now seen corresponding path program 1 times
[2020-10-16 01:39:15,314 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:39:15,315 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155329761]
[2020-10-16 01:39:15,315 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:39:15,368 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:39:15,491 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:39:15,492 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155329761]
[2020-10-16 01:39:15,492 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:39:15,492 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 01:39:15,492 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435462314]
[2020-10-16 01:39:15,493 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 01:39:15,493 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:39:15,493 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 01:39:15,493 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 01:39:15,495 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 121 out of 168
[2020-10-16 01:39:15,495 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 25 transitions, 97 flow. Second operand 5 states.
[2020-10-16 01:39:15,495 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:39:15,495 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 168
[2020-10-16 01:39:15,496 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:39:15,698 INFO  L129       PetriNetUnfolder]: 190/407 cut-off events.
[2020-10-16 01:39:15,698 INFO  L130       PetriNetUnfolder]: For 449/461 co-relation queries the response was YES.
[2020-10-16 01:39:15,701 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 972 conditions, 407 events. 190/407 cut-off events. For 449/461 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2224 event pairs, 96 based on Foata normal form. 29/419 useless extension candidates. Maximal degree in co-relation 955. Up to 281 conditions per place. 
[2020-10-16 01:39:15,703 INFO  L132   encePairwiseOnDemand]: 162/168 looper letters, 9 selfloop transitions, 5 changer transitions 10/39 dead transitions.
[2020-10-16 01:39:15,703 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 39 transitions, 195 flow
[2020-10-16 01:39:15,704 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 01:39:15,704 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-10-16 01:39:15,706 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 629 transitions.
[2020-10-16 01:39:15,706 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7488095238095238
[2020-10-16 01:39:15,706 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 629 transitions.
[2020-10-16 01:39:15,707 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 629 transitions.
[2020-10-16 01:39:15,707 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:39:15,707 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 629 transitions.
[2020-10-16 01:39:15,709 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 6 states.
[2020-10-16 01:39:15,710 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states.
[2020-10-16 01:39:15,711 INFO  L81            ComplementDD]: Finished complementDD. Result 6 states.
[2020-10-16 01:39:15,711 INFO  L185             Difference]: Start difference. First operand has 42 places, 25 transitions, 97 flow. Second operand 5 states and 629 transitions.
[2020-10-16 01:39:15,711 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 39 transitions, 195 flow
[2020-10-16 01:39:15,713 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 39 transitions, 187 flow, removed 2 selfloop flow, removed 4 redundant places.
[2020-10-16 01:39:15,714 INFO  L241             Difference]: Finished difference. Result has 43 places, 28 transitions, 132 flow
[2020-10-16 01:39:15,714 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=43, PETRI_TRANSITIONS=28}
[2020-10-16 01:39:15,714 INFO  L342   CegarLoopForPetriNet]: 34 programPoint places, 9 predicate places.
[2020-10-16 01:39:15,715 INFO  L481      AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 132 flow
[2020-10-16 01:39:15,715 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 01:39:15,715 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:39:15,715 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:39:15,715 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-16 01:39:15,715 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:39:15,715 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:39:15,716 INFO  L82        PathProgramCache]: Analyzing trace with hash -1505229284, now seen corresponding path program 1 times
[2020-10-16 01:39:15,716 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:39:15,716 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412509173]
[2020-10-16 01:39:15,716 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:39:15,750 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:39:15,877 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:39:15,878 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412509173]
[2020-10-16 01:39:15,878 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:39:15,878 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 01:39:15,878 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785330026]
[2020-10-16 01:39:15,879 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 01:39:15,879 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:39:15,879 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 01:39:15,879 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-16 01:39:15,881 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 118 out of 168
[2020-10-16 01:39:15,882 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 28 transitions, 132 flow. Second operand 6 states.
[2020-10-16 01:39:15,882 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:39:15,882 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 168
[2020-10-16 01:39:15,882 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:39:16,151 INFO  L129       PetriNetUnfolder]: 180/390 cut-off events.
[2020-10-16 01:39:16,151 INFO  L130       PetriNetUnfolder]: For 710/775 co-relation queries the response was YES.
[2020-10-16 01:39:16,153 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 1217 conditions, 390 events. 180/390 cut-off events. For 710/775 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2104 event pairs, 47 based on Foata normal form. 33/415 useless extension candidates. Maximal degree in co-relation 1199. Up to 256 conditions per place. 
[2020-10-16 01:39:16,155 INFO  L132   encePairwiseOnDemand]: 161/168 looper letters, 11 selfloop transitions, 9 changer transitions 12/47 dead transitions.
[2020-10-16 01:39:16,155 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 47 transitions, 310 flow
[2020-10-16 01:39:16,156 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 01:39:16,156 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-10-16 01:39:16,158 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 858 transitions.
[2020-10-16 01:39:16,159 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7295918367346939
[2020-10-16 01:39:16,159 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 858 transitions.
[2020-10-16 01:39:16,159 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 858 transitions.
[2020-10-16 01:39:16,160 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:39:16,160 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 858 transitions.
[2020-10-16 01:39:16,162 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 8 states.
[2020-10-16 01:39:16,164 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states.
[2020-10-16 01:39:16,164 INFO  L81            ComplementDD]: Finished complementDD. Result 8 states.
[2020-10-16 01:39:16,164 INFO  L185             Difference]: Start difference. First operand has 43 places, 28 transitions, 132 flow. Second operand 7 states and 858 transitions.
[2020-10-16 01:39:16,164 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 47 transitions, 310 flow
[2020-10-16 01:39:16,167 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 47 transitions, 301 flow, removed 2 selfloop flow, removed 2 redundant places.
[2020-10-16 01:39:16,168 INFO  L241             Difference]: Finished difference. Result has 50 places, 33 transitions, 207 flow
[2020-10-16 01:39:16,169 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=207, PETRI_PLACES=50, PETRI_TRANSITIONS=33}
[2020-10-16 01:39:16,169 INFO  L342   CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places.
[2020-10-16 01:39:16,169 INFO  L481      AbstractCegarLoop]: Abstraction has has 50 places, 33 transitions, 207 flow
[2020-10-16 01:39:16,169 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 01:39:16,169 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:39:16,169 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:39:16,169 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-16 01:39:16,170 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:39:16,170 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:39:16,170 INFO  L82        PathProgramCache]: Analyzing trace with hash -1060328577, now seen corresponding path program 1 times
[2020-10-16 01:39:16,170 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:39:16,170 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929462863]
[2020-10-16 01:39:16,171 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:39:16,187 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:39:16,228 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:39:16,229 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929462863]
[2020-10-16 01:39:16,229 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:39:16,229 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 01:39:16,229 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376532305]
[2020-10-16 01:39:16,230 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 01:39:16,230 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:39:16,230 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 01:39:16,230 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 01:39:16,232 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 123 out of 168
[2020-10-16 01:39:16,232 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 33 transitions, 207 flow. Second operand 5 states.
[2020-10-16 01:39:16,232 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:39:16,232 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 168
[2020-10-16 01:39:16,233 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:39:16,395 INFO  L129       PetriNetUnfolder]: 194/395 cut-off events.
[2020-10-16 01:39:16,395 INFO  L130       PetriNetUnfolder]: For 1905/2034 co-relation queries the response was YES.
[2020-10-16 01:39:16,397 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 1688 conditions, 395 events. 194/395 cut-off events. For 1905/2034 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1975 event pairs, 56 based on Foata normal form. 36/416 useless extension candidates. Maximal degree in co-relation 1665. Up to 235 conditions per place. 
[2020-10-16 01:39:16,400 INFO  L132   encePairwiseOnDemand]: 160/168 looper letters, 16 selfloop transitions, 11 changer transitions 7/49 dead transitions.
[2020-10-16 01:39:16,400 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 405 flow
[2020-10-16 01:39:16,401 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 01:39:16,401 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2020-10-16 01:39:16,403 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 766 transitions.
[2020-10-16 01:39:16,404 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7599206349206349
[2020-10-16 01:39:16,404 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 766 transitions.
[2020-10-16 01:39:16,404 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 766 transitions.
[2020-10-16 01:39:16,405 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:39:16,405 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 766 transitions.
[2020-10-16 01:39:16,407 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 7 states.
[2020-10-16 01:39:16,409 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states.
[2020-10-16 01:39:16,409 INFO  L81            ComplementDD]: Finished complementDD. Result 7 states.
[2020-10-16 01:39:16,410 INFO  L185             Difference]: Start difference. First operand has 50 places, 33 transitions, 207 flow. Second operand 6 states and 766 transitions.
[2020-10-16 01:39:16,410 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 405 flow
[2020-10-16 01:39:16,417 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 49 transitions, 367 flow, removed 19 selfloop flow, removed 3 redundant places.
[2020-10-16 01:39:16,419 INFO  L241             Difference]: Finished difference. Result has 52 places, 37 transitions, 247 flow
[2020-10-16 01:39:16,419 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=247, PETRI_PLACES=52, PETRI_TRANSITIONS=37}
[2020-10-16 01:39:16,419 INFO  L342   CegarLoopForPetriNet]: 34 programPoint places, 18 predicate places.
[2020-10-16 01:39:16,419 INFO  L481      AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 247 flow
[2020-10-16 01:39:16,419 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 01:39:16,419 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:39:16,420 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:39:16,420 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-16 01:39:16,420 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:39:16,420 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:39:16,420 INFO  L82        PathProgramCache]: Analyzing trace with hash -1109685537, now seen corresponding path program 2 times
[2020-10-16 01:39:16,421 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:39:16,421 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062143132]
[2020-10-16 01:39:16,421 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:39:16,445 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:39:16,597 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:39:16,597 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062143132]
[2020-10-16 01:39:16,598 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:39:16,598 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 01:39:16,598 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270168612]
[2020-10-16 01:39:16,598 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 01:39:16,598 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:39:16,599 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 01:39:16,599 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-16 01:39:16,600 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 119 out of 168
[2020-10-16 01:39:16,601 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 247 flow. Second operand 6 states.
[2020-10-16 01:39:16,601 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:39:16,601 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 168
[2020-10-16 01:39:16,601 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:39:16,887 INFO  L129       PetriNetUnfolder]: 191/401 cut-off events.
[2020-10-16 01:39:16,887 INFO  L130       PetriNetUnfolder]: For 1781/1893 co-relation queries the response was YES.
[2020-10-16 01:39:16,890 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 1796 conditions, 401 events. 191/401 cut-off events. For 1781/1893 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2064 event pairs, 57 based on Foata normal form. 42/428 useless extension candidates. Maximal degree in co-relation 1771. Up to 235 conditions per place. 
[2020-10-16 01:39:16,892 INFO  L132   encePairwiseOnDemand]: 160/168 looper letters, 16 selfloop transitions, 15 changer transitions 10/56 dead transitions.
[2020-10-16 01:39:16,893 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 56 transitions, 505 flow
[2020-10-16 01:39:16,893 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-10-16 01:39:16,893 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2020-10-16 01:39:16,896 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 989 transitions.
[2020-10-16 01:39:16,896 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7358630952380952
[2020-10-16 01:39:16,897 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 989 transitions.
[2020-10-16 01:39:16,897 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 989 transitions.
[2020-10-16 01:39:16,898 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:39:16,898 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 989 transitions.
[2020-10-16 01:39:16,900 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 9 states.
[2020-10-16 01:39:16,902 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states.
[2020-10-16 01:39:16,902 INFO  L81            ComplementDD]: Finished complementDD. Result 9 states.
[2020-10-16 01:39:16,902 INFO  L185             Difference]: Start difference. First operand has 52 places, 37 transitions, 247 flow. Second operand 8 states and 989 transitions.
[2020-10-16 01:39:16,903 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 56 transitions, 505 flow
[2020-10-16 01:39:16,908 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 56 transitions, 474 flow, removed 11 selfloop flow, removed 3 redundant places.
[2020-10-16 01:39:16,909 INFO  L241             Difference]: Finished difference. Result has 58 places, 40 transitions, 305 flow
[2020-10-16 01:39:16,910 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=305, PETRI_PLACES=58, PETRI_TRANSITIONS=40}
[2020-10-16 01:39:16,910 INFO  L342   CegarLoopForPetriNet]: 34 programPoint places, 24 predicate places.
[2020-10-16 01:39:16,910 INFO  L481      AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 305 flow
[2020-10-16 01:39:16,910 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 01:39:16,910 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:39:16,910 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:39:16,911 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-16 01:39:16,911 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:39:16,911 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:39:16,911 INFO  L82        PathProgramCache]: Analyzing trace with hash -1408563701, now seen corresponding path program 1 times
[2020-10-16 01:39:16,911 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:39:16,912 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731567102]
[2020-10-16 01:39:16,912 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:39:16,940 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:39:17,268 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:39:17,268 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731567102]
[2020-10-16 01:39:17,268 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:39:17,269 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 01:39:17,269 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997756779]
[2020-10-16 01:39:17,269 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 01:39:17,269 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:39:17,270 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 01:39:17,270 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2020-10-16 01:39:17,271 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 114 out of 168
[2020-10-16 01:39:17,272 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 305 flow. Second operand 7 states.
[2020-10-16 01:39:17,272 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:39:17,272 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 168
[2020-10-16 01:39:17,272 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:39:17,527 INFO  L129       PetriNetUnfolder]: 170/369 cut-off events.
[2020-10-16 01:39:17,528 INFO  L130       PetriNetUnfolder]: For 2089/2162 co-relation queries the response was YES.
[2020-10-16 01:39:17,530 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 1825 conditions, 369 events. 170/369 cut-off events. For 2089/2162 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1965 event pairs, 31 based on Foata normal form. 43/405 useless extension candidates. Maximal degree in co-relation 1797. Up to 256 conditions per place. 
[2020-10-16 01:39:17,533 INFO  L132   encePairwiseOnDemand]: 162/168 looper letters, 19 selfloop transitions, 10 changer transitions 6/50 dead transitions.
[2020-10-16 01:39:17,533 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 50 transitions, 453 flow
[2020-10-16 01:39:17,534 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 01:39:17,534 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2020-10-16 01:39:17,536 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 709 transitions.
[2020-10-16 01:39:17,536 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7033730158730159
[2020-10-16 01:39:17,536 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 709 transitions.
[2020-10-16 01:39:17,536 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 709 transitions.
[2020-10-16 01:39:17,537 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:39:17,537 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 709 transitions.
[2020-10-16 01:39:17,539 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 7 states.
[2020-10-16 01:39:17,541 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states.
[2020-10-16 01:39:17,541 INFO  L81            ComplementDD]: Finished complementDD. Result 7 states.
[2020-10-16 01:39:17,541 INFO  L185             Difference]: Start difference. First operand has 58 places, 40 transitions, 305 flow. Second operand 6 states and 709 transitions.
[2020-10-16 01:39:17,541 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 50 transitions, 453 flow
[2020-10-16 01:39:17,547 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 50 transitions, 417 flow, removed 6 selfloop flow, removed 5 redundant places.
[2020-10-16 01:39:17,549 INFO  L241             Difference]: Finished difference. Result has 58 places, 42 transitions, 324 flow
[2020-10-16 01:39:17,549 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=324, PETRI_PLACES=58, PETRI_TRANSITIONS=42}
[2020-10-16 01:39:17,550 INFO  L342   CegarLoopForPetriNet]: 34 programPoint places, 24 predicate places.
[2020-10-16 01:39:17,550 INFO  L481      AbstractCegarLoop]: Abstraction has has 58 places, 42 transitions, 324 flow
[2020-10-16 01:39:17,550 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 01:39:17,550 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:39:17,550 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:39:17,550 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-16 01:39:17,550 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:39:17,551 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:39:17,551 INFO  L82        PathProgramCache]: Analyzing trace with hash 582490697, now seen corresponding path program 1 times
[2020-10-16 01:39:17,551 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:39:17,551 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019417497]
[2020-10-16 01:39:17,551 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:39:17,569 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:39:17,684 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:39:17,684 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019417497]
[2020-10-16 01:39:17,685 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:39:17,685 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 01:39:17,685 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451368680]
[2020-10-16 01:39:17,685 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 01:39:17,685 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:39:17,686 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 01:39:17,686 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2020-10-16 01:39:17,688 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 121 out of 168
[2020-10-16 01:39:17,688 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 42 transitions, 324 flow. Second operand 7 states.
[2020-10-16 01:39:17,688 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:39:17,688 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 168
[2020-10-16 01:39:17,689 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:39:17,970 INFO  L129       PetriNetUnfolder]: 190/415 cut-off events.
[2020-10-16 01:39:17,970 INFO  L130       PetriNetUnfolder]: For 2651/2739 co-relation queries the response was YES.
[2020-10-16 01:39:17,973 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 2160 conditions, 415 events. 190/415 cut-off events. For 2651/2739 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2274 event pairs, 47 based on Foata normal form. 31/439 useless extension candidates. Maximal degree in co-relation 2131. Up to 247 conditions per place. 
[2020-10-16 01:39:17,975 INFO  L132   encePairwiseOnDemand]: 161/168 looper letters, 19 selfloop transitions, 13 changer transitions 7/54 dead transitions.
[2020-10-16 01:39:17,975 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 54 transitions, 542 flow
[2020-10-16 01:39:17,976 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 01:39:17,976 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2020-10-16 01:39:17,978 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 750 transitions.
[2020-10-16 01:39:17,978 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7440476190476191
[2020-10-16 01:39:17,978 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 750 transitions.
[2020-10-16 01:39:17,979 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 750 transitions.
[2020-10-16 01:39:17,979 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:39:17,979 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 750 transitions.
[2020-10-16 01:39:17,982 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 7 states.
[2020-10-16 01:39:17,983 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states.
[2020-10-16 01:39:17,984 INFO  L81            ComplementDD]: Finished complementDD. Result 7 states.
[2020-10-16 01:39:17,984 INFO  L185             Difference]: Start difference. First operand has 58 places, 42 transitions, 324 flow. Second operand 6 states and 750 transitions.
[2020-10-16 01:39:17,984 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 54 transitions, 542 flow
[2020-10-16 01:39:17,989 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 54 transitions, 519 flow, removed 5 selfloop flow, removed 3 redundant places.
[2020-10-16 01:39:17,991 INFO  L241             Difference]: Finished difference. Result has 61 places, 45 transitions, 393 flow
[2020-10-16 01:39:17,992 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=393, PETRI_PLACES=61, PETRI_TRANSITIONS=45}
[2020-10-16 01:39:17,992 INFO  L342   CegarLoopForPetriNet]: 34 programPoint places, 27 predicate places.
[2020-10-16 01:39:17,992 INFO  L481      AbstractCegarLoop]: Abstraction has has 61 places, 45 transitions, 393 flow
[2020-10-16 01:39:17,992 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 01:39:17,992 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:39:17,992 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:39:17,992 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-16 01:39:17,993 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:39:17,993 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:39:17,993 INFO  L82        PathProgramCache]: Analyzing trace with hash -1046700281, now seen corresponding path program 1 times
[2020-10-16 01:39:17,995 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:39:17,996 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062772627]
[2020-10-16 01:39:17,996 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:39:18,016 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:39:18,230 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:39:18,230 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062772627]
[2020-10-16 01:39:18,230 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:39:18,230 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 01:39:18,231 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112943601]
[2020-10-16 01:39:18,231 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 01:39:18,231 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:39:18,231 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 01:39:18,231 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2020-10-16 01:39:18,233 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 119 out of 168
[2020-10-16 01:39:18,233 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 45 transitions, 393 flow. Second operand 7 states.
[2020-10-16 01:39:18,234 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:39:18,234 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 168
[2020-10-16 01:39:18,234 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:39:18,465 INFO  L129       PetriNetUnfolder]: 185/398 cut-off events.
[2020-10-16 01:39:18,465 INFO  L130       PetriNetUnfolder]: For 3577/3722 co-relation queries the response was YES.
[2020-10-16 01:39:18,467 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 2388 conditions, 398 events. 185/398 cut-off events. For 3577/3722 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2099 event pairs, 51 based on Foata normal form. 35/420 useless extension candidates. Maximal degree in co-relation 2357. Up to 251 conditions per place. 
[2020-10-16 01:39:18,470 INFO  L132   encePairwiseOnDemand]: 160/168 looper letters, 21 selfloop transitions, 12 changer transitions 7/55 dead transitions.
[2020-10-16 01:39:18,470 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 55 transitions, 622 flow
[2020-10-16 01:39:18,474 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 01:39:18,474 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2020-10-16 01:39:18,476 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 740 transitions.
[2020-10-16 01:39:18,477 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7341269841269841
[2020-10-16 01:39:18,477 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 740 transitions.
[2020-10-16 01:39:18,477 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 740 transitions.
[2020-10-16 01:39:18,478 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:39:18,478 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 740 transitions.
[2020-10-16 01:39:18,480 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 7 states.
[2020-10-16 01:39:18,482 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states.
[2020-10-16 01:39:18,482 INFO  L81            ComplementDD]: Finished complementDD. Result 7 states.
[2020-10-16 01:39:18,482 INFO  L185             Difference]: Start difference. First operand has 61 places, 45 transitions, 393 flow. Second operand 6 states and 740 transitions.
[2020-10-16 01:39:18,482 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 55 transitions, 622 flow
[2020-10-16 01:39:18,489 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 55 transitions, 600 flow, removed 4 selfloop flow, removed 3 redundant places.
[2020-10-16 01:39:18,490 INFO  L241             Difference]: Finished difference. Result has 64 places, 45 transitions, 412 flow
[2020-10-16 01:39:18,491 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=412, PETRI_PLACES=64, PETRI_TRANSITIONS=45}
[2020-10-16 01:39:18,491 INFO  L342   CegarLoopForPetriNet]: 34 programPoint places, 30 predicate places.
[2020-10-16 01:39:18,491 INFO  L481      AbstractCegarLoop]: Abstraction has has 64 places, 45 transitions, 412 flow
[2020-10-16 01:39:18,491 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 01:39:18,491 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:39:18,491 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:39:18,492 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-16 01:39:18,492 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:39:18,492 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:39:18,492 INFO  L82        PathProgramCache]: Analyzing trace with hash -1417761475, now seen corresponding path program 1 times
[2020-10-16 01:39:18,493 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:39:18,493 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509531545]
[2020-10-16 01:39:18,493 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:39:18,518 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:39:18,574 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:39:18,574 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509531545]
[2020-10-16 01:39:18,575 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:39:18,575 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 01:39:18,575 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648481422]
[2020-10-16 01:39:18,575 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 01:39:18,576 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:39:18,576 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 01:39:18,576 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2020-10-16 01:39:18,577 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 118 out of 168
[2020-10-16 01:39:18,578 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 45 transitions, 412 flow. Second operand 6 states.
[2020-10-16 01:39:18,578 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:39:18,578 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 168
[2020-10-16 01:39:18,578 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:39:18,838 INFO  L129       PetriNetUnfolder]: 317/690 cut-off events.
[2020-10-16 01:39:18,838 INFO  L130       PetriNetUnfolder]: For 6448/6537 co-relation queries the response was YES.
[2020-10-16 01:39:18,842 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 3870 conditions, 690 events. 317/690 cut-off events. For 6448/6537 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4400 event pairs, 67 based on Foata normal form. 51/720 useless extension candidates. Maximal degree in co-relation 3837. Up to 319 conditions per place. 
[2020-10-16 01:39:18,846 INFO  L132   encePairwiseOnDemand]: 162/168 looper letters, 29 selfloop transitions, 9 changer transitions 11/66 dead transitions.
[2020-10-16 01:39:18,846 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 66 transitions, 766 flow
[2020-10-16 01:39:18,846 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 01:39:18,846 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2020-10-16 01:39:18,848 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 733 transitions.
[2020-10-16 01:39:18,849 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7271825396825397
[2020-10-16 01:39:18,849 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 733 transitions.
[2020-10-16 01:39:18,849 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 733 transitions.
[2020-10-16 01:39:18,850 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:39:18,850 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 733 transitions.
[2020-10-16 01:39:18,852 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 7 states.
[2020-10-16 01:39:18,854 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states.
[2020-10-16 01:39:18,854 INFO  L81            ComplementDD]: Finished complementDD. Result 7 states.
[2020-10-16 01:39:18,854 INFO  L185             Difference]: Start difference. First operand has 64 places, 45 transitions, 412 flow. Second operand 6 states and 733 transitions.
[2020-10-16 01:39:18,854 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 66 transitions, 766 flow
[2020-10-16 01:39:18,866 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 66 transitions, 730 flow, removed 6 selfloop flow, removed 5 redundant places.
[2020-10-16 01:39:18,868 INFO  L241             Difference]: Finished difference. Result has 64 places, 46 transitions, 412 flow
[2020-10-16 01:39:18,868 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=412, PETRI_PLACES=64, PETRI_TRANSITIONS=46}
[2020-10-16 01:39:18,868 INFO  L342   CegarLoopForPetriNet]: 34 programPoint places, 30 predicate places.
[2020-10-16 01:39:18,868 INFO  L481      AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 412 flow
[2020-10-16 01:39:18,868 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 01:39:18,869 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:39:18,869 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:39:18,869 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-16 01:39:18,869 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:39:18,869 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:39:18,869 INFO  L82        PathProgramCache]: Analyzing trace with hash -171018691, now seen corresponding path program 2 times
[2020-10-16 01:39:18,869 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:39:18,870 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873014852]
[2020-10-16 01:39:18,870 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:39:18,904 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:39:18,933 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:39:18,933 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873014852]
[2020-10-16 01:39:18,933 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:39:18,933 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 01:39:18,934 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881350687]
[2020-10-16 01:39:18,934 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 01:39:18,934 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:39:18,934 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 01:39:18,934 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 01:39:18,936 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 132 out of 168
[2020-10-16 01:39:18,937 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 46 transitions, 412 flow. Second operand 4 states.
[2020-10-16 01:39:18,937 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:39:18,937 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 168
[2020-10-16 01:39:18,937 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:39:19,104 INFO  L129       PetriNetUnfolder]: 403/908 cut-off events.
[2020-10-16 01:39:19,104 INFO  L130       PetriNetUnfolder]: For 5556/5890 co-relation queries the response was YES.
[2020-10-16 01:39:19,110 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 3712 conditions, 908 events. 403/908 cut-off events. For 5556/5890 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 6368 event pairs, 145 based on Foata normal form. 203/1055 useless extension candidates. Maximal degree in co-relation 3679. Up to 431 conditions per place. 
[2020-10-16 01:39:19,113 INFO  L132   encePairwiseOnDemand]: 162/168 looper letters, 9 selfloop transitions, 8 changer transitions 0/55 dead transitions.
[2020-10-16 01:39:19,114 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 55 transitions, 455 flow
[2020-10-16 01:39:19,114 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 01:39:19,114 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-10-16 01:39:19,116 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 678 transitions.
[2020-10-16 01:39:19,117 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8071428571428572
[2020-10-16 01:39:19,117 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 678 transitions.
[2020-10-16 01:39:19,117 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 678 transitions.
[2020-10-16 01:39:19,118 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:39:19,118 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 678 transitions.
[2020-10-16 01:39:19,119 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 6 states.
[2020-10-16 01:39:19,121 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states.
[2020-10-16 01:39:19,121 INFO  L81            ComplementDD]: Finished complementDD. Result 6 states.
[2020-10-16 01:39:19,121 INFO  L185             Difference]: Start difference. First operand has 64 places, 46 transitions, 412 flow. Second operand 5 states and 678 transitions.
[2020-10-16 01:39:19,121 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 55 transitions, 455 flow
[2020-10-16 01:39:19,129 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 55 transitions, 433 flow, removed 3 selfloop flow, removed 4 redundant places.
[2020-10-16 01:39:19,132 INFO  L241             Difference]: Finished difference. Result has 66 places, 52 transitions, 443 flow
[2020-10-16 01:39:19,132 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=443, PETRI_PLACES=66, PETRI_TRANSITIONS=52}
[2020-10-16 01:39:19,133 INFO  L342   CegarLoopForPetriNet]: 34 programPoint places, 32 predicate places.
[2020-10-16 01:39:19,133 INFO  L481      AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 443 flow
[2020-10-16 01:39:19,133 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 01:39:19,133 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:39:19,133 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:39:19,133 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-16 01:39:19,133 INFO  L429      AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:39:19,134 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:39:19,134 INFO  L82        PathProgramCache]: Analyzing trace with hash -1045461138, now seen corresponding path program 1 times
[2020-10-16 01:39:19,134 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:39:19,134 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226053027]
[2020-10-16 01:39:19,134 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:39:19,176 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:39:19,215 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:39:19,216 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226053027]
[2020-10-16 01:39:19,216 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:39:19,216 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 01:39:19,216 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667151445]
[2020-10-16 01:39:19,217 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 01:39:19,217 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:39:19,218 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 01:39:19,218 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 01:39:19,219 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 132 out of 168
[2020-10-16 01:39:19,219 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 443 flow. Second operand 5 states.
[2020-10-16 01:39:19,220 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:39:19,220 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 168
[2020-10-16 01:39:19,220 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:39:19,402 INFO  L129       PetriNetUnfolder]: 214/622 cut-off events.
[2020-10-16 01:39:19,403 INFO  L130       PetriNetUnfolder]: For 3561/4659 co-relation queries the response was YES.
[2020-10-16 01:39:19,416 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 2892 conditions, 622 events. 214/622 cut-off events. For 3561/4659 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 4608 event pairs, 26 based on Foata normal form. 479/1064 useless extension candidates. Maximal degree in co-relation 2857. Up to 341 conditions per place. 
[2020-10-16 01:39:19,419 INFO  L132   encePairwiseOnDemand]: 162/168 looper letters, 5 selfloop transitions, 15 changer transitions 3/59 dead transitions.
[2020-10-16 01:39:19,420 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 59 transitions, 518 flow
[2020-10-16 01:39:19,421 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 01:39:19,421 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-10-16 01:39:19,423 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 949 transitions.
[2020-10-16 01:39:19,424 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8069727891156463
[2020-10-16 01:39:19,424 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 949 transitions.
[2020-10-16 01:39:19,424 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 949 transitions.
[2020-10-16 01:39:19,426 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:39:19,426 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 949 transitions.
[2020-10-16 01:39:19,429 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 8 states.
[2020-10-16 01:39:19,432 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states.
[2020-10-16 01:39:19,432 INFO  L81            ComplementDD]: Finished complementDD. Result 8 states.
[2020-10-16 01:39:19,432 INFO  L185             Difference]: Start difference. First operand has 66 places, 52 transitions, 443 flow. Second operand 7 states and 949 transitions.
[2020-10-16 01:39:19,432 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 59 transitions, 518 flow
[2020-10-16 01:39:19,442 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 59 transitions, 503 flow, removed 3 selfloop flow, removed 2 redundant places.
[2020-10-16 01:39:19,443 INFO  L241             Difference]: Finished difference. Result has 73 places, 56 transitions, 498 flow
[2020-10-16 01:39:19,443 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=498, PETRI_PLACES=73, PETRI_TRANSITIONS=56}
[2020-10-16 01:39:19,444 INFO  L342   CegarLoopForPetriNet]: 34 programPoint places, 39 predicate places.
[2020-10-16 01:39:19,444 INFO  L481      AbstractCegarLoop]: Abstraction has has 73 places, 56 transitions, 498 flow
[2020-10-16 01:39:19,444 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 01:39:19,444 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:39:19,444 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:39:19,444 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-10-16 01:39:19,444 INFO  L429      AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:39:19,444 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:39:19,445 INFO  L82        PathProgramCache]: Analyzing trace with hash 1950956954, now seen corresponding path program 1 times
[2020-10-16 01:39:19,445 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:39:19,445 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428680029]
[2020-10-16 01:39:19,445 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:39:19,493 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:39:19,534 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:39:19,534 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428680029]
[2020-10-16 01:39:19,534 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:39:19,535 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 01:39:19,535 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710375119]
[2020-10-16 01:39:19,536 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 01:39:19,536 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:39:19,537 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 01:39:19,537 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 01:39:19,538 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 132 out of 168
[2020-10-16 01:39:19,539 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 56 transitions, 498 flow. Second operand 6 states.
[2020-10-16 01:39:19,539 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:39:19,539 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 168
[2020-10-16 01:39:19,539 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:39:19,741 INFO  L129       PetriNetUnfolder]: 160/514 cut-off events.
[2020-10-16 01:39:19,741 INFO  L130       PetriNetUnfolder]: For 4607/6390 co-relation queries the response was YES.
[2020-10-16 01:39:19,745 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 2761 conditions, 514 events. 160/514 cut-off events. For 4607/6390 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 3910 event pairs, 4 based on Foata normal form. 461/942 useless extension candidates. Maximal degree in co-relation 2723. Up to 304 conditions per place. 
[2020-10-16 01:39:19,747 INFO  L132   encePairwiseOnDemand]: 162/168 looper letters, 2 selfloop transitions, 19 changer transitions 15/60 dead transitions.
[2020-10-16 01:39:19,747 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 60 transitions, 576 flow
[2020-10-16 01:39:19,748 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-10-16 01:39:19,748 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-10-16 01:39:19,751 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1214 transitions.
[2020-10-16 01:39:19,751 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8029100529100529
[2020-10-16 01:39:19,751 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1214 transitions.
[2020-10-16 01:39:19,751 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1214 transitions.
[2020-10-16 01:39:19,752 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:39:19,753 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1214 transitions.
[2020-10-16 01:39:19,755 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 10 states.
[2020-10-16 01:39:19,757 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states.
[2020-10-16 01:39:19,758 INFO  L81            ComplementDD]: Finished complementDD. Result 10 states.
[2020-10-16 01:39:19,758 INFO  L185             Difference]: Start difference. First operand has 73 places, 56 transitions, 498 flow. Second operand 9 states and 1214 transitions.
[2020-10-16 01:39:19,758 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 60 transitions, 576 flow
[2020-10-16 01:39:19,774 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 60 transitions, 481 flow, removed 36 selfloop flow, removed 6 redundant places.
[2020-10-16 01:39:19,775 INFO  L241             Difference]: Finished difference. Result has 78 places, 45 transitions, 363 flow
[2020-10-16 01:39:19,776 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=363, PETRI_PLACES=78, PETRI_TRANSITIONS=45}
[2020-10-16 01:39:19,776 INFO  L342   CegarLoopForPetriNet]: 34 programPoint places, 44 predicate places.
[2020-10-16 01:39:19,776 INFO  L481      AbstractCegarLoop]: Abstraction has has 78 places, 45 transitions, 363 flow
[2020-10-16 01:39:19,776 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 01:39:19,776 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:39:19,777 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]
[2020-10-16 01:39:19,777 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2020-10-16 01:39:19,777 INFO  L429      AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:39:19,777 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:39:19,777 INFO  L82        PathProgramCache]: Analyzing trace with hash -1102084274, now seen corresponding path program 1 times
[2020-10-16 01:39:19,777 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:39:19,778 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611834573]
[2020-10-16 01:39:19,778 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:39:19,811 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:39:20,343 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:39:20,343 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611834573]
[2020-10-16 01:39:20,343 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:39:20,344 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2020-10-16 01:39:20,344 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145857608]
[2020-10-16 01:39:20,344 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-10-16 01:39:20,344 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:39:20,345 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-10-16 01:39:20,345 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2020-10-16 01:39:20,347 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 109 out of 168
[2020-10-16 01:39:20,347 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 45 transitions, 363 flow. Second operand 10 states.
[2020-10-16 01:39:20,348 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:39:20,348 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 168
[2020-10-16 01:39:20,348 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:39:20,707 INFO  L129       PetriNetUnfolder]: 44/161 cut-off events.
[2020-10-16 01:39:20,707 INFO  L130       PetriNetUnfolder]: For 1076/1188 co-relation queries the response was YES.
[2020-10-16 01:39:20,709 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 769 conditions, 161 events. 44/161 cut-off events. For 1076/1188 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 842 event pairs, 0 based on Foata normal form. 22/172 useless extension candidates. Maximal degree in co-relation 731. Up to 50 conditions per place. 
[2020-10-16 01:39:20,710 INFO  L132   encePairwiseOnDemand]: 161/168 looper letters, 12 selfloop transitions, 4 changer transitions 9/53 dead transitions.
[2020-10-16 01:39:20,710 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 53 transitions, 511 flow
[2020-10-16 01:39:20,710 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-10-16 01:39:20,711 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2020-10-16 01:39:20,715 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 889 transitions.
[2020-10-16 01:39:20,716 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.6614583333333334
[2020-10-16 01:39:20,716 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 889 transitions.
[2020-10-16 01:39:20,716 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 889 transitions.
[2020-10-16 01:39:20,717 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:39:20,717 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 889 transitions.
[2020-10-16 01:39:20,720 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 9 states.
[2020-10-16 01:39:20,724 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states.
[2020-10-16 01:39:20,724 INFO  L81            ComplementDD]: Finished complementDD. Result 9 states.
[2020-10-16 01:39:20,725 INFO  L185             Difference]: Start difference. First operand has 78 places, 45 transitions, 363 flow. Second operand 8 states and 889 transitions.
[2020-10-16 01:39:20,725 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 53 transitions, 511 flow
[2020-10-16 01:39:20,730 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 53 transitions, 375 flow, removed 44 selfloop flow, removed 19 redundant places.
[2020-10-16 01:39:20,732 INFO  L241             Difference]: Finished difference. Result has 66 places, 42 transitions, 254 flow
[2020-10-16 01:39:20,732 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=254, PETRI_PLACES=66, PETRI_TRANSITIONS=42}
[2020-10-16 01:39:20,732 INFO  L342   CegarLoopForPetriNet]: 34 programPoint places, 32 predicate places.
[2020-10-16 01:39:20,732 INFO  L481      AbstractCegarLoop]: Abstraction has has 66 places, 42 transitions, 254 flow
[2020-10-16 01:39:20,732 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 10 states.
[2020-10-16 01:39:20,732 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:39:20,733 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]
[2020-10-16 01:39:20,733 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2020-10-16 01:39:20,733 INFO  L429      AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:39:20,733 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:39:20,733 INFO  L82        PathProgramCache]: Analyzing trace with hash 725645438, now seen corresponding path program 2 times
[2020-10-16 01:39:20,733 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:39:20,734 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572330082]
[2020-10-16 01:39:20,734 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:39:20,801 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 01:39:20,801 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 01:39:20,851 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 01:39:20,851 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 01:39:20,901 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-16 01:39:20,902 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-16 01:39:20,903 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2020-10-16 01:39:20,923 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:39:20,923 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:20,928 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:39:20,928 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:20,929 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:39:20,929 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:20,929 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:39:20,929 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:20,930 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:39:20,930 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:20,930 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:39:20,930 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:20,931 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:39:20,931 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:20,931 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:39:20,931 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:20,932 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:39:20,932 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:20,932 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:39:20,932 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:20,932 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:39:20,932 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:20,933 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:39:20,933 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:20,934 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:39:20,934 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:20,934 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:39:20,934 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:20,934 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:39:20,934 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:20,934 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:39:20,935 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:20,935 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:39:20,935 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:20,935 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:39:20,936 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:20,936 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:39:20,936 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:20,940 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:39:20,940 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:20,941 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:39:20,941 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:20,941 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:39:20,941 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:20,941 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:39:20,941 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:20,942 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:39:20,942 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:20,942 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:39:20,942 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:20,942 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:39:20,942 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:20,943 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:39:20,943 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:20,943 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:39:20,943 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:20,943 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:39:20,943 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:20,943 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:39:20,944 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:20,944 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:39:20,944 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:20,944 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:39:20,944 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:20,945 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:39:20,945 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:20,945 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:39:20,946 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:20,946 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:39:20,946 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:20,946 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:39:20,946 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:39:21,035 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:39:21 BasicIcfg
[2020-10-16 01:39:21,035 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-16 01:39:21,037 INFO  L168              Benchmark]: Toolchain (without parser) took 15433.17 ms. Allocated memory was 253.8 MB in the beginning and 631.2 MB in the end (delta: 377.5 MB). Free memory was 208.9 MB in the beginning and 331.8 MB in the end (delta: -122.9 MB). Peak memory consumption was 254.6 MB. Max. memory is 14.2 GB.
[2020-10-16 01:39:21,037 INFO  L168              Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 253.8 MB. Free memory is still 230.1 MB. There was no memory consumed. Max. memory is 14.2 GB.
[2020-10-16 01:39:21,038 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 869.23 ms. Allocated memory was 253.8 MB in the beginning and 320.3 MB in the end (delta: 66.6 MB). Free memory was 208.9 MB in the beginning and 265.9 MB in the end (delta: -57.0 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB.
[2020-10-16 01:39:21,043 INFO  L168              Benchmark]: Boogie Procedure Inliner took 64.05 ms. Allocated memory is still 320.3 MB. Free memory was 265.9 MB in the beginning and 263.4 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:39:21,044 INFO  L168              Benchmark]: Boogie Preprocessor took 38.56 ms. Allocated memory is still 320.3 MB. Free memory was 263.4 MB in the beginning and 260.9 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:39:21,044 INFO  L168              Benchmark]: RCFGBuilder took 1935.07 ms. Allocated memory was 320.3 MB in the beginning and 362.3 MB in the end (delta: 41.9 MB). Free memory was 260.9 MB in the beginning and 184.1 MB in the end (delta: 76.8 MB). Peak memory consumption was 118.7 MB. Max. memory is 14.2 GB.
[2020-10-16 01:39:21,049 INFO  L168              Benchmark]: TraceAbstraction took 12521.06 ms. Allocated memory was 362.3 MB in the beginning and 631.2 MB in the end (delta: 269.0 MB). Free memory was 184.1 MB in the beginning and 331.8 MB in the end (delta: -147.7 MB). Peak memory consumption was 121.3 MB. Max. memory is 14.2 GB.
[2020-10-16 01:39:21,053 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.32 ms. Allocated memory is still 253.8 MB. Free memory is still 230.1 MB. There was no memory consumed. Max. memory is 14.2 GB.
 * CACSL2BoogieTranslator took 869.23 ms. Allocated memory was 253.8 MB in the beginning and 320.3 MB in the end (delta: 66.6 MB). Free memory was 208.9 MB in the beginning and 265.9 MB in the end (delta: -57.0 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB.
 * Boogie Procedure Inliner took 64.05 ms. Allocated memory is still 320.3 MB. Free memory was 265.9 MB in the beginning and 263.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * Boogie Preprocessor took 38.56 ms. Allocated memory is still 320.3 MB. Free memory was 263.4 MB in the beginning and 260.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * RCFGBuilder took 1935.07 ms. Allocated memory was 320.3 MB in the beginning and 362.3 MB in the end (delta: 41.9 MB). Free memory was 260.9 MB in the beginning and 184.1 MB in the end (delta: 76.8 MB). Peak memory consumption was 118.7 MB. Max. memory is 14.2 GB.
 * TraceAbstraction took 12521.06 ms. Allocated memory was 362.3 MB in the beginning and 631.2 MB in the end (delta: 269.0 MB). Free memory was 184.1 MB in the beginning and 331.8 MB in the end (delta: -147.7 MB). Peak memory consumption was 121.3 MB. Max. memory is 14.2 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    1049 VarBasedMoverChecksPositive, 56 VarBasedMoverChecksNegative, 16 SemBasedMoverChecksPositive, 40 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 109 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.3s, 97 PlacesBefore, 34 PlacesAfterwards, 89 TransitionsBefore, 25 TransitionsAfterwards, 1650 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 76 TotalNumberOfCompositions, 4695 MoverChecksTotal
  - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L698]               0  int __unbuffered_cnt = 0;
[L700]               0  int __unbuffered_p2_EAX = 0;
[L701]               0  _Bool main$tmp_guard0;
[L702]               0  _Bool main$tmp_guard1;
[L704]               0  int x = 0;
[L706]               0  int y = 0;
[L708]               0  int z = 0;
[L709]               0  _Bool z$flush_delayed;
[L710]               0  int z$mem_tmp;
[L711]               0  _Bool z$r_buff0_thd0;
[L712]               0  _Bool z$r_buff0_thd1;
[L713]               0  _Bool z$r_buff0_thd2;
[L714]               0  _Bool z$r_buff0_thd3;
[L715]               0  _Bool z$r_buff1_thd0;
[L716]               0  _Bool z$r_buff1_thd1;
[L717]               0  _Bool z$r_buff1_thd2;
[L718]               0  _Bool z$r_buff1_thd3;
[L719]               0  _Bool z$read_delayed;
[L720]               0  int *z$read_delayed_var;
[L721]               0  int z$w_buff0;
[L722]               0  _Bool z$w_buff0_used;
[L723]               0  int z$w_buff1;
[L724]               0  _Bool z$w_buff1_used;
[L725]               0  _Bool weak$$choice0;
[L726]               0  _Bool weak$$choice2;
[L807]               0  pthread_t t2037;
[L808]  FCALL, FORK  0  pthread_create(&t2037, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L809]               0  pthread_t t2038;
[L810]  FCALL, FORK  0  pthread_create(&t2038, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0: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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L730]               1  z$w_buff1 = z$w_buff0
[L731]               1  z$w_buff0 = 2
[L732]               1  z$w_buff1_used = z$w_buff0_used
[L733]               1  z$w_buff0_used = (_Bool)1
[L7]    COND TRUE    1  !expression
[L7]                 1  __VERIFIER_error()
[L735]               1  z$r_buff1_thd0 = z$r_buff0_thd0
[L736]               1  z$r_buff1_thd1 = z$r_buff0_thd1
[L737]               1  z$r_buff1_thd2 = z$r_buff0_thd2
[L738]               1  z$r_buff1_thd3 = z$r_buff0_thd3
[L739]               1  z$r_buff0_thd1 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0: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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L742]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, 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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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  x = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L762]               2  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L811]               0  pthread_t t2039;
[L812]  FCALL, FORK  0  pthread_create(&t2039, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L779]               3  __unbuffered_p2_EAX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L765]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L765]               2  z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L766]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used
[L766]               2  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used
[L767]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used
[L767]               2  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used
[L768]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2
[L768]               2  z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2
[L769]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2
[L769]               2  z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2
[L782]               3  z = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L745]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z)
[L745]               1  z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z)
[L746]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used
[L746]               1  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used
[L747]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used
[L747]               1  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used
[L748]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1
[L748]               1  z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1
[L749]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1
[L749]               1  z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1
[L752]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L754]               1  return 0;
[L772]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L774]               2  return 0;
[L785]  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)
[L785]               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)
[L786]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L786]               3  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L787]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L787]               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
[L788]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L788]               3  z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L789]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L789]               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
[L792]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L794]               3  return 0;
[L814]               0  main$tmp_guard0 = __unbuffered_cnt == 3
[L3]    COND FALSE   0  !(!cond)
[L818]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L818]               0  z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L819]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L819]               0  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L820]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L820]               0  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L821]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L821]               0  z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L822]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L822]               0  z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L825]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L826]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L827]               0  z$flush_delayed = weak$$choice2
[L828]               0  z$mem_tmp = z
[L829]  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)
[L829]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1
[L829]  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)
[L829]               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)
[L830]  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))
[L830]  EXPR         0  !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)
[L830]  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))
[L830]               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))
[L831]  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))
[L831]  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)
[L831]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1
[L831]  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)
[L831]  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))
[L831]               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))
[L832]  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))
[L832]               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))
[L833]  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))
[L833]               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))
[L834]  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))
[L834]  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)
[L834]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L834]  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)
[L834]  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))
[L834]               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))
[L835]  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))
[L835]  EXPR         0  !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)
[L835]  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))
[L835]               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))
[L836]               0  main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1)
[L837]  EXPR         0  z$flush_delayed ? z$mem_tmp : z
[L837]               0  z = z$flush_delayed ? z$mem_tmp : z
[L838]               0  z$flush_delayed = (_Bool)0
[L7]    COND TRUE    0  !expression
[L7]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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 4 procedures, 91 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: 12.2s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 99 SDtfs, 93 SDslu, 101 SDs, 0 SdLazy, 588 SolverSat, 148 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=498occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 248 NumberOfCodeBlocks, 248 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 39337 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...