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


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


This is Ultimate 0.1.25-7bb8cbd
[2020-10-16 01:25:48,390 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-16 01:25:48,392 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-16 01:25:48,428 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-16 01:25:48,428 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-16 01:25:48,436 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-16 01:25:48,439 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-16 01:25:48,443 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-16 01:25:48,446 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-16 01:25:48,449 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-16 01:25:48,450 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-16 01:25:48,451 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-16 01:25:48,451 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-16 01:25:48,454 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-16 01:25:48,456 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-16 01:25:48,458 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-16 01:25:48,459 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-16 01:25:48,461 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-16 01:25:48,463 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-16 01:25:48,471 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-16 01:25:48,473 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-16 01:25:48,474 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-16 01:25:48,475 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-16 01:25:48,476 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-16 01:25:48,488 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-16 01:25:48,488 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-16 01:25:48,488 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-16 01:25:48,495 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-16 01:25:48,496 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-16 01:25:48,497 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-16 01:25:48,500 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-16 01:25:48,501 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-16 01:25:48,502 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-16 01:25:48,503 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-16 01:25:48,503 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-16 01:25:48,504 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-16 01:25:48,504 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-16 01:25:48,505 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-16 01:25:48,505 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-16 01:25:48,507 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-16 01:25:48,509 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-16 01:25:48,510 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:25:48,554 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-16 01:25:48,554 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-16 01:25:48,555 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-16 01:25:48,555 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-16 01:25:48,556 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-16 01:25:48,556 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-16 01:25:48,556 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-16 01:25:48,556 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-16 01:25:48,557 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-16 01:25:48,557 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-16 01:25:48,557 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-16 01:25:48,557 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-16 01:25:48,557 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-16 01:25:48,557 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-16 01:25:48,558 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-16 01:25:48,558 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-16 01:25:48,558 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-16 01:25:48,558 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-16 01:25:48,558 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-16 01:25:48,559 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-16 01:25:48,559 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-16 01:25:48,559 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 01:25:48,559 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-16 01:25:48,559 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-16 01:25:48,560 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-16 01:25:48,560 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-16 01:25:48,560 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-16 01:25:48,560 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2020-10-16 01:25:48,560 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-16 01:25:48,840 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-16 01:25:48,852 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-16 01:25:48,855 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-16 01:25:48,857 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-16 01:25:48,857 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-16 01:25:48,858 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i
[2020-10-16 01:25:48,925 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0211d8a2c/bf205db9ccc3460caa75cca20544b2af/FLAGfa574d0ee
[2020-10-16 01:25:49,464 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-16 01:25:49,465 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i
[2020-10-16 01:25:49,491 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0211d8a2c/bf205db9ccc3460caa75cca20544b2af/FLAGfa574d0ee
[2020-10-16 01:25:49,762 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0211d8a2c/bf205db9ccc3460caa75cca20544b2af
[2020-10-16 01:25:49,771 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-16 01:25:49,773 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-16 01:25:49,774 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-16 01:25:49,774 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-16 01:25:49,778 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-16 01:25:49,779 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:25:49" (1/1) ...
[2020-10-16 01:25:49,782 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4874472d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:49, skipping insertion in model container
[2020-10-16 01:25:49,782 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:25:49" (1/1) ...
[2020-10-16 01:25:49,790 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-16 01:25:49,834 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-16 01:25:50,296 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 01:25:50,313 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-16 01:25:50,432 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 01:25:50,511 INFO  L208         MainTranslator]: Completed translation
[2020-10-16 01:25:50,512 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:50 WrapperNode
[2020-10-16 01:25:50,512 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-16 01:25:50,513 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-16 01:25:50,513 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-16 01:25:50,513 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-16 01:25:50,522 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:25:50" (1/1) ...
[2020-10-16 01:25:50,543 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:25:50" (1/1) ...
[2020-10-16 01:25:50,583 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-16 01:25:50,583 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-16 01:25:50,583 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-16 01:25:50,584 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-16 01:25:50,594 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:50" (1/1) ...
[2020-10-16 01:25:50,594 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:50" (1/1) ...
[2020-10-16 01:25:50,600 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:50" (1/1) ...
[2020-10-16 01:25:50,601 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:50" (1/1) ...
[2020-10-16 01:25:50,611 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:50" (1/1) ...
[2020-10-16 01:25:50,616 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:50" (1/1) ...
[2020-10-16 01:25:50,622 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:50" (1/1) ...
[2020-10-16 01:25:50,628 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-16 01:25:50,628 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-16 01:25:50,628 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-16 01:25:50,629 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-16 01:25:50,629 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:50" (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:25:50,711 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-16 01:25:50,711 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-16 01:25:50,711 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-16 01:25:50,711 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-16 01:25:50,711 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-16 01:25:50,712 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-16 01:25:50,713 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-16 01:25:50,713 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-16 01:25:50,714 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-16 01:25:50,714 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-16 01:25:50,716 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2020-10-16 01:25:50,716 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2020-10-16 01:25:50,717 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-16 01:25:50,717 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-16 01:25:50,717 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-16 01:25:50,719 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:25:52,862 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-16 01:25:52,862 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-16 01:25:52,864 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:25:52 BoogieIcfgContainer
[2020-10-16 01:25:52,865 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-16 01:25:52,866 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-16 01:25:52,866 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-16 01:25:52,870 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-16 01:25:52,870 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:25:49" (1/3) ...
[2020-10-16 01:25:52,871 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d92b1ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:25:52, skipping insertion in model container
[2020-10-16 01:25:52,871 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:50" (2/3) ...
[2020-10-16 01:25:52,872 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d92b1ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:25:52, skipping insertion in model container
[2020-10-16 01:25:52,872 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:25:52" (3/3) ...
[2020-10-16 01:25:52,874 INFO  L111   eAbstractionObserver]: Analyzing ICFG mix040_tso.oepc.i
[2020-10-16 01:25:52,886 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-16 01:25:52,894 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-16 01:25:52,895 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-16 01:25:52,928 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,928 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,929 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,929 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,929 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,930 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,930 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,930 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,931 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,931 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,931 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,931 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,932 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,932 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,932 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,932 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,932 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,933 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,933 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,934 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,934 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,935 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,935 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,935 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,935 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,936 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,936 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,936 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,936 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,937 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,937 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,937 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,937 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,937 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,938 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,938 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,939 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,939 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,939 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,940 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,940 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,940 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,940 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,941 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,941 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,941 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,941 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,942 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,942 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,946 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,946 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,947 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,947 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,947 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,947 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,948 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,948 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,948 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,948 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,949 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,949 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,954 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,955 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,955 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,955 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,955 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,955 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,956 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,956 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,956 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,956 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,958 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,959 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,959 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,959 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,961 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,961 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,961 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,961 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,962 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,962 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,962 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,962 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,963 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,963 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:25:52,981 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2020-10-16 01:25:53,003 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-16 01:25:53,003 INFO  L378      AbstractCegarLoop]: Hoare is false
[2020-10-16 01:25:53,003 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-16 01:25:53,003 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-16 01:25:53,003 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-16 01:25:53,004 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-16 01:25:53,004 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-16 01:25:53,004 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-16 01:25:53,019 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 246 flow
[2020-10-16 01:25:53,110 INFO  L129       PetriNetUnfolder]: 2/109 cut-off events.
[2020-10-16 01:25:53,110 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 01:25:53,115 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 122 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. 
[2020-10-16 01:25:53,116 INFO  L82        GeneralOperation]: Start removeDead. Operand has 124 places, 113 transitions, 246 flow
[2020-10-16 01:25:53,123 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 120 places, 109 transitions, 230 flow
[2020-10-16 01:25:53,126 INFO  L129   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-16 01:25:53,129 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 109 transitions, 230 flow
[2020-10-16 01:25:53,133 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 109 transitions, 230 flow
[2020-10-16 01:25:53,134 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 120 places, 109 transitions, 230 flow
[2020-10-16 01:25:53,163 INFO  L129       PetriNetUnfolder]: 2/109 cut-off events.
[2020-10-16 01:25:53,164 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 01:25:53,165 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 122 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. 
[2020-10-16 01:25:53,169 INFO  L117        LiptonReduction]: Number of co-enabled transitions 2670
[2020-10-16 01:25:53,317 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:25:53,318 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:53,321 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:25:53,321 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:53,363 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:25:53,363 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:53,365 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:25:53,366 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:53,413 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:53,414 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:53,415 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:53,416 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:53,420 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:53,420 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:25:53,423 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:25:53,424 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:25:53,444 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:25:53,445 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:53,446 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:53,446 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:53,450 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:53,450 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:25:53,453 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:25:53,454 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:25:53,521 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:25:53,521 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:53,523 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:25:53,523 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:53,554 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:25:53,555 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:53,556 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:25:53,557 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:53,586 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:53,587 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:53,588 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:53,588 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:53,591 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:53,591 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:25:53,594 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:25:53,595 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:25:53,613 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:53,613 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:53,614 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:53,615 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:53,618 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:53,618 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:25:53,620 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:25:53,621 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:25:53,924 WARN  L193               SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-16 01:25:54,032 WARN  L193               SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 53
[2020-10-16 01:25:54,112 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:25:54,113 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:54,114 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:25:54,114 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:54,136 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:25:54,136 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:54,137 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:25:54,137 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:54,429 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:25:54,429 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:54,430 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:54,431 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:54,433 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:54,433 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:25:54,435 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:25:54,436 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:25:54,454 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:25:54,454 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:54,455 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:54,456 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:54,458 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:54,458 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:25:54,460 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:25:54,460 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:25:54,501 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:54,501 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:54,502 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:54,502 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:54,504 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:54,505 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:25:54,507 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:25:54,507 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:25:54,522 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:25:54,522 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:54,523 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:54,523 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:54,525 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:54,526 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:25:54,528 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:25:54,528 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:25:54,600 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:25:54,601 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:54,602 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:25:54,602 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:54,626 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:25:54,626 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:54,627 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:25:54,628 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:54,654 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:25:54,654 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:54,655 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:25:54,656 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:54,669 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:25:54,669 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:54,670 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:25:54,670 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:54,702 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:25:54,702 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:54,703 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:25:54,704 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:54,723 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:25:54,724 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:54,725 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:25:54,725 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:56,220 WARN  L193               SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 230 DAG size of output: 189
[2020-10-16 01:25:56,231 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2020-10-16 01:25:56,231 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:56,232 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:25:56,232 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:57,045 WARN  L193               SmtUtils]: Spent 805.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 127
[2020-10-16 01:25:57,058 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:25:57,059 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:57,060 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:25:57,064 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:57,081 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:25:57,081 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:57,082 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:25:57,083 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:57,186 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:25:57,187 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:57,187 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:57,188 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:57,190 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:57,190 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:25:57,196 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:25:57,197 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:25:57,212 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:25:57,213 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:57,214 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:57,214 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:57,216 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:57,217 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:25:57,219 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:25:57,220 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:25:57,375 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:25:57,376 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:25:57,378 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:25:57,378 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:57,398 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:25:57,398 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:57,399 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-16 01:25:57,400 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:57,400 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:57,401 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:57,402 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:57,402 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:57,404 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:57,404 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:57,406 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:57,406 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:57,409 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:25:57,410 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:57,411 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:57,411 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:57,414 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:57,414 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:57,465 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:25:57,465 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:25:57,468 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:25:57,468 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:57,485 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:25:57,486 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:57,486 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-16 01:25:57,487 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:57,487 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:57,488 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:57,489 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:57,489 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:57,492 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:57,492 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:57,493 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:57,494 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:57,495 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:25:57,496 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:57,497 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:57,497 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:57,498 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:57,499 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:57,593 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:25:57,594 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:57,595 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-16 01:25:57,595 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:57,596 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:57,596 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:57,597 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:57,597 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:57,599 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:57,600 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:57,601 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:57,602 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:57,603 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:25:57,603 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:57,605 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:57,606 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:57,607 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:57,607 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:57,629 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:25:57,630 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:25:57,633 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:25:57,633 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:57,757 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:25:57,758 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:57,759 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-16 01:25:57,759 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:57,760 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:57,760 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:57,761 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:57,761 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:57,764 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:57,764 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:57,765 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:57,766 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:57,767 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:25:57,768 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:57,770 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:57,770 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:57,771 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:57,772 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:57,790 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:25:57,790 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:25:57,792 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:25:57,793 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:57,928 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:25:57,928 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:25:57,965 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:25:57,966 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:57,982 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:25:57,983 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:57,984 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-16 01:25:57,985 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:57,986 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:57,986 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:57,987 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:57,987 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:57,990 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:57,990 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:57,991 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:57,991 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:57,993 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:25:57,994 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:57,997 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:57,998 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:57,999 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:57,999 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:58,291 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:25:58,292 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:58,293 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-16 01:25:58,293 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:58,294 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:58,294 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:58,295 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:58,295 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:25:58,296 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:58,296 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:58,297 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:58,298 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:58,300 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:25:58,300 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:58,301 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:58,301 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:58,302 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:25:58,303 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:58,320 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:25:58,321 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:25:58,322 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:25:58,323 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:25:58,630 WARN  L193               SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 58
[2020-10-16 01:25:59,503 WARN  L193               SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93
[2020-10-16 01:25:59,666 WARN  L193               SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 91
[2020-10-16 01:25:59,806 WARN  L193               SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 95
[2020-10-16 01:25:59,937 WARN  L193               SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 95
[2020-10-16 01:25:59,944 INFO  L132        LiptonReduction]: Checked pairs total: 7608
[2020-10-16 01:25:59,945 INFO  L134        LiptonReduction]: Total number of compositions: 91
[2020-10-16 01:25:59,949 INFO  L182   CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6825
[2020-10-16 01:25:59,956 INFO  L129       PetriNetUnfolder]: 0/14 cut-off events.
[2020-10-16 01:25:59,956 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 01:25:59,957 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:25:59,957 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:25:59,958 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:25:59,962 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:25:59,962 INFO  L82        PathProgramCache]: Analyzing trace with hash 397162831, now seen corresponding path program 1 times
[2020-10-16 01:25:59,971 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:25:59,972 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937058769]
[2020-10-16 01:25:59,972 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:26:00,138 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:26:00,234 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:26:00,235 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937058769]
[2020-10-16 01:26:00,236 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:26:00,236 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 01:26:00,236 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899879099]
[2020-10-16 01:26:00,247 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 01:26:00,248 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:26:00,264 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 01:26:00,267 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 01:26:00,269 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 175 out of 204
[2020-10-16 01:26:00,271 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states.
[2020-10-16 01:26:00,271 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:26:00,271 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 204
[2020-10-16 01:26:00,273 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:26:00,362 INFO  L129       PetriNetUnfolder]: 49/137 cut-off events.
[2020-10-16 01:26:00,362 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 01:26:00,364 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 236 conditions, 137 events. 49/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 613 event pairs, 9 based on Foata normal form. 11/137 useless extension candidates. Maximal degree in co-relation 225. Up to 65 conditions per place. 
[2020-10-16 01:26:00,366 INFO  L132   encePairwiseOnDemand]: 200/204 looper letters, 9 selfloop transitions, 2 changer transitions 0/33 dead transitions.
[2020-10-16 01:26:00,366 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 33 transitions, 100 flow
[2020-10-16 01:26:00,367 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 01:26:00,370 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2020-10-16 01:26:00,381 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 539 transitions.
[2020-10-16 01:26:00,385 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.880718954248366
[2020-10-16 01:26:00,386 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 539 transitions.
[2020-10-16 01:26:00,386 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 539 transitions.
[2020-10-16 01:26:00,389 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:26:00,392 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 539 transitions.
[2020-10-16 01:26:00,396 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 4 states.
[2020-10-16 01:26:00,404 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states.
[2020-10-16 01:26:00,405 INFO  L81            ComplementDD]: Finished complementDD. Result 4 states.
[2020-10-16 01:26:00,407 INFO  L185             Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 539 transitions.
[2020-10-16 01:26:00,408 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 33 transitions, 100 flow
[2020-10-16 01:26:00,412 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 33 transitions, 96 flow, removed 0 selfloop flow, removed 4 redundant places.
[2020-10-16 01:26:00,414 INFO  L241             Difference]: Finished difference. Result has 40 places, 29 transitions, 70 flow
[2020-10-16 01:26:00,417 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=40, PETRI_TRANSITIONS=29}
[2020-10-16 01:26:00,418 INFO  L342   CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places.
[2020-10-16 01:26:00,418 INFO  L481      AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 70 flow
[2020-10-16 01:26:00,418 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 01:26:00,418 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:26:00,418 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:26:00,419 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-16 01:26:00,419 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:26:00,419 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:26:00,419 INFO  L82        PathProgramCache]: Analyzing trace with hash -136611943, now seen corresponding path program 1 times
[2020-10-16 01:26:00,419 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:26:00,420 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642871224]
[2020-10-16 01:26:00,420 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:26:00,480 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:26:00,612 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:26:00,613 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642871224]
[2020-10-16 01:26:00,613 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:26:00,613 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 01:26:00,613 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129564990]
[2020-10-16 01:26:00,615 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 01:26:00,615 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:26:00,615 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 01:26:00,616 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 01:26:00,619 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 156 out of 204
[2020-10-16 01:26:00,620 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 70 flow. Second operand 4 states.
[2020-10-16 01:26:00,620 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:26:00,620 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 204
[2020-10-16 01:26:00,620 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:26:00,855 INFO  L129       PetriNetUnfolder]: 455/762 cut-off events.
[2020-10-16 01:26:00,856 INFO  L130       PetriNetUnfolder]: For 68/68 co-relation queries the response was YES.
[2020-10-16 01:26:00,859 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 1509 conditions, 762 events. 455/762 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4280 event pairs, 210 based on Foata normal form. 0/703 useless extension candidates. Maximal degree in co-relation 1500. Up to 423 conditions per place. 
[2020-10-16 01:26:00,864 INFO  L132   encePairwiseOnDemand]: 197/204 looper letters, 11 selfloop transitions, 4 changer transitions 14/47 dead transitions.
[2020-10-16 01:26:00,864 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 47 transitions, 170 flow
[2020-10-16 01:26:00,865 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 01:26:00,865 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-10-16 01:26:00,867 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 811 transitions.
[2020-10-16 01:26:00,868 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7950980392156862
[2020-10-16 01:26:00,868 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 811 transitions.
[2020-10-16 01:26:00,868 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 811 transitions.
[2020-10-16 01:26:00,869 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:26:00,869 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 811 transitions.
[2020-10-16 01:26:00,871 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 6 states.
[2020-10-16 01:26:00,873 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states.
[2020-10-16 01:26:00,873 INFO  L81            ComplementDD]: Finished complementDD. Result 6 states.
[2020-10-16 01:26:00,874 INFO  L185             Difference]: Start difference. First operand has 40 places, 29 transitions, 70 flow. Second operand 5 states and 811 transitions.
[2020-10-16 01:26:00,874 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 47 transitions, 170 flow
[2020-10-16 01:26:00,875 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 47 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places.
[2020-10-16 01:26:00,876 INFO  L241             Difference]: Finished difference. Result has 45 places, 31 transitions, 100 flow
[2020-10-16 01:26:00,876 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=100, PETRI_PLACES=45, PETRI_TRANSITIONS=31}
[2020-10-16 01:26:00,877 INFO  L342   CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places.
[2020-10-16 01:26:00,877 INFO  L481      AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 100 flow
[2020-10-16 01:26:00,877 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 01:26:00,877 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:26:00,877 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:26:00,878 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-16 01:26:00,878 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:26:00,878 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:26:00,878 INFO  L82        PathProgramCache]: Analyzing trace with hash -558163680, now seen corresponding path program 1 times
[2020-10-16 01:26:00,878 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:26:00,879 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632340838]
[2020-10-16 01:26:00,879 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:26:00,941 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:26:00,994 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:26:00,995 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632340838]
[2020-10-16 01:26:00,995 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:26:00,995 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 01:26:00,995 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16708450]
[2020-10-16 01:26:00,996 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 01:26:00,996 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:26:00,996 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 01:26:00,996 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 01:26:00,998 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 157 out of 204
[2020-10-16 01:26:00,998 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 100 flow. Second operand 4 states.
[2020-10-16 01:26:00,998 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:26:00,998 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 204
[2020-10-16 01:26:00,999 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:26:01,245 INFO  L129       PetriNetUnfolder]: 396/757 cut-off events.
[2020-10-16 01:26:01,245 INFO  L130       PetriNetUnfolder]: For 455/474 co-relation queries the response was YES.
[2020-10-16 01:26:01,249 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 1773 conditions, 757 events. 396/757 cut-off events. For 455/474 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4363 event pairs, 170 based on Foata normal form. 43/760 useless extension candidates. Maximal degree in co-relation 1761. Up to 448 conditions per place. 
[2020-10-16 01:26:01,254 INFO  L132   encePairwiseOnDemand]: 199/204 looper letters, 11 selfloop transitions, 4 changer transitions 9/45 dead transitions.
[2020-10-16 01:26:01,254 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 193 flow
[2020-10-16 01:26:01,255 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 01:26:01,256 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-10-16 01:26:01,258 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 809 transitions.
[2020-10-16 01:26:01,258 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7931372549019607
[2020-10-16 01:26:01,259 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 809 transitions.
[2020-10-16 01:26:01,259 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 809 transitions.
[2020-10-16 01:26:01,259 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:26:01,260 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 809 transitions.
[2020-10-16 01:26:01,261 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 6 states.
[2020-10-16 01:26:01,263 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states.
[2020-10-16 01:26:01,263 INFO  L81            ComplementDD]: Finished complementDD. Result 6 states.
[2020-10-16 01:26:01,264 INFO  L185             Difference]: Start difference. First operand has 45 places, 31 transitions, 100 flow. Second operand 5 states and 809 transitions.
[2020-10-16 01:26:01,264 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 193 flow
[2020-10-16 01:26:01,267 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 186 flow, removed 1 selfloop flow, removed 2 redundant places.
[2020-10-16 01:26:01,269 INFO  L241             Difference]: Finished difference. Result has 47 places, 34 transitions, 134 flow
[2020-10-16 01:26:01,269 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=134, PETRI_PLACES=47, PETRI_TRANSITIONS=34}
[2020-10-16 01:26:01,269 INFO  L342   CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places.
[2020-10-16 01:26:01,269 INFO  L481      AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 134 flow
[2020-10-16 01:26:01,269 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 01:26:01,269 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:26:01,270 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:26:01,270 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-16 01:26:01,270 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:26:01,270 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:26:01,270 INFO  L82        PathProgramCache]: Analyzing trace with hash 793030777, now seen corresponding path program 1 times
[2020-10-16 01:26:01,271 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:26:01,271 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829461640]
[2020-10-16 01:26:01,271 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:26:01,292 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:26:01,354 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:26:01,355 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829461640]
[2020-10-16 01:26:01,355 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:26:01,355 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 01:26:01,356 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531784032]
[2020-10-16 01:26:01,358 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 01:26:01,358 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:26:01,359 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 01:26:01,359 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 01:26:01,360 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 173 out of 204
[2020-10-16 01:26:01,361 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 134 flow. Second operand 4 states.
[2020-10-16 01:26:01,361 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:26:01,361 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 204
[2020-10-16 01:26:01,361 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:26:01,415 INFO  L129       PetriNetUnfolder]: 33/139 cut-off events.
[2020-10-16 01:26:01,415 INFO  L130       PetriNetUnfolder]: For 193/262 co-relation queries the response was YES.
[2020-10-16 01:26:01,417 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 371 conditions, 139 events. 33/139 cut-off events. For 193/262 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 633 event pairs, 13 based on Foata normal form. 9/137 useless extension candidates. Maximal degree in co-relation 356. Up to 49 conditions per place. 
[2020-10-16 01:26:01,418 INFO  L132   encePairwiseOnDemand]: 199/204 looper letters, 4 selfloop transitions, 5 changer transitions 5/41 dead transitions.
[2020-10-16 01:26:01,418 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 41 transitions, 204 flow
[2020-10-16 01:26:01,419 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 01:26:01,419 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-10-16 01:26:01,421 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 879 transitions.
[2020-10-16 01:26:01,421 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.861764705882353
[2020-10-16 01:26:01,422 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 879 transitions.
[2020-10-16 01:26:01,422 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 879 transitions.
[2020-10-16 01:26:01,422 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:26:01,423 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 879 transitions.
[2020-10-16 01:26:01,424 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 6 states.
[2020-10-16 01:26:01,426 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states.
[2020-10-16 01:26:01,426 INFO  L81            ComplementDD]: Finished complementDD. Result 6 states.
[2020-10-16 01:26:01,426 INFO  L185             Difference]: Start difference. First operand has 47 places, 34 transitions, 134 flow. Second operand 5 states and 879 transitions.
[2020-10-16 01:26:01,426 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 41 transitions, 204 flow
[2020-10-16 01:26:01,428 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 41 transitions, 198 flow, removed 1 selfloop flow, removed 2 redundant places.
[2020-10-16 01:26:01,430 INFO  L241             Difference]: Finished difference. Result has 50 places, 36 transitions, 169 flow
[2020-10-16 01:26:01,430 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=50, PETRI_TRANSITIONS=36}
[2020-10-16 01:26:01,430 INFO  L342   CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places.
[2020-10-16 01:26:01,431 INFO  L481      AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 169 flow
[2020-10-16 01:26:01,431 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 01:26:01,431 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:26:01,431 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:26:01,431 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-16 01:26:01,431 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:26:01,432 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:26:01,432 INFO  L82        PathProgramCache]: Analyzing trace with hash -889811352, now seen corresponding path program 1 times
[2020-10-16 01:26:01,432 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:26:01,433 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660230895]
[2020-10-16 01:26:01,433 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:26:01,464 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:26:01,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:26:01,535 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660230895]
[2020-10-16 01:26:01,535 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:26:01,536 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 01:26:01,536 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762496145]
[2020-10-16 01:26:01,536 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 01:26:01,536 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:26:01,537 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 01:26:01,537 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 01:26:01,538 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 175 out of 204
[2020-10-16 01:26:01,539 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 169 flow. Second operand 4 states.
[2020-10-16 01:26:01,539 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:26:01,539 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 204
[2020-10-16 01:26:01,539 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:26:01,587 INFO  L129       PetriNetUnfolder]: 25/115 cut-off events.
[2020-10-16 01:26:01,587 INFO  L130       PetriNetUnfolder]: For 272/323 co-relation queries the response was YES.
[2020-10-16 01:26:01,588 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 343 conditions, 115 events. 25/115 cut-off events. For 272/323 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 476 event pairs, 6 based on Foata normal form. 6/111 useless extension candidates. Maximal degree in co-relation 325. Up to 43 conditions per place. 
[2020-10-16 01:26:01,589 INFO  L132   encePairwiseOnDemand]: 200/204 looper letters, 2 selfloop transitions, 3 changer transitions 2/38 dead transitions.
[2020-10-16 01:26:01,589 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 38 transitions, 197 flow
[2020-10-16 01:26:01,590 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 01:26:01,590 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-10-16 01:26:01,592 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 883 transitions.
[2020-10-16 01:26:01,592 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.865686274509804
[2020-10-16 01:26:01,593 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 883 transitions.
[2020-10-16 01:26:01,593 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 883 transitions.
[2020-10-16 01:26:01,593 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:26:01,594 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 883 transitions.
[2020-10-16 01:26:01,595 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 6 states.
[2020-10-16 01:26:01,597 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states.
[2020-10-16 01:26:01,597 INFO  L81            ComplementDD]: Finished complementDD. Result 6 states.
[2020-10-16 01:26:01,597 INFO  L185             Difference]: Start difference. First operand has 50 places, 36 transitions, 169 flow. Second operand 5 states and 883 transitions.
[2020-10-16 01:26:01,598 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 38 transitions, 197 flow
[2020-10-16 01:26:01,600 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 38 transitions, 176 flow, removed 8 selfloop flow, removed 3 redundant places.
[2020-10-16 01:26:01,601 INFO  L241             Difference]: Finished difference. Result has 52 places, 36 transitions, 165 flow
[2020-10-16 01:26:01,601 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=165, PETRI_PLACES=52, PETRI_TRANSITIONS=36}
[2020-10-16 01:26:01,601 INFO  L342   CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places.
[2020-10-16 01:26:01,602 INFO  L481      AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 165 flow
[2020-10-16 01:26:01,602 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 01:26:01,602 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:26:01,602 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:26:01,602 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-16 01:26:01,602 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:26:01,602 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:26:01,603 INFO  L82        PathProgramCache]: Analyzing trace with hash -807980741, now seen corresponding path program 1 times
[2020-10-16 01:26:01,603 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:26:01,603 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415019067]
[2020-10-16 01:26:01,603 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:26:01,620 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:26:01,693 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:26:01,693 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415019067]
[2020-10-16 01:26:01,693 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:26:01,694 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 01:26:01,694 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200716042]
[2020-10-16 01:26:01,694 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 01:26:01,694 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:26:01,695 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 01:26:01,695 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 01:26:01,696 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 155 out of 204
[2020-10-16 01:26:01,697 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 36 transitions, 165 flow. Second operand 5 states.
[2020-10-16 01:26:01,697 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:26:01,697 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 204
[2020-10-16 01:26:01,697 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:26:01,972 INFO  L129       PetriNetUnfolder]: 406/771 cut-off events.
[2020-10-16 01:26:01,972 INFO  L130       PetriNetUnfolder]: For 1958/2067 co-relation queries the response was YES.
[2020-10-16 01:26:01,978 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 2314 conditions, 771 events. 406/771 cut-off events. For 1958/2067 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4440 event pairs, 150 based on Foata normal form. 53/756 useless extension candidates. Maximal degree in co-relation 2294. Up to 457 conditions per place. 
[2020-10-16 01:26:01,984 INFO  L132   encePairwiseOnDemand]: 196/204 looper letters, 11 selfloop transitions, 15 changer transitions 10/60 dead transitions.
[2020-10-16 01:26:01,984 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 60 transitions, 349 flow
[2020-10-16 01:26:01,985 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 01:26:01,985 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2020-10-16 01:26:01,988 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 960 transitions.
[2020-10-16 01:26:01,989 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7843137254901961
[2020-10-16 01:26:01,989 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 960 transitions.
[2020-10-16 01:26:01,989 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 960 transitions.
[2020-10-16 01:26:01,990 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:26:01,990 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 960 transitions.
[2020-10-16 01:26:01,992 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 7 states.
[2020-10-16 01:26:01,995 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states.
[2020-10-16 01:26:01,995 INFO  L81            ComplementDD]: Finished complementDD. Result 7 states.
[2020-10-16 01:26:01,996 INFO  L185             Difference]: Start difference. First operand has 52 places, 36 transitions, 165 flow. Second operand 6 states and 960 transitions.
[2020-10-16 01:26:01,996 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 60 transitions, 349 flow
[2020-10-16 01:26:02,002 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 60 transitions, 327 flow, removed 8 selfloop flow, removed 5 redundant places.
[2020-10-16 01:26:02,004 INFO  L241             Difference]: Finished difference. Result has 54 places, 49 transitions, 286 flow
[2020-10-16 01:26:02,005 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=286, PETRI_PLACES=54, PETRI_TRANSITIONS=49}
[2020-10-16 01:26:02,005 INFO  L342   CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places.
[2020-10-16 01:26:02,005 INFO  L481      AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 286 flow
[2020-10-16 01:26:02,005 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 01:26:02,005 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:26:02,006 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:26:02,006 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-16 01:26:02,006 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:26:02,007 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:26:02,007 INFO  L82        PathProgramCache]: Analyzing trace with hash -774267023, now seen corresponding path program 1 times
[2020-10-16 01:26:02,007 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:26:02,007 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162590683]
[2020-10-16 01:26:02,008 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:26:02,025 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:26:02,109 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:26:02,110 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162590683]
[2020-10-16 01:26:02,110 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:26:02,110 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 01:26:02,110 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446598627]
[2020-10-16 01:26:02,111 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 01:26:02,111 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:26:02,111 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 01:26:02,112 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-16 01:26:02,114 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 156 out of 204
[2020-10-16 01:26:02,115 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 286 flow. Second operand 6 states.
[2020-10-16 01:26:02,115 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:26:02,115 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 204
[2020-10-16 01:26:02,115 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:26:02,471 INFO  L129       PetriNetUnfolder]: 364/693 cut-off events.
[2020-10-16 01:26:02,471 INFO  L130       PetriNetUnfolder]: For 1957/2204 co-relation queries the response was YES.
[2020-10-16 01:26:02,476 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 2480 conditions, 693 events. 364/693 cut-off events. For 1957/2204 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3768 event pairs, 82 based on Foata normal form. 52/698 useless extension candidates. Maximal degree in co-relation 2459. Up to 381 conditions per place. 
[2020-10-16 01:26:02,482 INFO  L132   encePairwiseOnDemand]: 196/204 looper letters, 16 selfloop transitions, 20 changer transitions 13/73 dead transitions.
[2020-10-16 01:26:02,483 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 73 transitions, 514 flow
[2020-10-16 01:26:02,483 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 01:26:02,483 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-10-16 01:26:02,486 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1125 transitions.
[2020-10-16 01:26:02,487 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7878151260504201
[2020-10-16 01:26:02,487 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1125 transitions.
[2020-10-16 01:26:02,487 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1125 transitions.
[2020-10-16 01:26:02,488 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:26:02,488 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1125 transitions.
[2020-10-16 01:26:02,490 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 8 states.
[2020-10-16 01:26:02,493 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states.
[2020-10-16 01:26:02,493 INFO  L81            ComplementDD]: Finished complementDD. Result 8 states.
[2020-10-16 01:26:02,493 INFO  L185             Difference]: Start difference. First operand has 54 places, 49 transitions, 286 flow. Second operand 7 states and 1125 transitions.
[2020-10-16 01:26:02,493 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 73 transitions, 514 flow
[2020-10-16 01:26:02,496 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 73 transitions, 512 flow, removed 1 selfloop flow, removed 1 redundant places.
[2020-10-16 01:26:02,498 INFO  L241             Difference]: Finished difference. Result has 62 places, 56 transitions, 415 flow
[2020-10-16 01:26:02,499 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=415, PETRI_PLACES=62, PETRI_TRANSITIONS=56}
[2020-10-16 01:26:02,499 INFO  L342   CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places.
[2020-10-16 01:26:02,499 INFO  L481      AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 415 flow
[2020-10-16 01:26:02,499 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 01:26:02,499 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:26:02,499 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:26:02,500 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-16 01:26:02,500 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:26:02,500 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:26:02,500 INFO  L82        PathProgramCache]: Analyzing trace with hash 1847943633, now seen corresponding path program 1 times
[2020-10-16 01:26:02,500 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:26:02,501 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482122525]
[2020-10-16 01:26:02,501 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:26:02,517 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:26:02,601 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:26:02,602 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482122525]
[2020-10-16 01:26:02,602 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:26:02,602 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 01:26:02,602 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374458264]
[2020-10-16 01:26:02,603 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 01:26:02,603 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:26:02,603 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 01:26:02,604 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-16 01:26:02,605 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 152 out of 204
[2020-10-16 01:26:02,606 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 415 flow. Second operand 6 states.
[2020-10-16 01:26:02,606 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:26:02,606 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 204
[2020-10-16 01:26:02,607 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:26:02,893 INFO  L129       PetriNetUnfolder]: 337/653 cut-off events.
[2020-10-16 01:26:02,893 INFO  L130       PetriNetUnfolder]: For 3448/3987 co-relation queries the response was YES.
[2020-10-16 01:26:02,898 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 3007 conditions, 653 events. 337/653 cut-off events. For 3448/3987 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3600 event pairs, 113 based on Foata normal form. 59/665 useless extension candidates. Maximal degree in co-relation 2980. Up to 390 conditions per place. 
[2020-10-16 01:26:02,903 INFO  L132   encePairwiseOnDemand]: 197/204 looper letters, 19 selfloop transitions, 20 changer transitions 8/71 dead transitions.
[2020-10-16 01:26:02,904 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 71 transitions, 627 flow
[2020-10-16 01:26:02,905 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 01:26:02,905 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2020-10-16 01:26:02,907 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 939 transitions.
[2020-10-16 01:26:02,907 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7671568627450981
[2020-10-16 01:26:02,908 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 939 transitions.
[2020-10-16 01:26:02,908 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 939 transitions.
[2020-10-16 01:26:02,908 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:26:02,909 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 939 transitions.
[2020-10-16 01:26:02,910 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 7 states.
[2020-10-16 01:26:02,912 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states.
[2020-10-16 01:26:02,912 INFO  L81            ComplementDD]: Finished complementDD. Result 7 states.
[2020-10-16 01:26:02,912 INFO  L185             Difference]: Start difference. First operand has 62 places, 56 transitions, 415 flow. Second operand 6 states and 939 transitions.
[2020-10-16 01:26:02,913 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 71 transitions, 627 flow
[2020-10-16 01:26:02,918 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 71 transitions, 602 flow, removed 5 selfloop flow, removed 2 redundant places.
[2020-10-16 01:26:02,920 INFO  L241             Difference]: Finished difference. Result has 66 places, 61 transitions, 522 flow
[2020-10-16 01:26:02,920 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=522, PETRI_PLACES=66, PETRI_TRANSITIONS=61}
[2020-10-16 01:26:02,921 INFO  L342   CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places.
[2020-10-16 01:26:02,921 INFO  L481      AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 522 flow
[2020-10-16 01:26:02,921 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 01:26:02,921 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:26:02,921 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:26:02,921 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-16 01:26:02,922 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:26:02,922 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:26:02,922 INFO  L82        PathProgramCache]: Analyzing trace with hash -1078594155, now seen corresponding path program 1 times
[2020-10-16 01:26:02,922 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:26:02,922 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552779104]
[2020-10-16 01:26:02,923 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:26:02,942 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:26:03,013 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:26:03,013 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552779104]
[2020-10-16 01:26:03,014 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:26:03,014 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 01:26:03,014 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805137481]
[2020-10-16 01:26:03,014 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 01:26:03,015 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:26:03,015 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 01:26:03,015 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2020-10-16 01:26:03,016 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 153 out of 204
[2020-10-16 01:26:03,017 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 522 flow. Second operand 6 states.
[2020-10-16 01:26:03,017 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:26:03,017 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 204
[2020-10-16 01:26:03,018 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:26:03,315 INFO  L129       PetriNetUnfolder]: 347/668 cut-off events.
[2020-10-16 01:26:03,315 INFO  L130       PetriNetUnfolder]: For 5074/5746 co-relation queries the response was YES.
[2020-10-16 01:26:03,321 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 3545 conditions, 668 events. 347/668 cut-off events. For 5074/5746 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3674 event pairs, 65 based on Foata normal form. 52/675 useless extension candidates. Maximal degree in co-relation 3514. Up to 391 conditions per place. 
[2020-10-16 01:26:03,329 INFO  L132   encePairwiseOnDemand]: 195/204 looper letters, 20 selfloop transitions, 24 changer transitions 7/75 dead transitions.
[2020-10-16 01:26:03,329 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 75 transitions, 756 flow
[2020-10-16 01:26:03,329 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 01:26:03,329 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-10-16 01:26:03,332 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1101 transitions.
[2020-10-16 01:26:03,333 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7710084033613446
[2020-10-16 01:26:03,333 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1101 transitions.
[2020-10-16 01:26:03,333 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1101 transitions.
[2020-10-16 01:26:03,334 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:26:03,334 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1101 transitions.
[2020-10-16 01:26:03,336 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 8 states.
[2020-10-16 01:26:03,339 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states.
[2020-10-16 01:26:03,340 INFO  L81            ComplementDD]: Finished complementDD. Result 8 states.
[2020-10-16 01:26:03,340 INFO  L185             Difference]: Start difference. First operand has 66 places, 61 transitions, 522 flow. Second operand 7 states and 1101 transitions.
[2020-10-16 01:26:03,340 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 75 transitions, 756 flow
[2020-10-16 01:26:03,349 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 75 transitions, 734 flow, removed 6 selfloop flow, removed 2 redundant places.
[2020-10-16 01:26:03,351 INFO  L241             Difference]: Finished difference. Result has 71 places, 64 transitions, 599 flow
[2020-10-16 01:26:03,352 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=599, PETRI_PLACES=71, PETRI_TRANSITIONS=64}
[2020-10-16 01:26:03,352 INFO  L342   CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places.
[2020-10-16 01:26:03,352 INFO  L481      AbstractCegarLoop]: Abstraction has has 71 places, 64 transitions, 599 flow
[2020-10-16 01:26:03,352 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 01:26:03,352 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:26:03,353 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:26:03,353 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-16 01:26:03,353 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:26:03,353 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:26:03,353 INFO  L82        PathProgramCache]: Analyzing trace with hash 1197929533, now seen corresponding path program 2 times
[2020-10-16 01:26:03,353 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:26:03,354 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714341149]
[2020-10-16 01:26:03,354 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:26:03,385 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:26:03,473 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:26:03,473 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714341149]
[2020-10-16 01:26:03,473 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:26:03,474 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 01:26:03,474 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918471798]
[2020-10-16 01:26:03,474 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 01:26:03,474 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:26:03,474 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 01:26:03,475 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2020-10-16 01:26:03,476 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 157 out of 204
[2020-10-16 01:26:03,477 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 64 transitions, 599 flow. Second operand 7 states.
[2020-10-16 01:26:03,477 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:26:03,477 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 204
[2020-10-16 01:26:03,477 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:26:03,824 INFO  L129       PetriNetUnfolder]: 357/685 cut-off events.
[2020-10-16 01:26:03,824 INFO  L130       PetriNetUnfolder]: For 7203/7999 co-relation queries the response was YES.
[2020-10-16 01:26:03,835 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 4150 conditions, 685 events. 357/685 cut-off events. For 7203/7999 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3774 event pairs, 68 based on Foata normal form. 58/696 useless extension candidates. Maximal degree in co-relation 4116. Up to 401 conditions per place. 
[2020-10-16 01:26:03,848 INFO  L132   encePairwiseOnDemand]: 196/204 looper letters, 21 selfloop transitions, 30 changer transitions 7/82 dead transitions.
[2020-10-16 01:26:03,848 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 82 transitions, 949 flow
[2020-10-16 01:26:03,849 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 01:26:03,849 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-10-16 01:26:03,853 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1129 transitions.
[2020-10-16 01:26:03,854 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7906162464985994
[2020-10-16 01:26:03,854 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1129 transitions.
[2020-10-16 01:26:03,855 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1129 transitions.
[2020-10-16 01:26:03,856 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:26:03,856 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1129 transitions.
[2020-10-16 01:26:03,859 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 8 states.
[2020-10-16 01:26:03,863 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states.
[2020-10-16 01:26:03,863 INFO  L81            ComplementDD]: Finished complementDD. Result 8 states.
[2020-10-16 01:26:03,864 INFO  L185             Difference]: Start difference. First operand has 71 places, 64 transitions, 599 flow. Second operand 7 states and 1129 transitions.
[2020-10-16 01:26:03,864 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 82 transitions, 949 flow
[2020-10-16 01:26:03,877 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 82 transitions, 868 flow, removed 17 selfloop flow, removed 6 redundant places.
[2020-10-16 01:26:03,879 INFO  L241             Difference]: Finished difference. Result has 73 places, 71 transitions, 721 flow
[2020-10-16 01:26:03,879 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=721, PETRI_PLACES=73, PETRI_TRANSITIONS=71}
[2020-10-16 01:26:03,880 INFO  L342   CegarLoopForPetriNet]: 43 programPoint places, 30 predicate places.
[2020-10-16 01:26:03,880 INFO  L481      AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 721 flow
[2020-10-16 01:26:03,880 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 01:26:03,880 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:26:03,880 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:26:03,880 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-16 01:26:03,880 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:26:03,881 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:26:03,881 INFO  L82        PathProgramCache]: Analyzing trace with hash -360603733, now seen corresponding path program 3 times
[2020-10-16 01:26:03,881 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:26:03,881 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102106798]
[2020-10-16 01:26:03,881 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:26:03,900 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:26:03,969 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:26:03,970 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102106798]
[2020-10-16 01:26:03,970 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:26:03,971 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 01:26:03,971 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339967719]
[2020-10-16 01:26:03,971 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 01:26:03,972 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:26:03,972 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 01:26:03,972 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2020-10-16 01:26:03,974 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 155 out of 204
[2020-10-16 01:26:03,976 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 721 flow. Second operand 6 states.
[2020-10-16 01:26:03,976 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:26:03,976 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 204
[2020-10-16 01:26:03,976 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:26:04,411 INFO  L129       PetriNetUnfolder]: 397/760 cut-off events.
[2020-10-16 01:26:04,411 INFO  L130       PetriNetUnfolder]: For 10618/11532 co-relation queries the response was YES.
[2020-10-16 01:26:04,419 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 5201 conditions, 760 events. 397/760 cut-off events. For 10618/11532 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4245 event pairs, 73 based on Foata normal form. 70/785 useless extension candidates. Maximal degree in co-relation 5166. Up to 428 conditions per place. 
[2020-10-16 01:26:04,430 INFO  L132   encePairwiseOnDemand]: 195/204 looper letters, 25 selfloop transitions, 33 changer transitions 4/86 dead transitions.
[2020-10-16 01:26:04,430 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 86 transitions, 1064 flow
[2020-10-16 01:26:04,430 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 01:26:04,430 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-10-16 01:26:04,433 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1112 transitions.
[2020-10-16 01:26:04,434 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7787114845938375
[2020-10-16 01:26:04,434 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1112 transitions.
[2020-10-16 01:26:04,434 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1112 transitions.
[2020-10-16 01:26:04,435 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:26:04,435 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1112 transitions.
[2020-10-16 01:26:04,437 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 8 states.
[2020-10-16 01:26:04,439 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states.
[2020-10-16 01:26:04,439 INFO  L81            ComplementDD]: Finished complementDD. Result 8 states.
[2020-10-16 01:26:04,439 INFO  L185             Difference]: Start difference. First operand has 73 places, 71 transitions, 721 flow. Second operand 7 states and 1112 transitions.
[2020-10-16 01:26:04,440 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 86 transitions, 1064 flow
[2020-10-16 01:26:04,454 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 86 transitions, 946 flow, removed 48 selfloop flow, removed 4 redundant places.
[2020-10-16 01:26:04,459 INFO  L241             Difference]: Finished difference. Result has 75 places, 78 transitions, 808 flow
[2020-10-16 01:26:04,459 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=808, PETRI_PLACES=75, PETRI_TRANSITIONS=78}
[2020-10-16 01:26:04,460 INFO  L342   CegarLoopForPetriNet]: 43 programPoint places, 32 predicate places.
[2020-10-16 01:26:04,460 INFO  L481      AbstractCegarLoop]: Abstraction has has 75 places, 78 transitions, 808 flow
[2020-10-16 01:26:04,460 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 01:26:04,460 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:26:04,460 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:26:04,460 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-16 01:26:04,460 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:26:04,461 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:26:04,461 INFO  L82        PathProgramCache]: Analyzing trace with hash 1530424501, now seen corresponding path program 4 times
[2020-10-16 01:26:04,461 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:26:04,461 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728045877]
[2020-10-16 01:26:04,461 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:26:04,487 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:26:04,593 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:26:04,593 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728045877]
[2020-10-16 01:26:04,594 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:26:04,594 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 01:26:04,594 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105858447]
[2020-10-16 01:26:04,594 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 01:26:04,595 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:26:04,595 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 01:26:04,595 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2020-10-16 01:26:04,597 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 152 out of 204
[2020-10-16 01:26:04,598 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 78 transitions, 808 flow. Second operand 7 states.
[2020-10-16 01:26:04,598 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:26:04,598 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 204
[2020-10-16 01:26:04,598 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:26:04,979 INFO  L129       PetriNetUnfolder]: 385/765 cut-off events.
[2020-10-16 01:26:04,980 INFO  L130       PetriNetUnfolder]: For 9176/10174 co-relation queries the response was YES.
[2020-10-16 01:26:04,987 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 5094 conditions, 765 events. 385/765 cut-off events. For 9176/10174 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4414 event pairs, 56 based on Foata normal form. 59/780 useless extension candidates. Maximal degree in co-relation 5059. Up to 409 conditions per place. 
[2020-10-16 01:26:04,996 INFO  L132   encePairwiseOnDemand]: 196/204 looper letters, 36 selfloop transitions, 26 changer transitions 7/93 dead transitions.
[2020-10-16 01:26:04,996 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 93 transitions, 1181 flow
[2020-10-16 01:26:04,997 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 01:26:04,997 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-10-16 01:26:05,000 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1091 transitions.
[2020-10-16 01:26:05,001 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7640056022408963
[2020-10-16 01:26:05,001 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1091 transitions.
[2020-10-16 01:26:05,001 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1091 transitions.
[2020-10-16 01:26:05,002 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:26:05,002 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1091 transitions.
[2020-10-16 01:26:05,004 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 8 states.
[2020-10-16 01:26:05,006 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states.
[2020-10-16 01:26:05,006 INFO  L81            ComplementDD]: Finished complementDD. Result 8 states.
[2020-10-16 01:26:05,007 INFO  L185             Difference]: Start difference. First operand has 75 places, 78 transitions, 808 flow. Second operand 7 states and 1091 transitions.
[2020-10-16 01:26:05,007 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 93 transitions, 1181 flow
[2020-10-16 01:26:05,020 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 93 transitions, 1081 flow, removed 35 selfloop flow, removed 4 redundant places.
[2020-10-16 01:26:05,022 INFO  L241             Difference]: Finished difference. Result has 79 places, 81 transitions, 861 flow
[2020-10-16 01:26:05,023 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=861, PETRI_PLACES=79, PETRI_TRANSITIONS=81}
[2020-10-16 01:26:05,023 INFO  L342   CegarLoopForPetriNet]: 43 programPoint places, 36 predicate places.
[2020-10-16 01:26:05,023 INFO  L481      AbstractCegarLoop]: Abstraction has has 79 places, 81 transitions, 861 flow
[2020-10-16 01:26:05,023 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 01:26:05,023 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:26:05,023 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:26:05,024 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-16 01:26:05,024 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:26:05,024 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:26:05,024 INFO  L82        PathProgramCache]: Analyzing trace with hash -1907488614, now seen corresponding path program 1 times
[2020-10-16 01:26:05,024 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:26:05,024 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68532674]
[2020-10-16 01:26:05,025 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:26:05,044 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:26:05,238 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:26:05,238 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68532674]
[2020-10-16 01:26:05,239 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:26:05,239 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-16 01:26:05,239 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180181332]
[2020-10-16 01:26:05,239 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-10-16 01:26:05,240 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:26:05,240 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-10-16 01:26:05,240 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2020-10-16 01:26:05,242 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 145 out of 204
[2020-10-16 01:26:05,243 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 81 transitions, 861 flow. Second operand 8 states.
[2020-10-16 01:26:05,243 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:26:05,243 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 204
[2020-10-16 01:26:05,243 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:26:05,628 INFO  L129       PetriNetUnfolder]: 409/808 cut-off events.
[2020-10-16 01:26:05,628 INFO  L130       PetriNetUnfolder]: For 11238/12324 co-relation queries the response was YES.
[2020-10-16 01:26:05,638 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 5574 conditions, 808 events. 409/808 cut-off events. For 11238/12324 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4736 event pairs, 56 based on Foata normal form. 84/848 useless extension candidates. Maximal degree in co-relation 5537. Up to 424 conditions per place. 
[2020-10-16 01:26:05,649 INFO  L132   encePairwiseOnDemand]: 196/204 looper letters, 27 selfloop transitions, 46 changer transitions 7/104 dead transitions.
[2020-10-16 01:26:05,649 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 104 transitions, 1391 flow
[2020-10-16 01:26:05,650 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 01:26:05,650 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-10-16 01:26:05,652 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1046 transitions.
[2020-10-16 01:26:05,653 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7324929971988795
[2020-10-16 01:26:05,653 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1046 transitions.
[2020-10-16 01:26:05,653 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1046 transitions.
[2020-10-16 01:26:05,654 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:26:05,654 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1046 transitions.
[2020-10-16 01:26:05,656 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 8 states.
[2020-10-16 01:26:05,659 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states.
[2020-10-16 01:26:05,659 INFO  L81            ComplementDD]: Finished complementDD. Result 8 states.
[2020-10-16 01:26:05,659 INFO  L185             Difference]: Start difference. First operand has 79 places, 81 transitions, 861 flow. Second operand 7 states and 1046 transitions.
[2020-10-16 01:26:05,659 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 104 transitions, 1391 flow
[2020-10-16 01:26:05,675 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 104 transitions, 1276 flow, removed 48 selfloop flow, removed 4 redundant places.
[2020-10-16 01:26:05,678 INFO  L241             Difference]: Finished difference. Result has 82 places, 92 transitions, 1108 flow
[2020-10-16 01:26:05,678 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1108, PETRI_PLACES=82, PETRI_TRANSITIONS=92}
[2020-10-16 01:26:05,679 INFO  L342   CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places.
[2020-10-16 01:26:05,679 INFO  L481      AbstractCegarLoop]: Abstraction has has 82 places, 92 transitions, 1108 flow
[2020-10-16 01:26:05,679 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-10-16 01:26:05,679 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:26:05,679 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:26:05,679 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-16 01:26:05,679 INFO  L429      AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:26:05,679 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:26:05,680 INFO  L82        PathProgramCache]: Analyzing trace with hash 920490482, now seen corresponding path program 2 times
[2020-10-16 01:26:05,680 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:26:05,680 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82228146]
[2020-10-16 01:26:05,680 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:26:05,701 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:26:05,802 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:26:05,802 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82228146]
[2020-10-16 01:26:05,802 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:26:05,803 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-16 01:26:05,803 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662988832]
[2020-10-16 01:26:05,804 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-10-16 01:26:05,804 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:26:05,804 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-10-16 01:26:05,805 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2020-10-16 01:26:05,806 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 145 out of 204
[2020-10-16 01:26:05,807 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 92 transitions, 1108 flow. Second operand 8 states.
[2020-10-16 01:26:05,807 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:26:05,807 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 204
[2020-10-16 01:26:05,807 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:26:06,142 INFO  L129       PetriNetUnfolder]: 410/823 cut-off events.
[2020-10-16 01:26:06,143 INFO  L130       PetriNetUnfolder]: For 12444/13781 co-relation queries the response was YES.
[2020-10-16 01:26:06,153 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 5949 conditions, 823 events. 410/823 cut-off events. For 12444/13781 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4968 event pairs, 51 based on Foata normal form. 77/858 useless extension candidates. Maximal degree in co-relation 5911. Up to 509 conditions per place. 
[2020-10-16 01:26:06,167 INFO  L132   encePairwiseOnDemand]: 195/204 looper letters, 44 selfloop transitions, 30 changer transitions 5/103 dead transitions.
[2020-10-16 01:26:06,167 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 103 transitions, 1457 flow
[2020-10-16 01:26:06,168 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 01:26:06,168 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-10-16 01:26:06,170 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1043 transitions.
[2020-10-16 01:26:06,171 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7303921568627451
[2020-10-16 01:26:06,171 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1043 transitions.
[2020-10-16 01:26:06,171 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1043 transitions.
[2020-10-16 01:26:06,172 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:26:06,173 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1043 transitions.
[2020-10-16 01:26:06,175 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 8 states.
[2020-10-16 01:26:06,179 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states.
[2020-10-16 01:26:06,180 INFO  L81            ComplementDD]: Finished complementDD. Result 8 states.
[2020-10-16 01:26:06,180 INFO  L185             Difference]: Start difference. First operand has 82 places, 92 transitions, 1108 flow. Second operand 7 states and 1043 transitions.
[2020-10-16 01:26:06,180 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 103 transitions, 1457 flow
[2020-10-16 01:26:06,199 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 103 transitions, 1389 flow, removed 34 selfloop flow, removed 2 redundant places.
[2020-10-16 01:26:06,202 INFO  L241             Difference]: Finished difference. Result has 87 places, 94 transitions, 1170 flow
[2020-10-16 01:26:06,202 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=1048, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1170, PETRI_PLACES=87, PETRI_TRANSITIONS=94}
[2020-10-16 01:26:06,202 INFO  L342   CegarLoopForPetriNet]: 43 programPoint places, 44 predicate places.
[2020-10-16 01:26:06,202 INFO  L481      AbstractCegarLoop]: Abstraction has has 87 places, 94 transitions, 1170 flow
[2020-10-16 01:26:06,203 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-10-16 01:26:06,203 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:26:06,203 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:26:06,203 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-10-16 01:26:06,203 INFO  L429      AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:26:06,203 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:26:06,203 INFO  L82        PathProgramCache]: Analyzing trace with hash 1011901066, now seen corresponding path program 3 times
[2020-10-16 01:26:06,204 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:26:06,204 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104098352]
[2020-10-16 01:26:06,204 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:26:06,224 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:26:06,360 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:26:06,360 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104098352]
[2020-10-16 01:26:06,360 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:26:06,360 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-16 01:26:06,361 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911043701]
[2020-10-16 01:26:06,361 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-10-16 01:26:06,361 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:26:06,361 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-10-16 01:26:06,362 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2020-10-16 01:26:06,363 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 145 out of 204
[2020-10-16 01:26:06,364 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 94 transitions, 1170 flow. Second operand 8 states.
[2020-10-16 01:26:06,364 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:26:06,364 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 204
[2020-10-16 01:26:06,365 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:26:06,728 INFO  L129       PetriNetUnfolder]: 402/828 cut-off events.
[2020-10-16 01:26:06,729 INFO  L130       PetriNetUnfolder]: For 12359/13860 co-relation queries the response was YES.
[2020-10-16 01:26:06,734 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 5995 conditions, 828 events. 402/828 cut-off events. For 12359/13860 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5070 event pairs, 30 based on Foata normal form. 99/885 useless extension candidates. Maximal degree in co-relation 5954. Up to 390 conditions per place. 
[2020-10-16 01:26:06,742 INFO  L132   encePairwiseOnDemand]: 197/204 looper letters, 33 selfloop transitions, 44 changer transitions 5/106 dead transitions.
[2020-10-16 01:26:06,742 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 106 transitions, 1551 flow
[2020-10-16 01:26:06,743 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 01:26:06,743 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-10-16 01:26:06,745 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1044 transitions.
[2020-10-16 01:26:06,746 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7310924369747899
[2020-10-16 01:26:06,746 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1044 transitions.
[2020-10-16 01:26:06,746 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1044 transitions.
[2020-10-16 01:26:06,747 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:26:06,747 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1044 transitions.
[2020-10-16 01:26:06,749 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 8 states.
[2020-10-16 01:26:06,752 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states.
[2020-10-16 01:26:06,752 INFO  L81            ComplementDD]: Finished complementDD. Result 8 states.
[2020-10-16 01:26:06,752 INFO  L185             Difference]: Start difference. First operand has 87 places, 94 transitions, 1170 flow. Second operand 7 states and 1044 transitions.
[2020-10-16 01:26:06,752 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 106 transitions, 1551 flow
[2020-10-16 01:26:06,771 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 106 transitions, 1457 flow, removed 21 selfloop flow, removed 5 redundant places.
[2020-10-16 01:26:06,773 INFO  L241             Difference]: Finished difference. Result has 89 places, 96 transitions, 1271 flow
[2020-10-16 01:26:06,774 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=1088, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1271, PETRI_PLACES=89, PETRI_TRANSITIONS=96}
[2020-10-16 01:26:06,774 INFO  L342   CegarLoopForPetriNet]: 43 programPoint places, 46 predicate places.
[2020-10-16 01:26:06,774 INFO  L481      AbstractCegarLoop]: Abstraction has has 89 places, 96 transitions, 1271 flow
[2020-10-16 01:26:06,774 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-10-16 01:26:06,774 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:26:06,774 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:26:06,775 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2020-10-16 01:26:06,775 INFO  L429      AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:26:06,775 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:26:06,775 INFO  L82        PathProgramCache]: Analyzing trace with hash -697340566, now seen corresponding path program 1 times
[2020-10-16 01:26:06,775 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:26:06,775 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928330709]
[2020-10-16 01:26:06,776 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:26:06,790 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:26:06,840 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:26:06,841 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928330709]
[2020-10-16 01:26:06,841 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:26:06,841 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 01:26:06,842 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853052684]
[2020-10-16 01:26:06,842 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 01:26:06,842 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:26:06,842 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 01:26:06,843 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2020-10-16 01:26:06,847 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 153 out of 204
[2020-10-16 01:26:06,848 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 96 transitions, 1271 flow. Second operand 7 states.
[2020-10-16 01:26:06,848 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:26:06,848 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 204
[2020-10-16 01:26:06,848 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:26:07,976 INFO  L382   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L858-->L875: Formula: (let ((.cse29 (= (mod v_~y$r_buff1_thd0~0_229 256) 0)) (.cse28 (= (mod v_~y$w_buff1_used~0_397 256) 0)) (.cse16 (= (mod v_~y$r_buff0_thd0~0_286 256) 0))) (let ((.cse23 (and .cse28 .cse16)) (.cse24 (and .cse29 .cse16)) (.cse27 (= (mod v_~y$w_buff0_used~0_511 256) 0)) (.cse13 (= (mod v_~weak$$choice2~0_91 256) 0)) (.cse14 (not .cse16))) (let ((.cse19 (or (not .cse29) .cse14)) (.cse21 (or (not .cse28) .cse14)) (.cse18 (not .cse13)) (.cse0 (or .cse23 .cse24 .cse27)) (.cse20 (not .cse27))) (and (let ((.cse1 (= v_~x~0_33 2)) (.cse4 (= 0 v_~__unbuffered_p3_EBX~0_33)) (.cse2 (= v_~__unbuffered_p3_EAX~0_32 1)) (.cse6 (= v_~__unbuffered_p2_EAX~0_34 0))) (let ((.cse5 (= v_~main$tmp_guard1~0_30 0)) (.cse7 (not .cse6)) (.cse8 (not .cse2)) (.cse9 (not .cse4)) (.cse10 (not .cse1)) (.cse11 (= v_~main$tmp_guard1~0_30 1))) (or (and (= v_~y~0_246 v_~y~0_245) .cse0 (let ((.cse3 (= v_~y~0_246 2))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (or .cse7 .cse8 .cse9 (not .cse3) .cse10) .cse11)))) (and (let ((.cse12 (and (= v_~y~0_245 v_~y$mem_tmp~0_43) .cse18))) (or (and (or .cse12 (and .cse13 (= v_~y~0_245 v_~y$w_buff0~0_170))) .cse14 (let ((.cse15 (= 2 v_~y$w_buff0~0_170))) (or (and .cse1 .cse2 .cse4 .cse15 .cse5 .cse6) (and (or .cse7 .cse8 (not .cse15) .cse9 .cse10) .cse11)))) (and .cse16 (let ((.cse17 (= v_~y$w_buff1~0_152 2))) (or (and .cse1 .cse2 .cse4 .cse5 .cse6 .cse17) (and (or .cse7 .cse8 (not .cse17) .cse9 .cse10) .cse11))) (or (and (= v_~y~0_245 v_~y$w_buff1~0_152) .cse13) .cse12)))) .cse19 .cse20 .cse21)))) (= (mod v_~main$tmp_guard1~0_30 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_3|) (= v_~y$w_buff0~0_169 v_~y$w_buff0~0_170) (= v_~y$r_buff0_thd0~0_286 v_~y$r_buff0_thd0~0_285) (= |v_ULTIMATE.start_main_#t~nondet31_53| v_~weak$$choice2~0_91) (= v_~y$r_buff1_thd0~0_229 v_~y$r_buff1_thd0~0_228) (= |v_ULTIMATE.start_main_#t~nondet30_57| v_~weak$$choice0~0_29) (let ((.cse22 (= v_~y$w_buff1_used~0_397 v_~y$w_buff1_used~0_396))) (or (and .cse18 .cse22) (and (let ((.cse25 (= (mod v_~y$w_buff0_used~0_510 256) 0))) (or (and (or .cse23 .cse24 .cse25) .cse22) (and (= v_~y$w_buff1_used~0_396 0) (not .cse25) .cse19 .cse21))) .cse13))) (= v_~y~0_246 v_~y$mem_tmp~0_43) (= 0 v_~y$flush_delayed~0_63) (let ((.cse26 (= v_~y$w_buff0_used~0_511 v_~y$w_buff0_used~0_510))) (or (and .cse18 .cse26) (and .cse13 (or (and .cse26 .cse0) (and (or (and (= v_~y$w_buff0_used~0_510 0) .cse14) (and .cse16 .cse26)) .cse20))))) (= v_~y$w_buff1~0_152 v_~y$w_buff1~0_151)))))  InVars {ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_57|, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_53|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_511, ~y$w_buff0~0=v_~y$w_buff0~0_170, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_32, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~y~0=v_~y~0_246, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_33, ~y$w_buff1~0=v_~y$w_buff1~0_152, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_286, ~x~0=v_~x~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_229, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_397}  OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_56|, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_52|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_510, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_71|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_75|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_89|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_46|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_87|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_46|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_77|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_83|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_42|, ~y$mem_tmp~0=v_~y$mem_tmp~0_43, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_50|, ~y$w_buff0~0=v_~y$w_buff0~0_169, ~y$flush_delayed~0=v_~y$flush_delayed~0_63, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_32, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~y~0=v_~y~0_245, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_3|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_46|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_101|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_50|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_77|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_33, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_85|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_85|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_48|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_103|, ~weak$$choice0~0=v_~weak$$choice0~0_29, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_87|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_93|, ~y$w_buff1~0=v_~y$w_buff1~0_151, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_285, ~weak$$choice2~0=v_~weak$$choice2~0_91, ~x~0=v_~x~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_228, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_396}  AuxVars[]  AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~nondet31, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$r_buff0_thd0~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][120], [Black: 311#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0)), Black: 317#(and (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~y~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0)) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 260#(and (<= ~y$w_buff1~0 0) (= 2 ~y$w_buff0~0) (= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$r_buff0_thd0~0 0)), Black: 186#(and (= ~y~0 1) (<= ~y$w_buff1~0 0) (<= ~y$w_buff0~0 0) (= ~y$w_buff0_used~0 0)), Black: 190#(and (or (<= ~y~0 0) (= ~y~0 1)) (<= ~y$w_buff1~0 0) (<= ~y$w_buff0~0 0) (= ~y$w_buff0_used~0 0)), Black: 133#(and (<= ~y$w_buff1~0 0) (<= ~x~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 136#(and (<= ~y$w_buff1~0 0) (<= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0)) (= ~y$r_buff0_thd0~0 0)), Black: 261#(and (not (= ~y~0 ~y$w_buff0~0)) (<= ~y$w_buff1~0 0) (= 2 ~y$w_buff0~0) (= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$r_buff0_thd0~0 0)), 336#(and (not (= ~z~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0))), 272#true, Black: 208#(and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 210#(and (<= ~y~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0)) (= ~y$r_buff0_thd0~0 0)), Black: 143#(and (<= ~y$w_buff1~0 0) (= ~__unbuffered_p3_EAX~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 205#(and (<= ~y~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y$r_buff0_thd0~0 0)), 90#L797true, 92#L875true, Black: 153#(<= ~x~0 0), Black: 278#(and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~y~0)) (= ~y$r_buff0_thd0~0 0)), Black: 220#(and (= ~y~0 1) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 223#(and (= ~y~0 1) (= ~y$w_buff1_used~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0)) (= ~y$r_buff0_thd0~0 0)), 38#L757true, 102#P3EXITtrue, Black: 163#(= ~__unbuffered_p3_EAX~0 0), 171#true, Black: 294#(and (= ~y$r_buff1_thd0~0 0) (= ~y~0 1) (<= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), Black: 231#(and (= ~y~0 1) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 233#(and (= ~y~0 1) (= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$r_buff0_thd0~0 0)), 304#true, 48#P0EXITtrue, Black: 173#(and (<= ~y$w_buff1~0 0) (= ~y~0 0) (<= ~y$w_buff0~0 0) (= ~y$r_buff0_thd0~0 0)), 245#(and (<= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 174#(and (<= ~y~0 0) (<= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0)), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, Black: 246#(and (= ~y~0 1) (<= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 309#(and (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~y~0)) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0))])
[2020-10-16 01:26:07,976 INFO  L384   tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event
[2020-10-16 01:26:07,976 INFO  L387   tUnfolder$Statistics]:   existing Event has 23 ancestors and is cut-off event
[2020-10-16 01:26:07,976 INFO  L387   tUnfolder$Statistics]:   existing Event has 23 ancestors and is cut-off event
[2020-10-16 01:26:07,976 INFO  L387   tUnfolder$Statistics]:   existing Event has 23 ancestors and is cut-off event
[2020-10-16 01:26:08,087 INFO  L382   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L858-->L875: Formula: (let ((.cse29 (= (mod v_~y$r_buff1_thd0~0_229 256) 0)) (.cse28 (= (mod v_~y$w_buff1_used~0_397 256) 0)) (.cse16 (= (mod v_~y$r_buff0_thd0~0_286 256) 0))) (let ((.cse23 (and .cse28 .cse16)) (.cse24 (and .cse29 .cse16)) (.cse27 (= (mod v_~y$w_buff0_used~0_511 256) 0)) (.cse13 (= (mod v_~weak$$choice2~0_91 256) 0)) (.cse14 (not .cse16))) (let ((.cse19 (or (not .cse29) .cse14)) (.cse21 (or (not .cse28) .cse14)) (.cse18 (not .cse13)) (.cse0 (or .cse23 .cse24 .cse27)) (.cse20 (not .cse27))) (and (let ((.cse1 (= v_~x~0_33 2)) (.cse4 (= 0 v_~__unbuffered_p3_EBX~0_33)) (.cse2 (= v_~__unbuffered_p3_EAX~0_32 1)) (.cse6 (= v_~__unbuffered_p2_EAX~0_34 0))) (let ((.cse5 (= v_~main$tmp_guard1~0_30 0)) (.cse7 (not .cse6)) (.cse8 (not .cse2)) (.cse9 (not .cse4)) (.cse10 (not .cse1)) (.cse11 (= v_~main$tmp_guard1~0_30 1))) (or (and (= v_~y~0_246 v_~y~0_245) .cse0 (let ((.cse3 (= v_~y~0_246 2))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (or .cse7 .cse8 .cse9 (not .cse3) .cse10) .cse11)))) (and (let ((.cse12 (and (= v_~y~0_245 v_~y$mem_tmp~0_43) .cse18))) (or (and (or .cse12 (and .cse13 (= v_~y~0_245 v_~y$w_buff0~0_170))) .cse14 (let ((.cse15 (= 2 v_~y$w_buff0~0_170))) (or (and .cse1 .cse2 .cse4 .cse15 .cse5 .cse6) (and (or .cse7 .cse8 (not .cse15) .cse9 .cse10) .cse11)))) (and .cse16 (let ((.cse17 (= v_~y$w_buff1~0_152 2))) (or (and .cse1 .cse2 .cse4 .cse5 .cse6 .cse17) (and (or .cse7 .cse8 (not .cse17) .cse9 .cse10) .cse11))) (or (and (= v_~y~0_245 v_~y$w_buff1~0_152) .cse13) .cse12)))) .cse19 .cse20 .cse21)))) (= (mod v_~main$tmp_guard1~0_30 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_3|) (= v_~y$w_buff0~0_169 v_~y$w_buff0~0_170) (= v_~y$r_buff0_thd0~0_286 v_~y$r_buff0_thd0~0_285) (= |v_ULTIMATE.start_main_#t~nondet31_53| v_~weak$$choice2~0_91) (= v_~y$r_buff1_thd0~0_229 v_~y$r_buff1_thd0~0_228) (= |v_ULTIMATE.start_main_#t~nondet30_57| v_~weak$$choice0~0_29) (let ((.cse22 (= v_~y$w_buff1_used~0_397 v_~y$w_buff1_used~0_396))) (or (and .cse18 .cse22) (and (let ((.cse25 (= (mod v_~y$w_buff0_used~0_510 256) 0))) (or (and (or .cse23 .cse24 .cse25) .cse22) (and (= v_~y$w_buff1_used~0_396 0) (not .cse25) .cse19 .cse21))) .cse13))) (= v_~y~0_246 v_~y$mem_tmp~0_43) (= 0 v_~y$flush_delayed~0_63) (let ((.cse26 (= v_~y$w_buff0_used~0_511 v_~y$w_buff0_used~0_510))) (or (and .cse18 .cse26) (and .cse13 (or (and .cse26 .cse0) (and (or (and (= v_~y$w_buff0_used~0_510 0) .cse14) (and .cse16 .cse26)) .cse20))))) (= v_~y$w_buff1~0_152 v_~y$w_buff1~0_151)))))  InVars {ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_57|, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_53|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_511, ~y$w_buff0~0=v_~y$w_buff0~0_170, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_32, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~y~0=v_~y~0_246, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_33, ~y$w_buff1~0=v_~y$w_buff1~0_152, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_286, ~x~0=v_~x~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_229, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_397}  OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_56|, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_52|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_510, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_71|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_75|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_89|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_46|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_87|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_46|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_77|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_83|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_42|, ~y$mem_tmp~0=v_~y$mem_tmp~0_43, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_50|, ~y$w_buff0~0=v_~y$w_buff0~0_169, ~y$flush_delayed~0=v_~y$flush_delayed~0_63, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_32, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~y~0=v_~y~0_245, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_3|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_46|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_101|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_50|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_77|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_33, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_85|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_85|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_48|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_103|, ~weak$$choice0~0=v_~weak$$choice0~0_29, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_87|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_93|, ~y$w_buff1~0=v_~y$w_buff1~0_151, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_285, ~weak$$choice2~0=v_~weak$$choice2~0_91, ~x~0=v_~x~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_228, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_396}  AuxVars[]  AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~nondet31, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$r_buff0_thd0~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][120], [Black: 311#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0)), Black: 317#(and (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~y~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0)) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 260#(and (<= ~y$w_buff1~0 0) (= 2 ~y$w_buff0~0) (= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$r_buff0_thd0~0 0)), Black: 186#(and (= ~y~0 1) (<= ~y$w_buff1~0 0) (<= ~y$w_buff0~0 0) (= ~y$w_buff0_used~0 0)), Black: 190#(and (or (<= ~y~0 0) (= ~y~0 1)) (<= ~y$w_buff1~0 0) (<= ~y$w_buff0~0 0) (= ~y$w_buff0_used~0 0)), Black: 133#(and (<= ~y$w_buff1~0 0) (<= ~x~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 136#(and (<= ~y$w_buff1~0 0) (<= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0)) (= ~y$r_buff0_thd0~0 0)), Black: 261#(and (not (= ~y~0 ~y$w_buff0~0)) (<= ~y$w_buff1~0 0) (= 2 ~y$w_buff0~0) (= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$r_buff0_thd0~0 0)), 272#true, 336#(and (not (= ~z~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0))), Black: 208#(and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 210#(and (<= ~y~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0)) (= ~y$r_buff0_thd0~0 0)), Black: 143#(and (<= ~y$w_buff1~0 0) (= ~__unbuffered_p3_EAX~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 205#(and (<= ~y~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y$r_buff0_thd0~0 0)), 92#L875true, Black: 153#(<= ~x~0 0), Black: 278#(and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~y~0)) (= ~y$r_buff0_thd0~0 0)), Black: 220#(and (= ~y~0 1) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd0~0 0)), 35#P2EXITtrue, Black: 223#(and (= ~y~0 1) (= ~y$w_buff1_used~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0)) (= ~y$r_buff0_thd0~0 0)), 38#L757true, 102#P3EXITtrue, Black: 163#(= ~__unbuffered_p3_EAX~0 0), 171#true, Black: 294#(and (= ~y$r_buff1_thd0~0 0) (= ~y~0 1) (<= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), Black: 231#(and (= ~y~0 1) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 233#(and (= ~y~0 1) (= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$r_buff0_thd0~0 0)), 304#true, 48#P0EXITtrue, Black: 173#(and (<= ~y$w_buff1~0 0) (= ~y~0 0) (<= ~y$w_buff0~0 0) (= ~y$r_buff0_thd0~0 0)), 245#(and (<= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 174#(and (<= ~y~0 0) (<= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0)), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, Black: 246#(and (= ~y~0 1) (<= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 309#(and (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~y~0)) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0))])
[2020-10-16 01:26:08,088 INFO  L384   tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event
[2020-10-16 01:26:08,088 INFO  L387   tUnfolder$Statistics]:   existing Event has 24 ancestors and is cut-off event
[2020-10-16 01:26:08,088 INFO  L387   tUnfolder$Statistics]:   existing Event has 24 ancestors and is cut-off event
[2020-10-16 01:26:08,088 INFO  L387   tUnfolder$Statistics]:   existing Event has 24 ancestors and is cut-off event
[2020-10-16 01:26:08,315 INFO  L129       PetriNetUnfolder]: 3443/5851 cut-off events.
[2020-10-16 01:26:08,315 INFO  L130       PetriNetUnfolder]: For 89895/93116 co-relation queries the response was YES.
[2020-10-16 01:26:08,397 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 33076 conditions, 5851 events. 3443/5851 cut-off events. For 89895/93116 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 42495 event pairs, 355 based on Foata normal form. 441/5904 useless extension candidates. Maximal degree in co-relation 33034. Up to 1961 conditions per place. 
[2020-10-16 01:26:08,463 INFO  L132   encePairwiseOnDemand]: 195/204 looper letters, 25 selfloop transitions, 16 changer transitions 10/137 dead transitions.
[2020-10-16 01:26:08,464 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 137 transitions, 1569 flow
[2020-10-16 01:26:08,464 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-10-16 01:26:08,465 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-10-16 01:26:08,470 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1430 transitions.
[2020-10-16 01:26:08,471 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7788671023965141
[2020-10-16 01:26:08,471 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1430 transitions.
[2020-10-16 01:26:08,471 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1430 transitions.
[2020-10-16 01:26:08,474 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:26:08,474 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1430 transitions.
[2020-10-16 01:26:08,479 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 10 states.
[2020-10-16 01:26:08,484 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states.
[2020-10-16 01:26:08,485 INFO  L81            ComplementDD]: Finished complementDD. Result 10 states.
[2020-10-16 01:26:08,485 INFO  L185             Difference]: Start difference. First operand has 89 places, 96 transitions, 1271 flow. Second operand 9 states and 1430 transitions.
[2020-10-16 01:26:08,485 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 137 transitions, 1569 flow
[2020-10-16 01:26:08,681 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 137 transitions, 1476 flow, removed 21 selfloop flow, removed 5 redundant places.
[2020-10-16 01:26:08,686 INFO  L241             Difference]: Finished difference. Result has 97 places, 110 transitions, 1325 flow
[2020-10-16 01:26:08,686 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=1196, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1325, PETRI_PLACES=97, PETRI_TRANSITIONS=110}
[2020-10-16 01:26:08,687 INFO  L342   CegarLoopForPetriNet]: 43 programPoint places, 54 predicate places.
[2020-10-16 01:26:08,687 INFO  L481      AbstractCegarLoop]: Abstraction has has 97 places, 110 transitions, 1325 flow
[2020-10-16 01:26:08,687 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 01:26:08,687 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:26:08,687 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:26:08,688 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2020-10-16 01:26:08,688 INFO  L429      AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:26:08,688 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:26:08,688 INFO  L82        PathProgramCache]: Analyzing trace with hash 2133747746, now seen corresponding path program 2 times
[2020-10-16 01:26:08,689 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:26:08,689 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46510738]
[2020-10-16 01:26:08,689 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:26:08,719 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:26:08,748 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:26:08,748 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46510738]
[2020-10-16 01:26:08,749 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:26:08,749 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 01:26:08,749 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154639455]
[2020-10-16 01:26:08,750 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 01:26:08,750 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:26:08,750 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 01:26:08,750 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 01:26:08,751 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 166 out of 204
[2020-10-16 01:26:08,752 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 110 transitions, 1325 flow. Second operand 4 states.
[2020-10-16 01:26:08,752 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:26:08,753 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 204
[2020-10-16 01:26:08,753 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:26:09,085 INFO  L382   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L858-->L875: Formula: (let ((.cse29 (= (mod v_~y$r_buff1_thd0~0_229 256) 0)) (.cse28 (= (mod v_~y$w_buff1_used~0_397 256) 0)) (.cse16 (= (mod v_~y$r_buff0_thd0~0_286 256) 0))) (let ((.cse23 (and .cse28 .cse16)) (.cse24 (and .cse29 .cse16)) (.cse27 (= (mod v_~y$w_buff0_used~0_511 256) 0)) (.cse13 (= (mod v_~weak$$choice2~0_91 256) 0)) (.cse14 (not .cse16))) (let ((.cse19 (or (not .cse29) .cse14)) (.cse21 (or (not .cse28) .cse14)) (.cse18 (not .cse13)) (.cse0 (or .cse23 .cse24 .cse27)) (.cse20 (not .cse27))) (and (let ((.cse1 (= v_~x~0_33 2)) (.cse4 (= 0 v_~__unbuffered_p3_EBX~0_33)) (.cse2 (= v_~__unbuffered_p3_EAX~0_32 1)) (.cse6 (= v_~__unbuffered_p2_EAX~0_34 0))) (let ((.cse5 (= v_~main$tmp_guard1~0_30 0)) (.cse7 (not .cse6)) (.cse8 (not .cse2)) (.cse9 (not .cse4)) (.cse10 (not .cse1)) (.cse11 (= v_~main$tmp_guard1~0_30 1))) (or (and (= v_~y~0_246 v_~y~0_245) .cse0 (let ((.cse3 (= v_~y~0_246 2))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (or .cse7 .cse8 .cse9 (not .cse3) .cse10) .cse11)))) (and (let ((.cse12 (and (= v_~y~0_245 v_~y$mem_tmp~0_43) .cse18))) (or (and (or .cse12 (and .cse13 (= v_~y~0_245 v_~y$w_buff0~0_170))) .cse14 (let ((.cse15 (= 2 v_~y$w_buff0~0_170))) (or (and .cse1 .cse2 .cse4 .cse15 .cse5 .cse6) (and (or .cse7 .cse8 (not .cse15) .cse9 .cse10) .cse11)))) (and .cse16 (let ((.cse17 (= v_~y$w_buff1~0_152 2))) (or (and .cse1 .cse2 .cse4 .cse5 .cse6 .cse17) (and (or .cse7 .cse8 (not .cse17) .cse9 .cse10) .cse11))) (or (and (= v_~y~0_245 v_~y$w_buff1~0_152) .cse13) .cse12)))) .cse19 .cse20 .cse21)))) (= (mod v_~main$tmp_guard1~0_30 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_3|) (= v_~y$w_buff0~0_169 v_~y$w_buff0~0_170) (= v_~y$r_buff0_thd0~0_286 v_~y$r_buff0_thd0~0_285) (= |v_ULTIMATE.start_main_#t~nondet31_53| v_~weak$$choice2~0_91) (= v_~y$r_buff1_thd0~0_229 v_~y$r_buff1_thd0~0_228) (= |v_ULTIMATE.start_main_#t~nondet30_57| v_~weak$$choice0~0_29) (let ((.cse22 (= v_~y$w_buff1_used~0_397 v_~y$w_buff1_used~0_396))) (or (and .cse18 .cse22) (and (let ((.cse25 (= (mod v_~y$w_buff0_used~0_510 256) 0))) (or (and (or .cse23 .cse24 .cse25) .cse22) (and (= v_~y$w_buff1_used~0_396 0) (not .cse25) .cse19 .cse21))) .cse13))) (= v_~y~0_246 v_~y$mem_tmp~0_43) (= 0 v_~y$flush_delayed~0_63) (let ((.cse26 (= v_~y$w_buff0_used~0_511 v_~y$w_buff0_used~0_510))) (or (and .cse18 .cse26) (and .cse13 (or (and .cse26 .cse0) (and (or (and (= v_~y$w_buff0_used~0_510 0) .cse14) (and .cse16 .cse26)) .cse20))))) (= v_~y$w_buff1~0_152 v_~y$w_buff1~0_151)))))  InVars {ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_57|, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_53|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_511, ~y$w_buff0~0=v_~y$w_buff0~0_170, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_32, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~y~0=v_~y~0_246, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_33, ~y$w_buff1~0=v_~y$w_buff1~0_152, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_286, ~x~0=v_~x~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_229, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_397}  OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_56|, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_52|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_510, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_71|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_75|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_89|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_46|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_87|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_46|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_77|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_83|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_42|, ~y$mem_tmp~0=v_~y$mem_tmp~0_43, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_50|, ~y$w_buff0~0=v_~y$w_buff0~0_169, ~y$flush_delayed~0=v_~y$flush_delayed~0_63, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_32, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~y~0=v_~y~0_245, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_3|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_46|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_101|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_50|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_77|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_33, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_85|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_85|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_48|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_103|, ~weak$$choice0~0=v_~weak$$choice0~0_29, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_87|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_93|, ~y$w_buff1~0=v_~y$w_buff1~0_151, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_285, ~weak$$choice2~0=v_~weak$$choice2~0_91, ~x~0=v_~x~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_228, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_396}  AuxVars[]  AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~nondet31, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$r_buff0_thd0~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][91], [260#(and (<= ~y$w_buff1~0 0) (= 2 ~y$w_buff0~0) (= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$r_buff0_thd0~0 0)), Black: 186#(and (= ~y~0 1) (<= ~y$w_buff1~0 0) (<= ~y$w_buff0~0 0) (= ~y$w_buff0_used~0 0)), 326#(not (= ~z~0 0)), Black: 190#(and (or (<= ~y~0 0) (= ~y~0 1)) (<= ~y$w_buff1~0 0) (<= ~y$w_buff0~0 0) (= ~y$w_buff0_used~0 0)), Black: 133#(and (<= ~y$w_buff1~0 0) (<= ~x~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 136#(and (<= ~y$w_buff1~0 0) (<= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0)) (= ~y$r_buff0_thd0~0 0)), Black: 261#(and (not (= ~y~0 ~y$w_buff0~0)) (<= ~y$w_buff1~0 0) (= 2 ~y$w_buff0~0) (= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$r_buff0_thd0~0 0)), 272#true, Black: 336#(and (not (= ~z~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0))), Black: 324#(= ~__unbuffered_cnt~0 0), Black: 208#(and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 325#(and (= ~z~0 1) (= ~__unbuffered_cnt~0 0)), Black: 210#(and (<= ~y~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0)) (= ~y$r_buff0_thd0~0 0)), Black: 143#(and (<= ~y$w_buff1~0 0) (= ~__unbuffered_p3_EAX~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 205#(and (<= ~y~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y$r_buff0_thd0~0 0)), Black: 330#(and (not (= ~__unbuffered_p2_EAX~0 0)) (= ~z~0 1) (= ~__unbuffered_cnt~0 0)), Black: 332#(and (not (= ~z~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 334#(and (not (= ~__unbuffered_p2_EAX~0 0)) (= ~z~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0)) (= ~__unbuffered_cnt~0 0)), 345#true, 92#L875true, Black: 153#(<= ~x~0 0), Black: 278#(and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~y~0)) (= ~y$r_buff0_thd0~0 0)), 33#L823true, Black: 220#(and (= ~y~0 1) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 223#(and (= ~y~0 1) (= ~y$w_buff1_used~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0)) (= ~y$r_buff0_thd0~0 0)), 38#L757true, 39#L787true, Black: 163#(= ~__unbuffered_p3_EAX~0 0), 171#true, Black: 294#(and (= ~y$r_buff1_thd0~0 0) (= ~y~0 1) (<= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), Black: 231#(and (= ~y~0 1) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 233#(and (= ~y~0 1) (= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$r_buff0_thd0~0 0)), 48#P0EXITtrue, Black: 173#(and (<= ~y$w_buff1~0 0) (= ~y~0 0) (<= ~y$w_buff0~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 174#(and (<= ~y~0 0) (<= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0)), 245#(and (<= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0)), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, Black: 246#(and (= ~y~0 1) (<= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 309#(and (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~y~0)) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0))])
[2020-10-16 01:26:09,085 INFO  L384   tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event
[2020-10-16 01:26:09,085 INFO  L387   tUnfolder$Statistics]:   existing Event has 20 ancestors and is cut-off event
[2020-10-16 01:26:09,085 INFO  L387   tUnfolder$Statistics]:   existing Event has 20 ancestors and is cut-off event
[2020-10-16 01:26:09,085 INFO  L387   tUnfolder$Statistics]:   existing Event has 20 ancestors and is cut-off event
[2020-10-16 01:26:09,145 INFO  L382   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([968] L757-->L760: Formula: (= v_~y~0_1 1)  InVars {}  OutVars{~y~0=v_~y~0_1}  AuxVars[]  AssignedVars[~y~0][43], [261#(and (not (= ~y~0 ~y$w_buff0~0)) (<= ~y$w_buff1~0 0) (= 2 ~y$w_buff0~0) (= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$r_buff0_thd0~0 0)), Black: 186#(and (= ~y~0 1) (<= ~y$w_buff1~0 0) (<= ~y$w_buff0~0 0) (= ~y$w_buff0_used~0 0)), 326#(not (= ~z~0 0)), Black: 190#(and (or (<= ~y~0 0) (= ~y~0 1)) (<= ~y$w_buff1~0 0) (<= ~y$w_buff0~0 0) (= ~y$w_buff0_used~0 0)), Black: 133#(and (<= ~y$w_buff1~0 0) (<= ~x~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 136#(and (<= ~y$w_buff1~0 0) (<= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0)) (= ~y$r_buff0_thd0~0 0)), 272#true, Black: 336#(and (not (= ~z~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0))), Black: 324#(= ~__unbuffered_cnt~0 0), Black: 208#(and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 325#(and (= ~z~0 1) (= ~__unbuffered_cnt~0 0)), Black: 210#(and (<= ~y~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0)) (= ~y$r_buff0_thd0~0 0)), Black: 143#(and (<= ~y$w_buff1~0 0) (= ~__unbuffered_p3_EAX~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 330#(and (not (= ~__unbuffered_p2_EAX~0 0)) (= ~z~0 1) (= ~__unbuffered_cnt~0 0)), Black: 205#(and (<= ~y~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y$r_buff0_thd0~0 0)), Black: 332#(and (not (= ~z~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 334#(and (not (= ~__unbuffered_p2_EAX~0 0)) (= ~z~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0)) (= ~__unbuffered_cnt~0 0)), 345#true, Black: 153#(<= ~x~0 0), Black: 278#(and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~y~0)) (= ~y$r_buff0_thd0~0 0)), 33#L823true, Black: 220#(and (= ~y~0 1) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 223#(and (= ~y~0 1) (= ~y$w_buff1_used~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0)) (= ~y$r_buff0_thd0~0 0)), 39#L787true, Black: 163#(= ~__unbuffered_p3_EAX~0 0), 171#true, Black: 294#(and (= ~y$r_buff1_thd0~0 0) (= ~y~0 1) (<= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), Black: 231#(and (= ~y~0 1) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 233#(and (= ~y~0 1) (= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$r_buff0_thd0~0 0)), 48#P0EXITtrue, Black: 173#(and (<= ~y$w_buff1~0 0) (= ~y~0 0) (<= ~y$w_buff0~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 174#(and (<= ~y~0 0) (<= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0)), 117#L858true, 246#(and (= ~y~0 1) (<= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0)), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, 61#L760true, P1Thread1of1ForFork3InUse, Black: 309#(and (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~y~0)) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0))])
[2020-10-16 01:26:09,145 INFO  L384   tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event
[2020-10-16 01:26:09,146 INFO  L387   tUnfolder$Statistics]:   existing Event has 20 ancestors and is not cut-off event
[2020-10-16 01:26:09,146 INFO  L387   tUnfolder$Statistics]:   existing Event has 20 ancestors and is not cut-off event
[2020-10-16 01:26:09,146 INFO  L387   tUnfolder$Statistics]:   existing Event has 20 ancestors and is not cut-off event
[2020-10-16 01:26:09,621 INFO  L129       PetriNetUnfolder]: 2391/4368 cut-off events.
[2020-10-16 01:26:09,621 INFO  L130       PetriNetUnfolder]: For 56293/59265 co-relation queries the response was YES.
[2020-10-16 01:26:09,652 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 26978 conditions, 4368 events. 2391/4368 cut-off events. For 56293/59265 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 33418 event pairs, 453 based on Foata normal form. 848/4794 useless extension candidates. Maximal degree in co-relation 26931. Up to 1646 conditions per place. 
[2020-10-16 01:26:09,683 INFO  L132   encePairwiseOnDemand]: 197/204 looper letters, 13 selfloop transitions, 13 changer transitions 2/113 dead transitions.
[2020-10-16 01:26:09,684 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 113 transitions, 1372 flow
[2020-10-16 01:26:09,684 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 01:26:09,684 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-10-16 01:26:09,686 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 682 transitions.
[2020-10-16 01:26:09,687 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8357843137254902
[2020-10-16 01:26:09,687 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 682 transitions.
[2020-10-16 01:26:09,687 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 682 transitions.
[2020-10-16 01:26:09,688 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:26:09,688 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 682 transitions.
[2020-10-16 01:26:09,689 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 5 states.
[2020-10-16 01:26:09,694 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states.
[2020-10-16 01:26:09,694 INFO  L81            ComplementDD]: Finished complementDD. Result 5 states.
[2020-10-16 01:26:09,694 INFO  L185             Difference]: Start difference. First operand has 97 places, 110 transitions, 1325 flow. Second operand 4 states and 682 transitions.
[2020-10-16 01:26:09,694 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 113 transitions, 1372 flow
[2020-10-16 01:26:09,748 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 113 transitions, 1370 flow, removed 1 selfloop flow, removed 1 redundant places.
[2020-10-16 01:26:09,751 INFO  L241             Difference]: Finished difference. Result has 99 places, 107 transitions, 1315 flow
[2020-10-16 01:26:09,751 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=1278, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1315, PETRI_PLACES=99, PETRI_TRANSITIONS=107}
[2020-10-16 01:26:09,752 INFO  L342   CegarLoopForPetriNet]: 43 programPoint places, 56 predicate places.
[2020-10-16 01:26:09,752 INFO  L481      AbstractCegarLoop]: Abstraction has has 99 places, 107 transitions, 1315 flow
[2020-10-16 01:26:09,752 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 01:26:09,752 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:26:09,752 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:26:09,752 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2020-10-16 01:26:09,752 INFO  L429      AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:26:09,753 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:26:09,753 INFO  L82        PathProgramCache]: Analyzing trace with hash -1863332105, now seen corresponding path program 1 times
[2020-10-16 01:26:09,753 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:26:09,753 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588988677]
[2020-10-16 01:26:09,753 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:26:09,781 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:26:09,820 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:26:09,820 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588988677]
[2020-10-16 01:26:09,820 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:26:09,821 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 01:26:09,821 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907869975]
[2020-10-16 01:26:09,821 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 01:26:09,821 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:26:09,822 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 01:26:09,822 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 01:26:09,823 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 166 out of 204
[2020-10-16 01:26:09,824 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 107 transitions, 1315 flow. Second operand 5 states.
[2020-10-16 01:26:09,824 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:26:09,824 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 204
[2020-10-16 01:26:09,824 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:26:10,293 INFO  L129       PetriNetUnfolder]: 1383/2998 cut-off events.
[2020-10-16 01:26:10,293 INFO  L130       PetriNetUnfolder]: For 38424/41908 co-relation queries the response was YES.
[2020-10-16 01:26:10,314 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 18691 conditions, 2998 events. 1383/2998 cut-off events. For 38424/41908 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 25108 event pairs, 146 based on Foata normal form. 712/3382 useless extension candidates. Maximal degree in co-relation 18641. Up to 1197 conditions per place. 
[2020-10-16 01:26:10,333 INFO  L132   encePairwiseOnDemand]: 197/204 looper letters, 13 selfloop transitions, 17 changer transitions 3/107 dead transitions.
[2020-10-16 01:26:10,333 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 107 transitions, 1327 flow
[2020-10-16 01:26:10,333 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 01:26:10,334 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-10-16 01:26:10,335 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 853 transitions.
[2020-10-16 01:26:10,335 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8362745098039216
[2020-10-16 01:26:10,335 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 853 transitions.
[2020-10-16 01:26:10,336 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 853 transitions.
[2020-10-16 01:26:10,336 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:26:10,336 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 853 transitions.
[2020-10-16 01:26:10,338 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 6 states.
[2020-10-16 01:26:10,340 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states.
[2020-10-16 01:26:10,340 INFO  L81            ComplementDD]: Finished complementDD. Result 6 states.
[2020-10-16 01:26:10,340 INFO  L185             Difference]: Start difference. First operand has 99 places, 107 transitions, 1315 flow. Second operand 5 states and 853 transitions.
[2020-10-16 01:26:10,340 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 107 transitions, 1327 flow
[2020-10-16 01:26:10,391 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 107 transitions, 1301 flow, removed 1 selfloop flow, removed 3 redundant places.
[2020-10-16 01:26:10,393 INFO  L241             Difference]: Finished difference. Result has 102 places, 100 transitions, 1241 flow
[2020-10-16 01:26:10,393 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=1161, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1241, PETRI_PLACES=102, PETRI_TRANSITIONS=100}
[2020-10-16 01:26:10,393 INFO  L342   CegarLoopForPetriNet]: 43 programPoint places, 59 predicate places.
[2020-10-16 01:26:10,394 INFO  L481      AbstractCegarLoop]: Abstraction has has 102 places, 100 transitions, 1241 flow
[2020-10-16 01:26:10,394 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 01:26:10,394 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:26:10,394 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]
[2020-10-16 01:26:10,394 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2020-10-16 01:26:10,394 INFO  L429      AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:26:10,394 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:26:10,395 INFO  L82        PathProgramCache]: Analyzing trace with hash 2064715972, now seen corresponding path program 1 times
[2020-10-16 01:26:10,395 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:26:10,395 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762959852]
[2020-10-16 01:26:10,395 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:26:10,409 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:26:10,466 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:26:10,467 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762959852]
[2020-10-16 01:26:10,467 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:26:10,467 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 01:26:10,467 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650916248]
[2020-10-16 01:26:10,468 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 01:26:10,468 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:26:10,468 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 01:26:10,468 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2020-10-16 01:26:10,470 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 152 out of 204
[2020-10-16 01:26:10,470 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 100 transitions, 1241 flow. Second operand 6 states.
[2020-10-16 01:26:10,470 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:26:10,471 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 204
[2020-10-16 01:26:10,471 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:26:11,455 INFO  L129       PetriNetUnfolder]: 2363/5077 cut-off events.
[2020-10-16 01:26:11,455 INFO  L130       PetriNetUnfolder]: For 70434/75585 co-relation queries the response was YES.
[2020-10-16 01:26:11,488 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 34324 conditions, 5077 events. 2363/5077 cut-off events. For 70434/75585 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 46778 event pairs, 220 based on Foata normal form. 539/5059 useless extension candidates. Maximal degree in co-relation 34273. Up to 2053 conditions per place. 
[2020-10-16 01:26:11,506 INFO  L132   encePairwiseOnDemand]: 198/204 looper letters, 65 selfloop transitions, 25 changer transitions 33/166 dead transitions.
[2020-10-16 01:26:11,506 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 166 transitions, 2500 flow
[2020-10-16 01:26:11,507 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 01:26:11,507 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-10-16 01:26:11,508 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1099 transitions.
[2020-10-16 01:26:11,509 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7696078431372549
[2020-10-16 01:26:11,509 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1099 transitions.
[2020-10-16 01:26:11,509 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1099 transitions.
[2020-10-16 01:26:11,510 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:26:11,510 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1099 transitions.
[2020-10-16 01:26:11,511 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 8 states.
[2020-10-16 01:26:11,514 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states.
[2020-10-16 01:26:11,514 INFO  L81            ComplementDD]: Finished complementDD. Result 8 states.
[2020-10-16 01:26:11,514 INFO  L185             Difference]: Start difference. First operand has 102 places, 100 transitions, 1241 flow. Second operand 7 states and 1099 transitions.
[2020-10-16 01:26:11,514 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 166 transitions, 2500 flow
[2020-10-16 01:26:11,664 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 166 transitions, 2464 flow, removed 11 selfloop flow, removed 2 redundant places.
[2020-10-16 01:26:11,667 INFO  L241             Difference]: Finished difference. Result has 110 places, 110 transitions, 1489 flow
[2020-10-16 01:26:11,668 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=1205, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1489, PETRI_PLACES=110, PETRI_TRANSITIONS=110}
[2020-10-16 01:26:11,668 INFO  L342   CegarLoopForPetriNet]: 43 programPoint places, 67 predicate places.
[2020-10-16 01:26:11,668 INFO  L481      AbstractCegarLoop]: Abstraction has has 110 places, 110 transitions, 1489 flow
[2020-10-16 01:26:11,668 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 01:26:11,668 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:26:11,668 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]
[2020-10-16 01:26:11,669 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2020-10-16 01:26:11,669 INFO  L429      AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:26:11,669 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:26:11,669 INFO  L82        PathProgramCache]: Analyzing trace with hash -818028620, now seen corresponding path program 2 times
[2020-10-16 01:26:11,669 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:26:11,669 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405345617]
[2020-10-16 01:26:11,670 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:26:11,686 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:26:11,756 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:26:11,757 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405345617]
[2020-10-16 01:26:11,757 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:26:11,757 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 01:26:11,757 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597412512]
[2020-10-16 01:26:11,757 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 01:26:11,758 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:26:11,758 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 01:26:11,758 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2020-10-16 01:26:11,760 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 152 out of 204
[2020-10-16 01:26:11,762 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 110 transitions, 1489 flow. Second operand 6 states.
[2020-10-16 01:26:11,763 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:26:11,763 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 204
[2020-10-16 01:26:11,763 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:26:13,307 INFO  L129       PetriNetUnfolder]: 3080/6500 cut-off events.
[2020-10-16 01:26:13,307 INFO  L130       PetriNetUnfolder]: For 86058/91765 co-relation queries the response was YES.
[2020-10-16 01:26:13,354 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 41214 conditions, 6500 events. 3080/6500 cut-off events. For 86058/91765 co-relation queries the response was YES. Maximal size of possible extension queue 719. Compared 62260 event pairs, 259 based on Foata normal form. 747/6505 useless extension candidates. Maximal degree in co-relation 41159. Up to 2809 conditions per place. 
[2020-10-16 01:26:13,372 INFO  L132   encePairwiseOnDemand]: 198/204 looper letters, 72 selfloop transitions, 28 changer transitions 20/163 dead transitions.
[2020-10-16 01:26:13,372 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 163 transitions, 2517 flow
[2020-10-16 01:26:13,373 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-10-16 01:26:13,373 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2020-10-16 01:26:13,374 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1252 transitions.
[2020-10-16 01:26:13,375 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7671568627450981
[2020-10-16 01:26:13,375 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1252 transitions.
[2020-10-16 01:26:13,375 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1252 transitions.
[2020-10-16 01:26:13,376 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:26:13,376 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1252 transitions.
[2020-10-16 01:26:13,377 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 9 states.
[2020-10-16 01:26:13,380 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states.
[2020-10-16 01:26:13,380 INFO  L81            ComplementDD]: Finished complementDD. Result 9 states.
[2020-10-16 01:26:13,380 INFO  L185             Difference]: Start difference. First operand has 110 places, 110 transitions, 1489 flow. Second operand 8 states and 1252 transitions.
[2020-10-16 01:26:13,380 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 163 transitions, 2517 flow
[2020-10-16 01:26:13,497 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 163 transitions, 2445 flow, removed 36 selfloop flow, removed 2 redundant places.
[2020-10-16 01:26:13,500 INFO  L241             Difference]: Finished difference. Result has 116 places, 110 transitions, 1495 flow
[2020-10-16 01:26:13,500 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=1421, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1495, PETRI_PLACES=116, PETRI_TRANSITIONS=110}
[2020-10-16 01:26:13,500 INFO  L342   CegarLoopForPetriNet]: 43 programPoint places, 73 predicate places.
[2020-10-16 01:26:13,500 INFO  L481      AbstractCegarLoop]: Abstraction has has 116 places, 110 transitions, 1495 flow
[2020-10-16 01:26:13,501 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 01:26:13,501 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:26:13,501 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:26:13,501 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2020-10-16 01:26:13,501 INFO  L429      AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:26:13,501 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:26:13,502 INFO  L82        PathProgramCache]: Analyzing trace with hash 1103539631, now seen corresponding path program 1 times
[2020-10-16 01:26:13,502 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:26:13,502 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528209622]
[2020-10-16 01:26:13,502 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:26:13,527 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:26:13,569 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:26:13,569 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528209622]
[2020-10-16 01:26:13,570 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:26:13,570 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 01:26:13,570 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183509391]
[2020-10-16 01:26:13,570 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 01:26:13,570 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:26:13,571 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 01:26:13,574 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 01:26:13,576 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 166 out of 204
[2020-10-16 01:26:13,576 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 110 transitions, 1495 flow. Second operand 6 states.
[2020-10-16 01:26:13,576 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:26:13,577 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 204
[2020-10-16 01:26:13,577 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:26:14,418 INFO  L129       PetriNetUnfolder]: 1988/4660 cut-off events.
[2020-10-16 01:26:14,418 INFO  L130       PetriNetUnfolder]: For 53093/60997 co-relation queries the response was YES.
[2020-10-16 01:26:14,445 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 28106 conditions, 4660 events. 1988/4660 cut-off events. For 53093/60997 co-relation queries the response was YES. Maximal size of possible extension queue 599. Compared 46248 event pairs, 40 based on Foata normal form. 1258/5279 useless extension candidates. Maximal degree in co-relation 28048. Up to 2293 conditions per place. 
[2020-10-16 01:26:14,453 INFO  L132   encePairwiseOnDemand]: 197/204 looper letters, 13 selfloop transitions, 21 changer transitions 6/112 dead transitions.
[2020-10-16 01:26:14,453 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 112 transitions, 1567 flow
[2020-10-16 01:26:14,454 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 01:26:14,454 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2020-10-16 01:26:14,455 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1024 transitions.
[2020-10-16 01:26:14,455 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8366013071895425
[2020-10-16 01:26:14,455 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1024 transitions.
[2020-10-16 01:26:14,456 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1024 transitions.
[2020-10-16 01:26:14,456 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:26:14,456 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1024 transitions.
[2020-10-16 01:26:14,457 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 7 states.
[2020-10-16 01:26:14,459 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states.
[2020-10-16 01:26:14,459 INFO  L81            ComplementDD]: Finished complementDD. Result 7 states.
[2020-10-16 01:26:14,459 INFO  L185             Difference]: Start difference. First operand has 116 places, 110 transitions, 1495 flow. Second operand 6 states and 1024 transitions.
[2020-10-16 01:26:14,459 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 112 transitions, 1567 flow
[2020-10-16 01:26:14,530 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 112 transitions, 1443 flow, removed 21 selfloop flow, removed 11 redundant places.
[2020-10-16 01:26:14,532 INFO  L241             Difference]: Finished difference. Result has 110 places, 102 transitions, 1292 flow
[2020-10-16 01:26:14,533 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=1277, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1292, PETRI_PLACES=110, PETRI_TRANSITIONS=102}
[2020-10-16 01:26:14,533 INFO  L342   CegarLoopForPetriNet]: 43 programPoint places, 67 predicate places.
[2020-10-16 01:26:14,533 INFO  L481      AbstractCegarLoop]: Abstraction has has 110 places, 102 transitions, 1292 flow
[2020-10-16 01:26:14,533 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 01:26:14,533 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:26:14,533 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:26:14,533 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2020-10-16 01:26:14,534 INFO  L429      AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:26:14,534 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:26:14,534 INFO  L82        PathProgramCache]: Analyzing trace with hash 422754576, now seen corresponding path program 1 times
[2020-10-16 01:26:14,534 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:26:14,534 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545367372]
[2020-10-16 01:26:14,535 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:26:14,562 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:26:14,600 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:26:14,601 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545367372]
[2020-10-16 01:26:14,601 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:26:14,601 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-16 01:26:14,601 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108064282]
[2020-10-16 01:26:14,602 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 01:26:14,602 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:26:14,602 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 01:26:14,602 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-10-16 01:26:14,604 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 166 out of 204
[2020-10-16 01:26:14,604 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 102 transitions, 1292 flow. Second operand 7 states.
[2020-10-16 01:26:14,605 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:26:14,605 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 204
[2020-10-16 01:26:14,605 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:26:15,071 INFO  L129       PetriNetUnfolder]: 1317/3150 cut-off events.
[2020-10-16 01:26:15,071 INFO  L130       PetriNetUnfolder]: For 37819/44108 co-relation queries the response was YES.
[2020-10-16 01:26:15,096 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 20384 conditions, 3150 events. 1317/3150 cut-off events. For 37819/44108 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 30178 event pairs, 18 based on Foata normal form. 790/3500 useless extension candidates. Maximal degree in co-relation 20331. Up to 1615 conditions per place. 
[2020-10-16 01:26:15,102 INFO  L132   encePairwiseOnDemand]: 197/204 looper letters, 5 selfloop transitions, 25 changer transitions 2/101 dead transitions.
[2020-10-16 01:26:15,102 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 101 transitions, 1333 flow
[2020-10-16 01:26:15,103 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 01:26:15,103 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-10-16 01:26:15,109 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1187 transitions.
[2020-10-16 01:26:15,110 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8312324929971989
[2020-10-16 01:26:15,110 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1187 transitions.
[2020-10-16 01:26:15,110 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1187 transitions.
[2020-10-16 01:26:15,110 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:26:15,111 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1187 transitions.
[2020-10-16 01:26:15,112 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 8 states.
[2020-10-16 01:26:15,114 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states.
[2020-10-16 01:26:15,114 INFO  L81            ComplementDD]: Finished complementDD. Result 8 states.
[2020-10-16 01:26:15,114 INFO  L185             Difference]: Start difference. First operand has 110 places, 102 transitions, 1292 flow. Second operand 7 states and 1187 transitions.
[2020-10-16 01:26:15,114 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 101 transitions, 1333 flow
[2020-10-16 01:26:15,409 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 101 transitions, 1146 flow, removed 54 selfloop flow, removed 8 redundant places.
[2020-10-16 01:26:15,411 INFO  L241             Difference]: Finished difference. Result has 110 places, 99 transitions, 1140 flow
[2020-10-16 01:26:15,411 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=1078, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1140, PETRI_PLACES=110, PETRI_TRANSITIONS=99}
[2020-10-16 01:26:15,411 INFO  L342   CegarLoopForPetriNet]: 43 programPoint places, 67 predicate places.
[2020-10-16 01:26:15,411 INFO  L481      AbstractCegarLoop]: Abstraction has has 110 places, 99 transitions, 1140 flow
[2020-10-16 01:26:15,411 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 01:26:15,412 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:26:15,412 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:26:15,412 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2020-10-16 01:26:15,412 INFO  L429      AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:26:15,412 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:26:15,412 INFO  L82        PathProgramCache]: Analyzing trace with hash -920696456, now seen corresponding path program 1 times
[2020-10-16 01:26:15,413 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:26:15,413 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245648052]
[2020-10-16 01:26:15,413 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:26:15,436 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:26:15,521 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:26:15,521 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245648052]
[2020-10-16 01:26:15,521 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:26:15,521 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 01:26:15,522 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094275973]
[2020-10-16 01:26:15,527 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 01:26:15,527 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:26:15,527 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 01:26:15,528 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2020-10-16 01:26:15,531 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 157 out of 204
[2020-10-16 01:26:15,532 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 99 transitions, 1140 flow. Second operand 7 states.
[2020-10-16 01:26:15,532 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:26:15,532 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 204
[2020-10-16 01:26:15,533 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:26:16,200 INFO  L129       PetriNetUnfolder]: 1789/4244 cut-off events.
[2020-10-16 01:26:16,200 INFO  L130       PetriNetUnfolder]: For 38554/42408 co-relation queries the response was YES.
[2020-10-16 01:26:16,223 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 23408 conditions, 4244 events. 1789/4244 cut-off events. For 38554/42408 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 42457 event pairs, 29 based on Foata normal form. 337/3937 useless extension candidates. Maximal degree in co-relation 23356. Up to 2242 conditions per place. 
[2020-10-16 01:26:16,228 INFO  L132   encePairwiseOnDemand]: 198/204 looper letters, 8 selfloop transitions, 2 changer transitions 34/107 dead transitions.
[2020-10-16 01:26:16,229 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 107 transitions, 1328 flow
[2020-10-16 01:26:16,229 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 01:26:16,229 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-10-16 01:26:16,230 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1113 transitions.
[2020-10-16 01:26:16,231 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7794117647058824
[2020-10-16 01:26:16,231 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1113 transitions.
[2020-10-16 01:26:16,231 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1113 transitions.
[2020-10-16 01:26:16,231 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:26:16,231 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1113 transitions.
[2020-10-16 01:26:16,233 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 8 states.
[2020-10-16 01:26:16,234 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states.
[2020-10-16 01:26:16,234 INFO  L81            ComplementDD]: Finished complementDD. Result 8 states.
[2020-10-16 01:26:16,235 INFO  L185             Difference]: Start difference. First operand has 110 places, 99 transitions, 1140 flow. Second operand 7 states and 1113 transitions.
[2020-10-16 01:26:16,235 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 107 transitions, 1328 flow
[2020-10-16 01:26:16,462 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 107 transitions, 1185 flow, removed 33 selfloop flow, removed 12 redundant places.
[2020-10-16 01:26:16,463 INFO  L241             Difference]: Finished difference. Result has 108 places, 72 transitions, 650 flow
[2020-10-16 01:26:16,463 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=1002, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=650, PETRI_PLACES=108, PETRI_TRANSITIONS=72}
[2020-10-16 01:26:16,463 INFO  L342   CegarLoopForPetriNet]: 43 programPoint places, 65 predicate places.
[2020-10-16 01:26:16,463 INFO  L481      AbstractCegarLoop]: Abstraction has has 108 places, 72 transitions, 650 flow
[2020-10-16 01:26:16,464 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 01:26:16,464 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:26:16,464 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:26:16,464 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2020-10-16 01:26:16,464 INFO  L429      AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:26:16,464 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:26:16,464 INFO  L82        PathProgramCache]: Analyzing trace with hash -2019501932, now seen corresponding path program 2 times
[2020-10-16 01:26:16,464 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:26:16,464 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004742777]
[2020-10-16 01:26:16,465 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:26:16,491 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:26:16,563 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:26:16,563 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004742777]
[2020-10-16 01:26:16,564 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:26:16,564 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 01:26:16,564 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702724952]
[2020-10-16 01:26:16,564 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 01:26:16,564 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:26:16,565 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 01:26:16,565 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2020-10-16 01:26:16,566 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 151 out of 204
[2020-10-16 01:26:16,567 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 72 transitions, 650 flow. Second operand 7 states.
[2020-10-16 01:26:16,567 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:26:16,567 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 204
[2020-10-16 01:26:16,568 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:26:16,935 INFO  L129       PetriNetUnfolder]: 946/2144 cut-off events.
[2020-10-16 01:26:16,935 INFO  L130       PetriNetUnfolder]: For 14870/17496 co-relation queries the response was YES.
[2020-10-16 01:26:16,951 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 10378 conditions, 2144 events. 946/2144 cut-off events. For 14870/17496 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 18899 event pairs, 13 based on Foata normal form. 106/1851 useless extension candidates. Maximal degree in co-relation 10343. Up to 1247 conditions per place. 
[2020-10-16 01:26:16,954 INFO  L132   encePairwiseOnDemand]: 198/204 looper letters, 37 selfloop transitions, 5 changer transitions 23/107 dead transitions.
[2020-10-16 01:26:16,954 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 107 transitions, 1108 flow
[2020-10-16 01:26:16,955 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-10-16 01:26:16,955 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-10-16 01:26:16,955 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1385 transitions.
[2020-10-16 01:26:16,956 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7543572984749455
[2020-10-16 01:26:16,956 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1385 transitions.
[2020-10-16 01:26:16,956 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1385 transitions.
[2020-10-16 01:26:16,957 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:26:16,957 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1385 transitions.
[2020-10-16 01:26:16,958 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 10 states.
[2020-10-16 01:26:16,960 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states.
[2020-10-16 01:26:16,961 INFO  L81            ComplementDD]: Finished complementDD. Result 10 states.
[2020-10-16 01:26:16,961 INFO  L185             Difference]: Start difference. First operand has 108 places, 72 transitions, 650 flow. Second operand 9 states and 1385 transitions.
[2020-10-16 01:26:16,961 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 107 transitions, 1108 flow
[2020-10-16 01:26:17,042 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 107 transitions, 998 flow, removed 24 selfloop flow, removed 16 redundant places.
[2020-10-16 01:26:17,043 INFO  L241             Difference]: Finished difference. Result has 94 places, 64 transitions, 519 flow
[2020-10-16 01:26:17,044 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=519, PETRI_PLACES=94, PETRI_TRANSITIONS=64}
[2020-10-16 01:26:17,044 INFO  L342   CegarLoopForPetriNet]: 43 programPoint places, 51 predicate places.
[2020-10-16 01:26:17,044 INFO  L481      AbstractCegarLoop]: Abstraction has has 94 places, 64 transitions, 519 flow
[2020-10-16 01:26:17,044 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 01:26:17,044 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:26:17,044 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:26:17,044 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2020-10-16 01:26:17,044 INFO  L429      AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:26:17,045 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:26:17,045 INFO  L82        PathProgramCache]: Analyzing trace with hash -1966110640, now seen corresponding path program 3 times
[2020-10-16 01:26:17,045 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:26:17,045 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798625921]
[2020-10-16 01:26:17,045 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:26:17,069 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:26:17,241 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:26:17,241 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798625921]
[2020-10-16 01:26:17,241 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:26:17,242 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 01:26:17,242 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341281692]
[2020-10-16 01:26:17,242 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 01:26:17,242 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:26:17,243 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 01:26:17,243 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2020-10-16 01:26:17,244 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 148 out of 204
[2020-10-16 01:26:17,245 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 64 transitions, 519 flow. Second operand 7 states.
[2020-10-16 01:26:17,245 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:26:17,245 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 204
[2020-10-16 01:26:17,245 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:26:17,509 INFO  L129       PetriNetUnfolder]: 709/1626 cut-off events.
[2020-10-16 01:26:17,509 INFO  L130       PetriNetUnfolder]: For 9928/13264 co-relation queries the response was YES.
[2020-10-16 01:26:17,518 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 7877 conditions, 1626 events. 709/1626 cut-off events. For 9928/13264 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 13883 event pairs, 3 based on Foata normal form. 98/1390 useless extension candidates. Maximal degree in co-relation 7845. Up to 1078 conditions per place. 
[2020-10-16 01:26:17,520 INFO  L132   encePairwiseOnDemand]: 196/204 looper letters, 8 selfloop transitions, 14 changer transitions 7/68 dead transitions.
[2020-10-16 01:26:17,520 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 68 transitions, 619 flow
[2020-10-16 01:26:17,520 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 01:26:17,521 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-10-16 01:26:17,521 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1053 transitions.
[2020-10-16 01:26:17,522 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7373949579831933
[2020-10-16 01:26:17,522 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1053 transitions.
[2020-10-16 01:26:17,522 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1053 transitions.
[2020-10-16 01:26:17,522 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:26:17,522 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1053 transitions.
[2020-10-16 01:26:17,523 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 8 states.
[2020-10-16 01:26:17,525 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states.
[2020-10-16 01:26:17,525 INFO  L81            ComplementDD]: Finished complementDD. Result 8 states.
[2020-10-16 01:26:17,525 INFO  L185             Difference]: Start difference. First operand has 94 places, 64 transitions, 519 flow. Second operand 7 states and 1053 transitions.
[2020-10-16 01:26:17,525 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 68 transitions, 619 flow
[2020-10-16 01:26:17,568 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 68 transitions, 577 flow, removed 9 selfloop flow, removed 11 redundant places.
[2020-10-16 01:26:17,569 INFO  L241             Difference]: Finished difference. Result has 87 places, 61 transitions, 509 flow
[2020-10-16 01:26:17,569 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=509, PETRI_PLACES=87, PETRI_TRANSITIONS=61}
[2020-10-16 01:26:17,569 INFO  L342   CegarLoopForPetriNet]: 43 programPoint places, 44 predicate places.
[2020-10-16 01:26:17,569 INFO  L481      AbstractCegarLoop]: Abstraction has has 87 places, 61 transitions, 509 flow
[2020-10-16 01:26:17,570 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 01:26:17,570 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:26:17,570 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:26:17,570 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2020-10-16 01:26:17,570 INFO  L429      AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:26:17,570 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:26:17,570 INFO  L82        PathProgramCache]: Analyzing trace with hash -2531490, now seen corresponding path program 4 times
[2020-10-16 01:26:17,570 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:26:17,570 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735896523]
[2020-10-16 01:26:17,571 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:26:17,619 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:26:17,886 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:26:17,886 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735896523]
[2020-10-16 01:26:17,887 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:26:17,887 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-10-16 01:26:17,887 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868689819]
[2020-10-16 01:26:17,888 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-10-16 01:26:17,888 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:26:17,888 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-10-16 01:26:17,889 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2020-10-16 01:26:17,890 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 148 out of 204
[2020-10-16 01:26:17,891 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 61 transitions, 509 flow. Second operand 9 states.
[2020-10-16 01:26:17,891 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:26:17,892 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 204
[2020-10-16 01:26:17,892 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:26:18,095 INFO  L129       PetriNetUnfolder]: 479/1136 cut-off events.
[2020-10-16 01:26:18,096 INFO  L130       PetriNetUnfolder]: For 6138/7592 co-relation queries the response was YES.
[2020-10-16 01:26:18,102 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 5468 conditions, 1136 events. 479/1136 cut-off events. For 6138/7592 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 8939 event pairs, 5 based on Foata normal form. 41/979 useless extension candidates. Maximal degree in co-relation 5439. Up to 779 conditions per place. 
[2020-10-16 01:26:18,103 INFO  L132   encePairwiseOnDemand]: 198/204 looper letters, 13 selfloop transitions, 7 changer transitions 10/65 dead transitions.
[2020-10-16 01:26:18,104 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 65 transitions, 603 flow
[2020-10-16 01:26:18,104 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 01:26:18,104 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2020-10-16 01:26:18,105 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 903 transitions.
[2020-10-16 01:26:18,105 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7377450980392157
[2020-10-16 01:26:18,105 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 903 transitions.
[2020-10-16 01:26:18,105 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 903 transitions.
[2020-10-16 01:26:18,105 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:26:18,105 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 903 transitions.
[2020-10-16 01:26:18,106 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 7 states.
[2020-10-16 01:26:18,107 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states.
[2020-10-16 01:26:18,107 INFO  L81            ComplementDD]: Finished complementDD. Result 7 states.
[2020-10-16 01:26:18,107 INFO  L185             Difference]: Start difference. First operand has 87 places, 61 transitions, 509 flow. Second operand 6 states and 903 transitions.
[2020-10-16 01:26:18,107 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 65 transitions, 603 flow
[2020-10-16 01:26:18,129 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 65 transitions, 551 flow, removed 13 selfloop flow, removed 7 redundant places.
[2020-10-16 01:26:18,130 INFO  L241             Difference]: Finished difference. Result has 85 places, 54 transitions, 440 flow
[2020-10-16 01:26:18,130 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=440, PETRI_PLACES=85, PETRI_TRANSITIONS=54}
[2020-10-16 01:26:18,131 INFO  L342   CegarLoopForPetriNet]: 43 programPoint places, 42 predicate places.
[2020-10-16 01:26:18,131 INFO  L481      AbstractCegarLoop]: Abstraction has has 85 places, 54 transitions, 440 flow
[2020-10-16 01:26:18,131 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-10-16 01:26:18,131 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:26:18,131 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:26:18,131 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2020-10-16 01:26:18,131 INFO  L429      AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:26:18,131 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:26:18,132 INFO  L82        PathProgramCache]: Analyzing trace with hash 951996416, now seen corresponding path program 5 times
[2020-10-16 01:26:18,132 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:26:18,132 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785271659]
[2020-10-16 01:26:18,132 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:26:18,169 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 01:26:18,169 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 01:26:18,199 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 01:26:18,200 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 01:26:18,238 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-16 01:26:18,238 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-16 01:26:18,239 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2020-10-16 01:26:18,263 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:26:18,264 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:26:18,266 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:26:18,266 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:26:18,267 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:26:18,267 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:26:18,267 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:26:18,267 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:26:18,267 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:26:18,267 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:26:18,268 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:26:18,268 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:26:18,268 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:26:18,269 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:26:18,269 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:26:18,269 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:26:18,269 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:26:18,269 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:26:18,269 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:26:18,270 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:26:18,270 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:26:18,270 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:26:18,271 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:26:18,271 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:26:18,271 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:26:18,271 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:26:18,271 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:26:18,271 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:26:18,272 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:26:18,272 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:26:18,272 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:26:18,272 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:26:18,273 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:26:18,273 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:26:18,273 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:26:18,273 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:26:18,273 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:26:18,273 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:26:18,274 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:26:18,274 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:26:18,274 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:26:18,274 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:26:18,275 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:26:18,275 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:26:18,275 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:26:18,275 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:26:18,275 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:26:18,275 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:26:18,275 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:26:18,276 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:26:18,276 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:26:18,276 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:26:18,276 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:26:18,276 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:26:18,276 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:26:18,277 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:26:18,277 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:26:18,277 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:26:18,277 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:26:18,277 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:26:18,278 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:26:18,278 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:26:18,278 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:26:18,278 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:26:18,395 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:26:18 BasicIcfg
[2020-10-16 01:26:18,396 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-16 01:26:18,399 INFO  L168              Benchmark]: Toolchain (without parser) took 28626.37 ms. Allocated memory was 252.2 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 206.6 MB in the beginning and 572.0 MB in the end (delta: -365.5 MB). Peak memory consumption was 768.6 MB. Max. memory is 14.2 GB.
[2020-10-16 01:26:18,399 INFO  L168              Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 252.2 MB. Free memory was 230.2 MB in the beginning and 229.4 MB in the end (delta: 839.2 kB). Peak memory consumption was 839.2 kB. Max. memory is 14.2 GB.
[2020-10-16 01:26:18,400 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 738.41 ms. Allocated memory was 252.2 MB in the beginning and 318.8 MB in the end (delta: 66.6 MB). Free memory was 206.6 MB in the beginning and 268.6 MB in the end (delta: -62.0 MB). Peak memory consumption was 31.6 MB. Max. memory is 14.2 GB.
[2020-10-16 01:26:18,400 INFO  L168              Benchmark]: Boogie Procedure Inliner took 70.37 ms. Allocated memory is still 318.8 MB. Free memory was 268.6 MB in the beginning and 265.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB.
[2020-10-16 01:26:18,401 INFO  L168              Benchmark]: Boogie Preprocessor took 44.53 ms. Allocated memory is still 318.8 MB. Free memory was 265.2 MB in the beginning and 262.7 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:26:18,404 INFO  L168              Benchmark]: RCFGBuilder took 2236.75 ms. Allocated memory was 318.8 MB in the beginning and 359.7 MB in the end (delta: 40.9 MB). Free memory was 262.7 MB in the beginning and 182.6 MB in the end (delta: 80.1 MB). Peak memory consumption was 120.9 MB. Max. memory is 14.2 GB.
[2020-10-16 01:26:18,405 INFO  L168              Benchmark]: TraceAbstraction took 25529.52 ms. Allocated memory was 359.7 MB in the beginning and 1.4 GB in the end (delta: 1.0 GB). Free memory was 180.5 MB in the beginning and 572.0 MB in the end (delta: -391.5 MB). Peak memory consumption was 635.1 MB. Max. memory is 14.2 GB.
[2020-10-16 01:26:18,410 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.26 ms. Allocated memory is still 252.2 MB. Free memory was 230.2 MB in the beginning and 229.4 MB in the end (delta: 839.2 kB). Peak memory consumption was 839.2 kB. Max. memory is 14.2 GB.
 * CACSL2BoogieTranslator took 738.41 ms. Allocated memory was 252.2 MB in the beginning and 318.8 MB in the end (delta: 66.6 MB). Free memory was 206.6 MB in the beginning and 268.6 MB in the end (delta: -62.0 MB). Peak memory consumption was 31.6 MB. Max. memory is 14.2 GB.
 * Boogie Procedure Inliner took 70.37 ms. Allocated memory is still 318.8 MB. Free memory was 268.6 MB in the beginning and 265.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB.
 * Boogie Preprocessor took 44.53 ms. Allocated memory is still 318.8 MB. Free memory was 265.2 MB in the beginning and 262.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * RCFGBuilder took 2236.75 ms. Allocated memory was 318.8 MB in the beginning and 359.7 MB in the end (delta: 40.9 MB). Free memory was 262.7 MB in the beginning and 182.6 MB in the end (delta: 80.1 MB). Peak memory consumption was 120.9 MB. Max. memory is 14.2 GB.
 * TraceAbstraction took 25529.52 ms. Allocated memory was 359.7 MB in the beginning and 1.4 GB in the end (delta: 1.0 GB). Free memory was 180.5 MB in the beginning and 572.0 MB in the end (delta: -391.5 MB). Peak memory consumption was 635.1 MB. Max. memory is 14.2 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    1626 VarBasedMoverChecksPositive, 67 VarBasedMoverChecksNegative, 12 SemBasedMoverChecksPositive, 55 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 130 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.8s, 120 PlacesBefore, 43 PlacesAfterwards, 109 TransitionsBefore, 31 TransitionsAfterwards, 2670 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 91 TotalNumberOfCompositions, 7608 MoverChecksTotal
  - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L699]               0  int __unbuffered_cnt = 0;
[L701]               0  int __unbuffered_p2_EAX = 0;
[L703]               0  int __unbuffered_p3_EAX = 0;
[L705]               0  int __unbuffered_p3_EBX = 0;
[L707]               0  int a = 0;
[L709]               0  int b = 0;
[L710]               0  _Bool main$tmp_guard0;
[L711]               0  _Bool main$tmp_guard1;
[L713]               0  int x = 0;
[L715]               0  int y = 0;
[L716]               0  _Bool y$flush_delayed;
[L717]               0  int y$mem_tmp;
[L718]               0  _Bool y$r_buff0_thd0;
[L719]               0  _Bool y$r_buff0_thd1;
[L720]               0  _Bool y$r_buff0_thd2;
[L721]               0  _Bool y$r_buff0_thd3;
[L722]               0  _Bool y$r_buff0_thd4;
[L723]               0  _Bool y$r_buff1_thd0;
[L724]               0  _Bool y$r_buff1_thd1;
[L725]               0  _Bool y$r_buff1_thd2;
[L726]               0  _Bool y$r_buff1_thd3;
[L727]               0  _Bool y$r_buff1_thd4;
[L728]               0  _Bool y$read_delayed;
[L729]               0  int *y$read_delayed_var;
[L730]               0  int y$w_buff0;
[L731]               0  _Bool y$w_buff0_used;
[L732]               0  int y$w_buff1;
[L733]               0  _Bool y$w_buff1_used;
[L735]               0  int z = 0;
[L736]               0  _Bool weak$$choice0;
[L737]               0  _Bool weak$$choice2;
[L840]               0  pthread_t t1081;
[L841]  FCALL, FORK  0  pthread_create(&t1081, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L842]               0  pthread_t t1082;
[L843]  FCALL, FORK  0  pthread_create(&t1082, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L844]               0  pthread_t t1083;
[L845]  FCALL, FORK  0  pthread_create(&t1083, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L776]               3  y$w_buff1 = y$w_buff0
[L777]               3  y$w_buff0 = 2
[L778]               3  y$w_buff1_used = y$w_buff0_used
[L779]               3  y$w_buff0_used = (_Bool)1
[L7]    COND TRUE    3  !expression
[L7]                 3  __VERIFIER_error()
[L781]               3  y$r_buff1_thd0 = y$r_buff0_thd0
[L782]               3  y$r_buff1_thd1 = y$r_buff0_thd1
[L783]               3  y$r_buff1_thd2 = y$r_buff0_thd2
[L784]               3  y$r_buff1_thd3 = y$r_buff0_thd3
[L785]               3  y$r_buff1_thd4 = y$r_buff0_thd4
[L786]               3  y$r_buff0_thd3 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L846]               0  pthread_t t1084;
[L847]  FCALL, FORK  0  pthread_create(&t1084, ((void *)0), P3, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L789]               3  __unbuffered_p2_EAX = z
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L806]               4  z = 1
[L809]               4  a = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L812]               4  __unbuffered_p3_EAX = a
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L815]               4  __unbuffered_p3_EBX = b
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L741]               1  b = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L744]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L756]               2  x = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L759]               2  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L792]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L792]               3  y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L793]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L793]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L794]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L794]               3  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L795]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L795]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L796]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L796]               3  y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L749]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L751]               1  return 0;
[L762]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L762]               2  y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L763]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L763]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L764]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L764]               2  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L765]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L765]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L766]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L766]               2  y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L769]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L771]               2  return 0;
[L799]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L801]               3  return 0;
[L818]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L818]               4  y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L819]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used
[L819]               4  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used
[L820]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used
[L820]               4  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used
[L821]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4
[L821]               4  y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4
[L822]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4
[L822]               4  y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4
[L825]               4  __unbuffered_cnt = __unbuffered_cnt + 1
[L827]               4  return 0;
[L849]               0  main$tmp_guard0 = __unbuffered_cnt == 4
        VAL             [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L3]    COND FALSE   0  !(!cond)
[L853]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L853]               0  y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L854]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L854]               0  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L855]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L855]               0  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L856]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L856]               0  y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L857]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L857]               0  y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L860]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L861]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L862]               0  y$flush_delayed = weak$$choice2
[L863]               0  y$mem_tmp = y
[L864]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L864]               0  y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L865]  EXPR         0  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L865]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)
[L865]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0
[L865]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)
[L865]  EXPR         0  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L865]               0  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L866]  EXPR         0  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L866]               0  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L867]  EXPR         0  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L867]               0  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L868]  EXPR         0  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L868]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L868]  EXPR         0  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L868]               0  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L869]  EXPR         0  weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L869]               0  y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L870]  EXPR         0  weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L870]               0  y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L871]               0  main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0)
[L872]  EXPR         0  y$flush_delayed ? y$mem_tmp : y
[L872]               0  y = y$flush_delayed ? y$mem_tmp : y
[L873]               0  y$flush_delayed = (_Bool)0
[L7]    COND TRUE    0  !expression
[L7]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 5 procedures, 112 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: 25.2s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 14.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.9s, HoareTripleCheckerStatistics: 134 SDtfs, 204 SDslu, 174 SDs, 0 SdLazy, 1112 SolverSat, 314 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 172 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1495occurred in iteration=20, 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.2s InterpolantComputationTime, 512 NumberOfCodeBlocks, 512 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 458 ConstructedInterpolants, 0 QuantifiedInterpolants, 75512 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...