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


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


This is Ultimate 0.1.25-7bb8cbd
[2020-10-16 01:31:07,225 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-16 01:31:07,228 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-16 01:31:07,251 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-16 01:31:07,251 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-16 01:31:07,252 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-16 01:31:07,253 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-16 01:31:07,255 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-16 01:31:07,257 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-16 01:31:07,257 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-16 01:31:07,258 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-16 01:31:07,259 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-16 01:31:07,260 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-16 01:31:07,261 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-16 01:31:07,262 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-16 01:31:07,263 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-16 01:31:07,263 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-16 01:31:07,264 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-16 01:31:07,266 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-16 01:31:07,268 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-16 01:31:07,269 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-16 01:31:07,270 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-16 01:31:07,271 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-16 01:31:07,272 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-16 01:31:07,274 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-16 01:31:07,274 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-16 01:31:07,275 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-16 01:31:07,275 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-16 01:31:07,276 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-16 01:31:07,277 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-16 01:31:07,277 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-16 01:31:07,278 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-16 01:31:07,278 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-16 01:31:07,279 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-16 01:31:07,280 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-16 01:31:07,280 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-16 01:31:07,281 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-16 01:31:07,281 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-16 01:31:07,281 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-16 01:31:07,282 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-16 01:31:07,283 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-16 01:31:07,283 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:31:07,305 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-16 01:31:07,306 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-16 01:31:07,307 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-16 01:31:07,307 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-16 01:31:07,307 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-16 01:31:07,307 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-16 01:31:07,308 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-16 01:31:07,308 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-16 01:31:07,308 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-16 01:31:07,308 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-16 01:31:07,308 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-16 01:31:07,308 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-16 01:31:07,309 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-16 01:31:07,309 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-16 01:31:07,309 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-16 01:31:07,309 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-16 01:31:07,309 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-16 01:31:07,310 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-16 01:31:07,310 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-16 01:31:07,310 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-16 01:31:07,310 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-16 01:31:07,310 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 01:31:07,310 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-16 01:31:07,311 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-16 01:31:07,311 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-16 01:31:07,311 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-16 01:31:07,311 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-16 01:31:07,311 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2020-10-16 01:31:07,312 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-16 01:31:07,596 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-16 01:31:07,608 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-16 01:31:07,611 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-16 01:31:07,613 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-16 01:31:07,613 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-16 01:31:07,614 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_tso.oepc.i
[2020-10-16 01:31:07,685 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ac73678b/5d412199c1f64e5d85b5ece5eabfe2a4/FLAG1618f8a0d
[2020-10-16 01:31:08,259 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-16 01:31:08,259 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_tso.oepc.i
[2020-10-16 01:31:08,274 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ac73678b/5d412199c1f64e5d85b5ece5eabfe2a4/FLAG1618f8a0d
[2020-10-16 01:31:08,519 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ac73678b/5d412199c1f64e5d85b5ece5eabfe2a4
[2020-10-16 01:31:08,532 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-16 01:31:08,534 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-16 01:31:08,537 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-16 01:31:08,537 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-16 01:31:08,541 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-16 01:31:08,543 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:31:08" (1/1) ...
[2020-10-16 01:31:08,547 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c7c8ff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:08, skipping insertion in model container
[2020-10-16 01:31:08,547 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:31:08" (1/1) ...
[2020-10-16 01:31:08,556 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-16 01:31:08,626 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-16 01:31:09,189 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 01:31:09,202 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-16 01:31:09,264 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 01:31:09,374 INFO  L208         MainTranslator]: Completed translation
[2020-10-16 01:31:09,375 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:09 WrapperNode
[2020-10-16 01:31:09,376 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-16 01:31:09,376 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-16 01:31:09,377 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-16 01:31:09,377 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-16 01:31:09,386 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:31:09" (1/1) ...
[2020-10-16 01:31:09,415 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:31:09" (1/1) ...
[2020-10-16 01:31:09,456 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-16 01:31:09,457 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-16 01:31:09,457 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-16 01:31:09,457 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-16 01:31:09,467 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:09" (1/1) ...
[2020-10-16 01:31:09,468 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:09" (1/1) ...
[2020-10-16 01:31:09,472 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:09" (1/1) ...
[2020-10-16 01:31:09,473 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:09" (1/1) ...
[2020-10-16 01:31:09,484 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:09" (1/1) ...
[2020-10-16 01:31:09,488 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:09" (1/1) ...
[2020-10-16 01:31:09,491 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:09" (1/1) ...
[2020-10-16 01:31:09,497 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-16 01:31:09,498 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-16 01:31:09,498 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-16 01:31:09,498 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-16 01:31:09,499 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:09" (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:31:09,563 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-16 01:31:09,563 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-16 01:31:09,564 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-16 01:31:09,564 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-16 01:31:09,564 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-16 01:31:09,564 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-16 01:31:09,564 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-16 01:31:09,565 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-16 01:31:09,565 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-16 01:31:09,565 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-16 01:31:09,565 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2020-10-16 01:31:09,565 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2020-10-16 01:31:09,565 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-16 01:31:09,565 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-16 01:31:09,566 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-16 01:31:09,568 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:31:11,428 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-16 01:31:11,428 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-16 01:31:11,430 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:31:11 BoogieIcfgContainer
[2020-10-16 01:31:11,431 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-16 01:31:11,432 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-16 01:31:11,432 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-16 01:31:11,436 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-16 01:31:11,436 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:31:08" (1/3) ...
[2020-10-16 01:31:11,437 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61ea2803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:31:11, skipping insertion in model container
[2020-10-16 01:31:11,437 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:09" (2/3) ...
[2020-10-16 01:31:11,437 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61ea2803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:31:11, skipping insertion in model container
[2020-10-16 01:31:11,438 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:31:11" (3/3) ...
[2020-10-16 01:31:11,440 INFO  L111   eAbstractionObserver]: Analyzing ICFG mix057_tso.oepc.i
[2020-10-16 01:31:11,452 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-16 01:31:11,463 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-16 01:31:11,464 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-16 01:31:11,508 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,509 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,509 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,509 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,510 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,510 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,510 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,510 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,511 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,511 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,511 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,511 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,512 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,512 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,512 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,512 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,512 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,513 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,513 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,513 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,513 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,513 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,514 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,514 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,514 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,515 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,515 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,516 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,516 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,516 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,516 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,517 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,517 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,517 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,517 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,518 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,518 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,519 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,519 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,520 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,521 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,521 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,532 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,533 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,533 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,533 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,533 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,533 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,534 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,534 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,534 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,534 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,542 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,542 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,542 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,542 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,543 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,543 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,543 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,543 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,543 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,543 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,544 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,544 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,547 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,547 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,548 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,548 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,550 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,550 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,550 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,551 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:31:11,568 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2020-10-16 01:31:11,592 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-16 01:31:11,593 INFO  L378      AbstractCegarLoop]: Hoare is false
[2020-10-16 01:31:11,593 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-16 01:31:11,593 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-16 01:31:11,593 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-16 01:31:11,593 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-16 01:31:11,593 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-16 01:31:11,594 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-16 01:31:11,613 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 118 places, 107 transitions, 234 flow
[2020-10-16 01:31:11,689 INFO  L129       PetriNetUnfolder]: 2/103 cut-off events.
[2020-10-16 01:31:11,690 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 01:31:11,699 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 116 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. 
[2020-10-16 01:31:11,700 INFO  L82        GeneralOperation]: Start removeDead. Operand has 118 places, 107 transitions, 234 flow
[2020-10-16 01:31:11,712 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 114 places, 103 transitions, 218 flow
[2020-10-16 01:31:11,715 INFO  L129   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-16 01:31:11,720 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 103 transitions, 218 flow
[2020-10-16 01:31:11,724 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 103 transitions, 218 flow
[2020-10-16 01:31:11,725 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 114 places, 103 transitions, 218 flow
[2020-10-16 01:31:11,784 INFO  L129       PetriNetUnfolder]: 2/103 cut-off events.
[2020-10-16 01:31:11,785 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 01:31:11,786 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 116 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. 
[2020-10-16 01:31:11,794 INFO  L117        LiptonReduction]: Number of co-enabled transitions 2352
[2020-10-16 01:31:11,939 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:31:11,939 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:11,941 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:11,942 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:11,950 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:11,951 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:31:11,961 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:31:11,962 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:31:12,001 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:12,001 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:12,003 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:12,003 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:12,007 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:12,008 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:31:12,011 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:31:12,012 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:31:12,246 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-16 01:31:12,246 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:12,248 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-16 01:31:12,248 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:12,278 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-16 01:31:12,278 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:12,280 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-16 01:31:12,280 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:13,544 WARN  L193               SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 228 DAG size of output: 188
[2020-10-16 01:31:13,559 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term
[2020-10-16 01:31:13,560 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:13,561 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-16 01:31:13,561 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:14,885 WARN  L193               SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 145 DAG size of output: 125
[2020-10-16 01:31:14,944 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 01:31:14,945 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:14,998 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:31:14,998 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:14,999 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:14,999 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:15,005 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:15,006 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:31:15,012 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:31:15,013 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:31:15,056 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:31:15,056 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:15,057 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:15,057 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:15,062 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:15,063 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:31:15,066 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:31:15,067 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:31:15,165 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:15,165 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:15,166 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:15,167 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:15,173 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:15,173 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:31:15,178 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:31:15,178 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:31:15,210 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:31:15,210 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:15,211 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:15,211 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:15,213 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:15,214 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:31:15,218 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:31:15,218 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:31:15,452 WARN  L193               SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45
[2020-10-16 01:31:15,877 WARN  L193               SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-16 01:31:15,982 WARN  L193               SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 53
[2020-10-16 01:31:16,167 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-16 01:31:16,167 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:16,168 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term
[2020-10-16 01:31:16,169 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:16,169 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:16,170 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:16,171 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:16,171 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:16,173 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:16,173 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:16,175 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:16,175 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:16,177 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-16 01:31:16,177 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:16,179 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:16,179 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:16,181 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:16,181 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:16,199 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-16 01:31:16,199 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:31:16,201 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-16 01:31:16,201 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:16,745 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-16 01:31:16,745 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:16,747 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term
[2020-10-16 01:31:16,747 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:16,748 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:16,748 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:16,749 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:16,749 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:16,751 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:16,751 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:16,753 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:16,753 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:16,756 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-16 01:31:16,756 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:16,757 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:16,758 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:16,759 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:16,759 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:16,780 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-16 01:31:16,780 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:31:16,782 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-16 01:31:16,783 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:17,256 WARN  L193               SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 125
[2020-10-16 01:31:17,654 WARN  L193               SmtUtils]: Spent 395.00 ms on a formula simplification that was a NOOP. DAG size: 125
[2020-10-16 01:31:17,785 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-16 01:31:17,789 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:31:17,791 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-16 01:31:17,791 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:17,811 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-16 01:31:17,814 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:17,816 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term
[2020-10-16 01:31:17,817 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:17,818 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:17,818 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:17,819 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:17,820 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:17,822 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:17,823 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:17,826 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:17,826 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:17,829 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-16 01:31:17,830 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:17,832 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:17,832 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:17,835 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:17,837 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:17,925 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-16 01:31:17,925 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:31:17,928 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-16 01:31:17,929 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:17,954 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-16 01:31:17,954 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:17,955 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term
[2020-10-16 01:31:17,955 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:17,956 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:17,956 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:17,957 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:17,958 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:17,959 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:17,960 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:17,961 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:17,961 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:17,964 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-16 01:31:17,964 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:17,966 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:17,966 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:17,967 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:17,967 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:18,190 WARN  L193               SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 58
[2020-10-16 01:31:18,295 WARN  L193               SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 58
[2020-10-16 01:31:19,260 WARN  L193               SmtUtils]: Spent 850.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 129
[2020-10-16 01:31:19,639 WARN  L193               SmtUtils]: Spent 375.00 ms on a formula simplification that was a NOOP. DAG size: 126
[2020-10-16 01:31:20,306 WARN  L193               SmtUtils]: Spent 666.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 109
[2020-10-16 01:31:20,677 WARN  L193               SmtUtils]: Spent 368.00 ms on a formula simplification that was a NOOP. DAG size: 106
[2020-10-16 01:31:20,725 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 01:31:20,726 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:20,895 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 01:31:20,896 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:20,961 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-16 01:31:20,961 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:31:20,963 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-16 01:31:20,964 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:20,980 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-16 01:31:20,981 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:20,982 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term
[2020-10-16 01:31:20,985 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:20,986 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:20,986 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:20,987 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:20,987 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:20,991 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:20,992 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:20,994 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:20,994 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:20,997 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-16 01:31:20,997 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:20,999 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:21,000 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:21,001 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:21,001 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:21,070 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-16 01:31:21,071 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:21,075 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term
[2020-10-16 01:31:21,075 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:21,076 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:21,077 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:21,079 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:21,079 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:21,081 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:21,081 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:21,082 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:21,083 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:21,086 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-16 01:31:21,087 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:21,089 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:21,090 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:21,091 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:21,091 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:21,112 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-16 01:31:21,113 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:31:21,119 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-16 01:31:21,121 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:21,650 WARN  L193               SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 134
[2020-10-16 01:31:21,992 WARN  L193               SmtUtils]: Spent 340.00 ms on a formula simplification that was a NOOP. DAG size: 132
[2020-10-16 01:31:22,183 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:22,184 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:22,184 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:22,185 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:22,186 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:22,186 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:31:22,188 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:31:22,188 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:31:22,202 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:31:22,203 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:22,203 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:22,204 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:22,205 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:22,205 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:22,207 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:31:22,207 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:22,224 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:22,225 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:22,226 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:22,226 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:22,227 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:22,228 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:22,229 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:31:22,229 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:31:22,248 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:22,249 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:22,249 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:22,250 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:31:22,251 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:31:22,252 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:31:22,253 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:31:22,254 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:31:22,557 WARN  L193               SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91
[2020-10-16 01:31:22,684 WARN  L193               SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 89
[2020-10-16 01:31:22,720 INFO  L132        LiptonReduction]: Checked pairs total: 6523
[2020-10-16 01:31:22,720 INFO  L134        LiptonReduction]: Total number of compositions: 87
[2020-10-16 01:31:22,723 INFO  L182   CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11011
[2020-10-16 01:31:22,732 INFO  L129       PetriNetUnfolder]: 0/20 cut-off events.
[2020-10-16 01:31:22,733 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 01:31:22,733 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:31:22,734 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:31:22,734 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:31:22,740 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:31:22,740 INFO  L82        PathProgramCache]: Analyzing trace with hash 1680903237, now seen corresponding path program 1 times
[2020-10-16 01:31:22,750 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:31:22,751 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844791095]
[2020-10-16 01:31:22,751 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:31:22,923 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:31:23,040 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:31:23,040 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844791095]
[2020-10-16 01:31:23,041 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:31:23,041 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 01:31:23,042 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132383664]
[2020-10-16 01:31:23,052 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 01:31:23,052 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:31:23,067 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 01:31:23,069 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 01:31:23,072 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 160 out of 194
[2020-10-16 01:31:23,074 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states.
[2020-10-16 01:31:23,074 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:31:23,075 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 194
[2020-10-16 01:31:23,076 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:31:23,160 INFO  L129       PetriNetUnfolder]: 23/69 cut-off events.
[2020-10-16 01:31:23,160 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 01:31:23,161 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 130 conditions, 69 events. 23/69 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 217 event pairs, 9 based on Foata normal form. 6/69 useless extension candidates. Maximal degree in co-relation 119. Up to 37 conditions per place. 
[2020-10-16 01:31:23,163 INFO  L132   encePairwiseOnDemand]: 190/194 looper letters, 7 selfloop transitions, 2 changer transitions 2/30 dead transitions.
[2020-10-16 01:31:23,163 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 30 transitions, 94 flow
[2020-10-16 01:31:23,164 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 01:31:23,167 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2020-10-16 01:31:23,178 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions.
[2020-10-16 01:31:23,183 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8487972508591065
[2020-10-16 01:31:23,183 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 494 transitions.
[2020-10-16 01:31:23,184 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 494 transitions.
[2020-10-16 01:31:23,187 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:31:23,193 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 494 transitions.
[2020-10-16 01:31:23,199 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 4 states.
[2020-10-16 01:31:23,212 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states.
[2020-10-16 01:31:23,212 INFO  L81            ComplementDD]: Finished complementDD. Result 4 states.
[2020-10-16 01:31:23,215 INFO  L185             Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 494 transitions.
[2020-10-16 01:31:23,217 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 30 transitions, 94 flow
[2020-10-16 01:31:23,221 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 30 transitions, 90 flow, removed 0 selfloop flow, removed 4 redundant places.
[2020-10-16 01:31:23,225 INFO  L241             Difference]: Finished difference. Result has 37 places, 25 transitions, 62 flow
[2020-10-16 01:31:23,228 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=37, PETRI_TRANSITIONS=25}
[2020-10-16 01:31:23,229 INFO  L342   CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places.
[2020-10-16 01:31:23,229 INFO  L481      AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 62 flow
[2020-10-16 01:31:23,229 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 01:31:23,229 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:31:23,230 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:31:23,230 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-16 01:31:23,230 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:31:23,230 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:31:23,231 INFO  L82        PathProgramCache]: Analyzing trace with hash 440307498, now seen corresponding path program 1 times
[2020-10-16 01:31:23,231 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:31:23,231 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113383975]
[2020-10-16 01:31:23,231 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:31:23,324 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:31:23,390 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:31:23,391 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113383975]
[2020-10-16 01:31:23,391 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:31:23,392 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 01:31:23,392 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710015902]
[2020-10-16 01:31:23,393 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 01:31:23,394 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:31:23,397 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 01:31:23,397 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 01:31:23,400 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 165 out of 194
[2020-10-16 01:31:23,401 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 62 flow. Second operand 3 states.
[2020-10-16 01:31:23,401 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:31:23,402 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 194
[2020-10-16 01:31:23,402 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:31:23,422 INFO  L129       PetriNetUnfolder]: 3/37 cut-off events.
[2020-10-16 01:31:23,422 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 01:31:23,423 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 60 conditions, 37 events. 3/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 73 event pairs, 1 based on Foata normal form. 1/36 useless extension candidates. Maximal degree in co-relation 51. Up to 10 conditions per place. 
[2020-10-16 01:31:23,423 INFO  L132   encePairwiseOnDemand]: 190/194 looper letters, 3 selfloop transitions, 3 changer transitions 0/27 dead transitions.
[2020-10-16 01:31:23,423 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 27 transitions, 78 flow
[2020-10-16 01:31:23,427 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 01:31:23,428 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2020-10-16 01:31:23,431 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions.
[2020-10-16 01:31:23,431 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8625429553264605
[2020-10-16 01:31:23,431 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 502 transitions.
[2020-10-16 01:31:23,431 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 502 transitions.
[2020-10-16 01:31:23,432 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:31:23,433 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 502 transitions.
[2020-10-16 01:31:23,435 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 4 states.
[2020-10-16 01:31:23,440 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states.
[2020-10-16 01:31:23,442 INFO  L81            ComplementDD]: Finished complementDD. Result 4 states.
[2020-10-16 01:31:23,442 INFO  L185             Difference]: Start difference. First operand has 37 places, 25 transitions, 62 flow. Second operand 3 states and 502 transitions.
[2020-10-16 01:31:23,442 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 27 transitions, 78 flow
[2020-10-16 01:31:23,443 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 27 transitions, 74 flow, removed 0 selfloop flow, removed 2 redundant places.
[2020-10-16 01:31:23,444 INFO  L241             Difference]: Finished difference. Result has 37 places, 27 transitions, 77 flow
[2020-10-16 01:31:23,444 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=37, PETRI_TRANSITIONS=27}
[2020-10-16 01:31:23,445 INFO  L342   CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places.
[2020-10-16 01:31:23,445 INFO  L481      AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 77 flow
[2020-10-16 01:31:23,445 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 01:31:23,445 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:31:23,445 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:31:23,446 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-16 01:31:23,446 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:31:23,446 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:31:23,446 INFO  L82        PathProgramCache]: Analyzing trace with hash 764630339, now seen corresponding path program 1 times
[2020-10-16 01:31:23,446 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:31:23,447 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922871663]
[2020-10-16 01:31:23,447 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:31:23,511 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:31:23,591 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:31:23,591 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922871663]
[2020-10-16 01:31:23,592 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:31:23,592 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 01:31:23,594 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525503637]
[2020-10-16 01:31:23,595 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 01:31:23,595 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:31:23,595 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 01:31:23,596 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 01:31:23,597 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 149 out of 194
[2020-10-16 01:31:23,598 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 77 flow. Second operand 3 states.
[2020-10-16 01:31:23,598 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:31:23,598 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 194
[2020-10-16 01:31:23,598 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:31:23,701 INFO  L129       PetriNetUnfolder]: 195/378 cut-off events.
[2020-10-16 01:31:23,701 INFO  L130       PetriNetUnfolder]: For 23/23 co-relation queries the response was YES.
[2020-10-16 01:31:23,704 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 749 conditions, 378 events. 195/378 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1866 event pairs, 112 based on Foata normal form. 2/355 useless extension candidates. Maximal degree in co-relation 739. Up to 267 conditions per place. 
[2020-10-16 01:31:23,707 INFO  L132   encePairwiseOnDemand]: 189/194 looper letters, 9 selfloop transitions, 4 changer transitions 0/32 dead transitions.
[2020-10-16 01:31:23,708 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 32 transitions, 113 flow
[2020-10-16 01:31:23,709 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 01:31:23,709 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2020-10-16 01:31:23,710 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 461 transitions.
[2020-10-16 01:31:23,711 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7920962199312714
[2020-10-16 01:31:23,711 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 461 transitions.
[2020-10-16 01:31:23,711 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 461 transitions.
[2020-10-16 01:31:23,711 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:31:23,712 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 461 transitions.
[2020-10-16 01:31:23,713 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 4 states.
[2020-10-16 01:31:23,714 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states.
[2020-10-16 01:31:23,714 INFO  L81            ComplementDD]: Finished complementDD. Result 4 states.
[2020-10-16 01:31:23,714 INFO  L185             Difference]: Start difference. First operand has 37 places, 27 transitions, 77 flow. Second operand 3 states and 461 transitions.
[2020-10-16 01:31:23,714 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 32 transitions, 113 flow
[2020-10-16 01:31:23,715 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 32 transitions, 110 flow, removed 0 selfloop flow, removed 1 redundant places.
[2020-10-16 01:31:23,716 INFO  L241             Difference]: Finished difference. Result has 39 places, 30 transitions, 100 flow
[2020-10-16 01:31:23,716 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=39, PETRI_TRANSITIONS=30}
[2020-10-16 01:31:23,717 INFO  L342   CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places.
[2020-10-16 01:31:23,717 INFO  L481      AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 100 flow
[2020-10-16 01:31:23,717 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 01:31:23,717 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:31:23,717 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:31:23,718 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-16 01:31:23,718 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:31:23,718 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:31:23,718 INFO  L82        PathProgramCache]: Analyzing trace with hash -2069270506, now seen corresponding path program 1 times
[2020-10-16 01:31:23,718 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:31:23,719 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517339919]
[2020-10-16 01:31:23,719 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:31:23,740 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:31:23,768 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:31:23,768 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517339919]
[2020-10-16 01:31:23,769 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:31:23,769 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 01:31:23,769 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132517308]
[2020-10-16 01:31:23,770 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 01:31:23,770 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:31:23,770 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 01:31:23,770 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 01:31:23,772 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 165 out of 194
[2020-10-16 01:31:23,772 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 100 flow. Second operand 3 states.
[2020-10-16 01:31:23,773 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:31:23,773 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 194
[2020-10-16 01:31:23,773 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:31:23,801 INFO  L129       PetriNetUnfolder]: 18/101 cut-off events.
[2020-10-16 01:31:23,801 INFO  L130       PetriNetUnfolder]: For 60/150 co-relation queries the response was YES.
[2020-10-16 01:31:23,801 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 202 conditions, 101 events. 18/101 cut-off events. For 60/150 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 444 event pairs, 8 based on Foata normal form. 4/96 useless extension candidates. Maximal degree in co-relation 190. Up to 37 conditions per place. 
[2020-10-16 01:31:23,803 INFO  L132   encePairwiseOnDemand]: 191/194 looper letters, 3 selfloop transitions, 3 changer transitions 0/30 dead transitions.
[2020-10-16 01:31:23,803 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 30 transitions, 112 flow
[2020-10-16 01:31:23,804 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 01:31:23,804 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2020-10-16 01:31:23,806 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 501 transitions.
[2020-10-16 01:31:23,806 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8608247422680413
[2020-10-16 01:31:23,806 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 501 transitions.
[2020-10-16 01:31:23,806 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 501 transitions.
[2020-10-16 01:31:23,807 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:31:23,807 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 501 transitions.
[2020-10-16 01:31:23,808 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 4 states.
[2020-10-16 01:31:23,810 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states.
[2020-10-16 01:31:23,810 INFO  L81            ComplementDD]: Finished complementDD. Result 4 states.
[2020-10-16 01:31:23,810 INFO  L185             Difference]: Start difference. First operand has 39 places, 30 transitions, 100 flow. Second operand 3 states and 501 transitions.
[2020-10-16 01:31:23,810 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 30 transitions, 112 flow
[2020-10-16 01:31:23,811 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 108 flow, removed 0 selfloop flow, removed 1 redundant places.
[2020-10-16 01:31:23,812 INFO  L241             Difference]: Finished difference. Result has 41 places, 30 transitions, 107 flow
[2020-10-16 01:31:23,813 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=41, PETRI_TRANSITIONS=30}
[2020-10-16 01:31:23,813 INFO  L342   CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places.
[2020-10-16 01:31:23,813 INFO  L481      AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 107 flow
[2020-10-16 01:31:23,813 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 01:31:23,813 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:31:23,813 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:31:23,814 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-16 01:31:23,814 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:31:23,814 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:31:23,814 INFO  L82        PathProgramCache]: Analyzing trace with hash -1957207105, now seen corresponding path program 1 times
[2020-10-16 01:31:23,814 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:31:23,815 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956357914]
[2020-10-16 01:31:23,815 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:31:23,834 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:31:23,878 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:31:23,879 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956357914]
[2020-10-16 01:31:23,879 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:31:23,879 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 01:31:23,879 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226841935]
[2020-10-16 01:31:23,880 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 01:31:23,880 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:31:23,880 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 01:31:23,880 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 01:31:23,881 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 151 out of 194
[2020-10-16 01:31:23,882 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 107 flow. Second operand 3 states.
[2020-10-16 01:31:23,882 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:31:23,882 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 194
[2020-10-16 01:31:23,882 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:31:23,977 INFO  L129       PetriNetUnfolder]: 194/439 cut-off events.
[2020-10-16 01:31:23,977 INFO  L130       PetriNetUnfolder]: For 355/434 co-relation queries the response was YES.
[2020-10-16 01:31:23,980 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 1033 conditions, 439 events. 194/439 cut-off events. For 355/434 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2506 event pairs, 101 based on Foata normal form. 2/403 useless extension candidates. Maximal degree in co-relation 1020. Up to 253 conditions per place. 
[2020-10-16 01:31:23,983 INFO  L132   encePairwiseOnDemand]: 190/194 looper letters, 8 selfloop transitions, 4 changer transitions 0/34 dead transitions.
[2020-10-16 01:31:23,983 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 34 transitions, 143 flow
[2020-10-16 01:31:23,984 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 01:31:23,985 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2020-10-16 01:31:23,986 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 464 transitions.
[2020-10-16 01:31:23,986 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7972508591065293
[2020-10-16 01:31:23,986 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 464 transitions.
[2020-10-16 01:31:23,986 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 464 transitions.
[2020-10-16 01:31:23,987 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:31:23,987 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 464 transitions.
[2020-10-16 01:31:23,988 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 4 states.
[2020-10-16 01:31:23,989 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states.
[2020-10-16 01:31:23,989 INFO  L81            ComplementDD]: Finished complementDD. Result 4 states.
[2020-10-16 01:31:23,990 INFO  L185             Difference]: Start difference. First operand has 41 places, 30 transitions, 107 flow. Second operand 3 states and 464 transitions.
[2020-10-16 01:31:23,990 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 34 transitions, 143 flow
[2020-10-16 01:31:23,992 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 34 transitions, 138 flow, removed 1 selfloop flow, removed 1 redundant places.
[2020-10-16 01:31:23,993 INFO  L241             Difference]: Finished difference. Result has 43 places, 33 transitions, 132 flow
[2020-10-16 01:31:23,993 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=43, PETRI_TRANSITIONS=33}
[2020-10-16 01:31:23,993 INFO  L342   CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places.
[2020-10-16 01:31:23,993 INFO  L481      AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 132 flow
[2020-10-16 01:31:23,994 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 01:31:23,994 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:31:23,994 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:31:23,994 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-16 01:31:23,994 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:31:23,994 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:31:23,995 INFO  L82        PathProgramCache]: Analyzing trace with hash -841355409, now seen corresponding path program 1 times
[2020-10-16 01:31:23,995 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:31:23,995 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441416766]
[2020-10-16 01:31:23,995 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:31:24,014 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:31:24,038 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:31:24,038 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441416766]
[2020-10-16 01:31:24,039 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:31:24,039 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 01:31:24,039 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908463352]
[2020-10-16 01:31:24,039 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 01:31:24,040 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:31:24,040 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 01:31:24,040 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 01:31:24,041 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 165 out of 194
[2020-10-16 01:31:24,042 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 132 flow. Second operand 3 states.
[2020-10-16 01:31:24,042 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:31:24,042 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 194
[2020-10-16 01:31:24,042 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:31:24,072 INFO  L129       PetriNetUnfolder]: 33/147 cut-off events.
[2020-10-16 01:31:24,072 INFO  L130       PetriNetUnfolder]: For 196/262 co-relation queries the response was YES.
[2020-10-16 01:31:24,073 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 360 conditions, 147 events. 33/147 cut-off events. For 196/262 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 741 event pairs, 10 based on Foata normal form. 4/140 useless extension candidates. Maximal degree in co-relation 345. Up to 53 conditions per place. 
[2020-10-16 01:31:24,074 INFO  L132   encePairwiseOnDemand]: 190/194 looper letters, 3 selfloop transitions, 5 changer transitions 0/35 dead transitions.
[2020-10-16 01:31:24,074 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 35 transitions, 156 flow
[2020-10-16 01:31:24,076 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 01:31:24,076 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2020-10-16 01:31:24,078 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions.
[2020-10-16 01:31:24,078 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8625429553264605
[2020-10-16 01:31:24,078 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 502 transitions.
[2020-10-16 01:31:24,078 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 502 transitions.
[2020-10-16 01:31:24,079 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:31:24,079 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 502 transitions.
[2020-10-16 01:31:24,080 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 4 states.
[2020-10-16 01:31:24,081 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states.
[2020-10-16 01:31:24,081 INFO  L81            ComplementDD]: Finished complementDD. Result 4 states.
[2020-10-16 01:31:24,082 INFO  L185             Difference]: Start difference. First operand has 43 places, 33 transitions, 132 flow. Second operand 3 states and 502 transitions.
[2020-10-16 01:31:24,082 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 35 transitions, 156 flow
[2020-10-16 01:31:24,083 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 152 flow, removed 0 selfloop flow, removed 1 redundant places.
[2020-10-16 01:31:24,084 INFO  L241             Difference]: Finished difference. Result has 45 places, 35 transitions, 157 flow
[2020-10-16 01:31:24,085 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=157, PETRI_PLACES=45, PETRI_TRANSITIONS=35}
[2020-10-16 01:31:24,085 INFO  L342   CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places.
[2020-10-16 01:31:24,085 INFO  L481      AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 157 flow
[2020-10-16 01:31:24,086 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 01:31:24,086 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:31:24,086 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:31:24,086 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-16 01:31:24,086 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:31:24,087 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:31:24,087 INFO  L82        PathProgramCache]: Analyzing trace with hash 1547294045, now seen corresponding path program 1 times
[2020-10-16 01:31:24,087 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:31:24,088 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37919836]
[2020-10-16 01:31:24,088 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:31:24,109 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:31:24,180 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:31:24,181 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37919836]
[2020-10-16 01:31:24,181 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:31:24,181 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 01:31:24,181 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428556030]
[2020-10-16 01:31:24,182 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 01:31:24,182 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:31:24,182 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 01:31:24,182 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 01:31:24,184 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 150 out of 194
[2020-10-16 01:31:24,185 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 157 flow. Second operand 5 states.
[2020-10-16 01:31:24,185 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:31:24,185 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 194
[2020-10-16 01:31:24,185 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:31:24,338 INFO  L129       PetriNetUnfolder]: 153/356 cut-off events.
[2020-10-16 01:31:24,338 INFO  L130       PetriNetUnfolder]: For 769/862 co-relation queries the response was YES.
[2020-10-16 01:31:24,340 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 1032 conditions, 356 events. 153/356 cut-off events. For 769/862 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1942 event pairs, 37 based on Foata normal form. 10/329 useless extension candidates. Maximal degree in co-relation 1015. Up to 206 conditions per place. 
[2020-10-16 01:31:24,343 INFO  L132   encePairwiseOnDemand]: 188/194 looper letters, 7 selfloop transitions, 10 changer transitions 0/41 dead transitions.
[2020-10-16 01:31:24,343 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 41 transitions, 211 flow
[2020-10-16 01:31:24,344 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 01:31:24,344 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-10-16 01:31:24,346 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 615 transitions.
[2020-10-16 01:31:24,346 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7925257731958762
[2020-10-16 01:31:24,346 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 615 transitions.
[2020-10-16 01:31:24,346 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 615 transitions.
[2020-10-16 01:31:24,347 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:31:24,347 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 615 transitions.
[2020-10-16 01:31:24,348 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 5 states.
[2020-10-16 01:31:24,350 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states.
[2020-10-16 01:31:24,350 INFO  L81            ComplementDD]: Finished complementDD. Result 5 states.
[2020-10-16 01:31:24,350 INFO  L185             Difference]: Start difference. First operand has 45 places, 35 transitions, 157 flow. Second operand 4 states and 615 transitions.
[2020-10-16 01:31:24,351 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 41 transitions, 211 flow
[2020-10-16 01:31:24,353 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 41 transitions, 206 flow, removed 0 selfloop flow, removed 1 redundant places.
[2020-10-16 01:31:24,355 INFO  L241             Difference]: Finished difference. Result has 49 places, 39 transitions, 209 flow
[2020-10-16 01:31:24,355 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=209, PETRI_PLACES=49, PETRI_TRANSITIONS=39}
[2020-10-16 01:31:24,355 INFO  L342   CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places.
[2020-10-16 01:31:24,356 INFO  L481      AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 209 flow
[2020-10-16 01:31:24,356 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 01:31:24,356 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:31:24,356 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:31:24,356 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-16 01:31:24,356 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:31:24,357 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:31:24,357 INFO  L82        PathProgramCache]: Analyzing trace with hash -605084103, now seen corresponding path program 1 times
[2020-10-16 01:31:24,357 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:31:24,357 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562779662]
[2020-10-16 01:31:24,358 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:31:24,378 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:31:24,442 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:31:24,443 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562779662]
[2020-10-16 01:31:24,443 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:31:24,443 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 01:31:24,444 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882003460]
[2020-10-16 01:31:24,444 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 01:31:24,444 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:31:24,444 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 01:31:24,445 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 01:31:24,447 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 144 out of 194
[2020-10-16 01:31:24,473 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 209 flow. Second operand 5 states.
[2020-10-16 01:31:24,473 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:31:24,473 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 194
[2020-10-16 01:31:24,473 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:31:24,624 INFO  L129       PetriNetUnfolder]: 142/359 cut-off events.
[2020-10-16 01:31:24,624 INFO  L130       PetriNetUnfolder]: For 1081/1142 co-relation queries the response was YES.
[2020-10-16 01:31:24,627 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 1193 conditions, 359 events. 142/359 cut-off events. For 1081/1142 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2106 event pairs, 37 based on Foata normal form. 9/336 useless extension candidates. Maximal degree in co-relation 1173. Up to 204 conditions per place. 
[2020-10-16 01:31:24,630 INFO  L132   encePairwiseOnDemand]: 189/194 looper letters, 13 selfloop transitions, 6 changer transitions 0/43 dead transitions.
[2020-10-16 01:31:24,630 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 43 transitions, 261 flow
[2020-10-16 01:31:24,631 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 01:31:24,631 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-10-16 01:31:24,633 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 590 transitions.
[2020-10-16 01:31:24,633 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7603092783505154
[2020-10-16 01:31:24,633 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 590 transitions.
[2020-10-16 01:31:24,634 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 590 transitions.
[2020-10-16 01:31:24,634 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:31:24,634 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 590 transitions.
[2020-10-16 01:31:24,636 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 5 states.
[2020-10-16 01:31:24,637 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states.
[2020-10-16 01:31:24,637 INFO  L81            ComplementDD]: Finished complementDD. Result 5 states.
[2020-10-16 01:31:24,637 INFO  L185             Difference]: Start difference. First operand has 49 places, 39 transitions, 209 flow. Second operand 4 states and 590 transitions.
[2020-10-16 01:31:24,637 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 43 transitions, 261 flow
[2020-10-16 01:31:24,640 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 43 transitions, 250 flow, removed 2 selfloop flow, removed 1 redundant places.
[2020-10-16 01:31:24,641 INFO  L241             Difference]: Finished difference. Result has 52 places, 41 transitions, 226 flow
[2020-10-16 01:31:24,642 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=52, PETRI_TRANSITIONS=41}
[2020-10-16 01:31:24,642 INFO  L342   CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places.
[2020-10-16 01:31:24,642 INFO  L481      AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 226 flow
[2020-10-16 01:31:24,642 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 01:31:24,642 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:31:24,642 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:31:24,643 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-16 01:31:24,643 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:31:24,643 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:31:24,643 INFO  L82        PathProgramCache]: Analyzing trace with hash 36253971, now seen corresponding path program 1 times
[2020-10-16 01:31:24,643 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:31:24,644 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940632638]
[2020-10-16 01:31:24,644 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:31:24,661 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:31:24,712 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:31:24,712 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940632638]
[2020-10-16 01:31:24,713 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:31:24,713 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 01:31:24,713 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621568525]
[2020-10-16 01:31:24,713 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 01:31:24,713 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:31:24,714 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 01:31:24,714 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2020-10-16 01:31:24,716 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 149 out of 194
[2020-10-16 01:31:24,716 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 226 flow. Second operand 5 states.
[2020-10-16 01:31:24,716 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:31:24,716 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 194
[2020-10-16 01:31:24,717 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:31:24,852 INFO  L129       PetriNetUnfolder]: 177/436 cut-off events.
[2020-10-16 01:31:24,852 INFO  L130       PetriNetUnfolder]: For 1454/1501 co-relation queries the response was YES.
[2020-10-16 01:31:24,855 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 1529 conditions, 436 events. 177/436 cut-off events. For 1454/1501 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2646 event pairs, 40 based on Foata normal form. 8/415 useless extension candidates. Maximal degree in co-relation 1507. Up to 223 conditions per place. 
[2020-10-16 01:31:24,858 INFO  L132   encePairwiseOnDemand]: 187/194 looper letters, 10 selfloop transitions, 14 changer transitions 0/48 dead transitions.
[2020-10-16 01:31:24,858 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 48 transitions, 316 flow
[2020-10-16 01:31:24,859 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 01:31:24,859 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-10-16 01:31:24,861 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 761 transitions.
[2020-10-16 01:31:24,861 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7845360824742268
[2020-10-16 01:31:24,861 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 761 transitions.
[2020-10-16 01:31:24,862 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 761 transitions.
[2020-10-16 01:31:24,862 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:31:24,862 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 761 transitions.
[2020-10-16 01:31:24,864 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 6 states.
[2020-10-16 01:31:24,865 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states.
[2020-10-16 01:31:24,865 INFO  L81            ComplementDD]: Finished complementDD. Result 6 states.
[2020-10-16 01:31:24,866 INFO  L185             Difference]: Start difference. First operand has 52 places, 41 transitions, 226 flow. Second operand 5 states and 761 transitions.
[2020-10-16 01:31:24,866 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 48 transitions, 316 flow
[2020-10-16 01:31:24,868 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 48 transitions, 306 flow, removed 1 selfloop flow, removed 2 redundant places.
[2020-10-16 01:31:24,869 INFO  L241             Difference]: Finished difference. Result has 56 places, 47 transitions, 307 flow
[2020-10-16 01:31:24,869 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=307, PETRI_PLACES=56, PETRI_TRANSITIONS=47}
[2020-10-16 01:31:24,870 INFO  L342   CegarLoopForPetriNet]: 40 programPoint places, 16 predicate places.
[2020-10-16 01:31:24,870 INFO  L481      AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 307 flow
[2020-10-16 01:31:24,870 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 01:31:24,870 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:31:24,870 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:31:24,870 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-16 01:31:24,871 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:31:24,871 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:31:24,871 INFO  L82        PathProgramCache]: Analyzing trace with hash 319634357, now seen corresponding path program 2 times
[2020-10-16 01:31:24,871 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:31:24,871 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69541508]
[2020-10-16 01:31:24,871 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:31:24,885 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:31:24,933 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:31:24,934 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69541508]
[2020-10-16 01:31:24,934 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:31:24,934 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 01:31:24,934 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507804488]
[2020-10-16 01:31:24,935 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 01:31:24,935 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:31:24,936 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 01:31:24,936 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2020-10-16 01:31:24,938 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 149 out of 194
[2020-10-16 01:31:24,938 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 307 flow. Second operand 5 states.
[2020-10-16 01:31:24,938 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:31:24,938 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 194
[2020-10-16 01:31:24,939 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:31:25,059 INFO  L129       PetriNetUnfolder]: 161/414 cut-off events.
[2020-10-16 01:31:25,059 INFO  L130       PetriNetUnfolder]: For 2008/2060 co-relation queries the response was YES.
[2020-10-16 01:31:25,062 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 1639 conditions, 414 events. 161/414 cut-off events. For 2008/2060 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2547 event pairs, 40 based on Foata normal form. 22/410 useless extension candidates. Maximal degree in co-relation 1615. Up to 179 conditions per place. 
[2020-10-16 01:31:25,066 INFO  L132   encePairwiseOnDemand]: 189/194 looper letters, 16 selfloop transitions, 11 changer transitions 0/51 dead transitions.
[2020-10-16 01:31:25,066 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 51 transitions, 374 flow
[2020-10-16 01:31:25,067 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 01:31:25,067 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-10-16 01:31:25,069 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 608 transitions.
[2020-10-16 01:31:25,069 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7835051546391752
[2020-10-16 01:31:25,069 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 608 transitions.
[2020-10-16 01:31:25,069 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 608 transitions.
[2020-10-16 01:31:25,070 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:31:25,070 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 608 transitions.
[2020-10-16 01:31:25,072 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 5 states.
[2020-10-16 01:31:25,073 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states.
[2020-10-16 01:31:25,073 INFO  L81            ComplementDD]: Finished complementDD. Result 5 states.
[2020-10-16 01:31:25,073 INFO  L185             Difference]: Start difference. First operand has 56 places, 47 transitions, 307 flow. Second operand 4 states and 608 transitions.
[2020-10-16 01:31:25,074 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 51 transitions, 374 flow
[2020-10-16 01:31:25,078 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 51 transitions, 369 flow, removed 2 selfloop flow, removed 1 redundant places.
[2020-10-16 01:31:25,079 INFO  L241             Difference]: Finished difference. Result has 59 places, 48 transitions, 331 flow
[2020-10-16 01:31:25,080 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=331, PETRI_PLACES=59, PETRI_TRANSITIONS=48}
[2020-10-16 01:31:25,080 INFO  L342   CegarLoopForPetriNet]: 40 programPoint places, 19 predicate places.
[2020-10-16 01:31:25,080 INFO  L481      AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 331 flow
[2020-10-16 01:31:25,080 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 01:31:25,080 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:31:25,081 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:31:25,081 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-16 01:31:25,081 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:31:25,081 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:31:25,081 INFO  L82        PathProgramCache]: Analyzing trace with hash 1473547702, now seen corresponding path program 1 times
[2020-10-16 01:31:25,081 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:31:25,082 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587859015]
[2020-10-16 01:31:25,082 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:31:25,111 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:31:25,278 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:31:25,279 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587859015]
[2020-10-16 01:31:25,279 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:31:25,279 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 01:31:25,279 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321493201]
[2020-10-16 01:31:25,280 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 01:31:25,280 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:31:25,280 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 01:31:25,281 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 01:31:25,283 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 143 out of 194
[2020-10-16 01:31:25,283 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 331 flow. Second operand 6 states.
[2020-10-16 01:31:25,283 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:31:25,284 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 194
[2020-10-16 01:31:25,284 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:31:25,490 INFO  L129       PetriNetUnfolder]: 167/486 cut-off events.
[2020-10-16 01:31:25,491 INFO  L130       PetriNetUnfolder]: For 2551/2604 co-relation queries the response was YES.
[2020-10-16 01:31:25,495 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 2176 conditions, 486 events. 167/486 cut-off events. For 2551/2604 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3334 event pairs, 27 based on Foata normal form. 10/466 useless extension candidates. Maximal degree in co-relation 2150. Up to 186 conditions per place. 
[2020-10-16 01:31:25,500 INFO  L132   encePairwiseOnDemand]: 188/194 looper letters, 15 selfloop transitions, 16 changer transitions 0/55 dead transitions.
[2020-10-16 01:31:25,500 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 55 transitions, 461 flow
[2020-10-16 01:31:25,501 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 01:31:25,501 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-10-16 01:31:25,503 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 731 transitions.
[2020-10-16 01:31:25,504 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7536082474226804
[2020-10-16 01:31:25,504 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 731 transitions.
[2020-10-16 01:31:25,504 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 731 transitions.
[2020-10-16 01:31:25,504 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:31:25,505 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 731 transitions.
[2020-10-16 01:31:25,506 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 6 states.
[2020-10-16 01:31:25,508 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states.
[2020-10-16 01:31:25,508 INFO  L81            ComplementDD]: Finished complementDD. Result 6 states.
[2020-10-16 01:31:25,508 INFO  L185             Difference]: Start difference. First operand has 59 places, 48 transitions, 331 flow. Second operand 5 states and 731 transitions.
[2020-10-16 01:31:25,508 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 55 transitions, 461 flow
[2020-10-16 01:31:25,513 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 55 transitions, 439 flow, removed 3 selfloop flow, removed 3 redundant places.
[2020-10-16 01:31:25,515 INFO  L241             Difference]: Finished difference. Result has 62 places, 54 transitions, 434 flow
[2020-10-16 01:31:25,515 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=434, PETRI_PLACES=62, PETRI_TRANSITIONS=54}
[2020-10-16 01:31:25,515 INFO  L342   CegarLoopForPetriNet]: 40 programPoint places, 22 predicate places.
[2020-10-16 01:31:25,515 INFO  L481      AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 434 flow
[2020-10-16 01:31:25,516 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 01:31:25,516 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:31:25,516 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:31:25,516 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-16 01:31:25,516 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:31:25,516 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:31:25,516 INFO  L82        PathProgramCache]: Analyzing trace with hash -603797742, now seen corresponding path program 2 times
[2020-10-16 01:31:25,517 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:31:25,517 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442037721]
[2020-10-16 01:31:25,517 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:31:25,537 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:31:25,639 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:31:25,639 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442037721]
[2020-10-16 01:31:25,639 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:31:25,639 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 01:31:25,639 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453304228]
[2020-10-16 01:31:25,640 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 01:31:25,640 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:31:25,640 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 01:31:25,640 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-16 01:31:25,643 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 142 out of 194
[2020-10-16 01:31:25,643 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 434 flow. Second operand 6 states.
[2020-10-16 01:31:25,644 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:31:25,644 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 194
[2020-10-16 01:31:25,644 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:31:25,942 INFO  L129       PetriNetUnfolder]: 150/455 cut-off events.
[2020-10-16 01:31:25,942 INFO  L130       PetriNetUnfolder]: For 3123/3211 co-relation queries the response was YES.
[2020-10-16 01:31:25,945 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 2181 conditions, 455 events. 150/455 cut-off events. For 3123/3211 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3133 event pairs, 13 based on Foata normal form. 30/452 useless extension candidates. Maximal degree in co-relation 2154. Up to 155 conditions per place. 
[2020-10-16 01:31:25,950 INFO  L132   encePairwiseOnDemand]: 189/194 looper letters, 15 selfloop transitions, 18 changer transitions 0/57 dead transitions.
[2020-10-16 01:31:25,950 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 57 transitions, 508 flow
[2020-10-16 01:31:25,951 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 01:31:25,951 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2020-10-16 01:31:25,953 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 868 transitions.
[2020-10-16 01:31:25,954 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7457044673539519
[2020-10-16 01:31:25,954 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 868 transitions.
[2020-10-16 01:31:25,955 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 868 transitions.
[2020-10-16 01:31:25,955 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:31:25,955 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 868 transitions.
[2020-10-16 01:31:25,957 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 7 states.
[2020-10-16 01:31:25,960 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states.
[2020-10-16 01:31:25,960 INFO  L81            ComplementDD]: Finished complementDD. Result 7 states.
[2020-10-16 01:31:25,960 INFO  L185             Difference]: Start difference. First operand has 62 places, 54 transitions, 434 flow. Second operand 6 states and 868 transitions.
[2020-10-16 01:31:25,960 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 57 transitions, 508 flow
[2020-10-16 01:31:25,965 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 57 transitions, 491 flow, removed 8 selfloop flow, removed 1 redundant places.
[2020-10-16 01:31:25,967 INFO  L241             Difference]: Finished difference. Result has 67 places, 53 transitions, 448 flow
[2020-10-16 01:31:25,967 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=448, PETRI_PLACES=67, PETRI_TRANSITIONS=53}
[2020-10-16 01:31:25,967 INFO  L342   CegarLoopForPetriNet]: 40 programPoint places, 27 predicate places.
[2020-10-16 01:31:25,967 INFO  L481      AbstractCegarLoop]: Abstraction has has 67 places, 53 transitions, 448 flow
[2020-10-16 01:31:25,968 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 01:31:25,968 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:31:25,968 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:31:25,968 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-16 01:31:25,968 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:31:25,968 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:31:25,968 INFO  L82        PathProgramCache]: Analyzing trace with hash 1576553566, now seen corresponding path program 1 times
[2020-10-16 01:31:25,969 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:31:25,969 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370753236]
[2020-10-16 01:31:25,969 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:31:25,984 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:31:26,028 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:31:26,028 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370753236]
[2020-10-16 01:31:26,028 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:31:26,028 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 01:31:26,029 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443053106]
[2020-10-16 01:31:26,029 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 01:31:26,029 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:31:26,029 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 01:31:26,030 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-16 01:31:26,032 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 152 out of 194
[2020-10-16 01:31:26,033 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 53 transitions, 448 flow. Second operand 6 states.
[2020-10-16 01:31:26,033 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:31:26,033 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 194
[2020-10-16 01:31:26,033 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:31:26,765 INFO  L129       PetriNetUnfolder]: 2370/4189 cut-off events.
[2020-10-16 01:31:26,765 INFO  L130       PetriNetUnfolder]: For 29462/30422 co-relation queries the response was YES.
[2020-10-16 01:31:26,805 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 13717 conditions, 4189 events. 2370/4189 cut-off events. For 29462/30422 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 32964 event pairs, 265 based on Foata normal form. 185/3876 useless extension candidates. Maximal degree in co-relation 13688. Up to 1633 conditions per place. 
[2020-10-16 01:31:26,835 INFO  L132   encePairwiseOnDemand]: 186/194 looper letters, 23 selfloop transitions, 16 changer transitions 0/83 dead transitions.
[2020-10-16 01:31:26,835 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 83 transitions, 658 flow
[2020-10-16 01:31:26,836 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 01:31:26,837 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-10-16 01:31:26,839 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1105 transitions.
[2020-10-16 01:31:26,840 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8136966126656848
[2020-10-16 01:31:26,840 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1105 transitions.
[2020-10-16 01:31:26,840 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1105 transitions.
[2020-10-16 01:31:26,841 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:31:26,841 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1105 transitions.
[2020-10-16 01:31:26,844 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 8 states.
[2020-10-16 01:31:26,846 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states.
[2020-10-16 01:31:26,846 INFO  L81            ComplementDD]: Finished complementDD. Result 8 states.
[2020-10-16 01:31:26,847 INFO  L185             Difference]: Start difference. First operand has 67 places, 53 transitions, 448 flow. Second operand 7 states and 1105 transitions.
[2020-10-16 01:31:26,847 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 83 transitions, 658 flow
[2020-10-16 01:31:26,871 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 83 transitions, 633 flow, removed 7 selfloop flow, removed 3 redundant places.
[2020-10-16 01:31:26,873 INFO  L241             Difference]: Finished difference. Result has 75 places, 67 transitions, 546 flow
[2020-10-16 01:31:26,873 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=546, PETRI_PLACES=75, PETRI_TRANSITIONS=67}
[2020-10-16 01:31:26,873 INFO  L342   CegarLoopForPetriNet]: 40 programPoint places, 35 predicate places.
[2020-10-16 01:31:26,873 INFO  L481      AbstractCegarLoop]: Abstraction has has 75 places, 67 transitions, 546 flow
[2020-10-16 01:31:26,874 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 01:31:26,874 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:31:26,874 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:31:26,874 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-16 01:31:26,874 INFO  L429      AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:31:26,874 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:31:26,875 INFO  L82        PathProgramCache]: Analyzing trace with hash -1084550124, now seen corresponding path program 1 times
[2020-10-16 01:31:26,875 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:31:26,875 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060242322]
[2020-10-16 01:31:26,875 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:31:26,905 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:31:26,939 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:31:26,939 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060242322]
[2020-10-16 01:31:26,940 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:31:26,940 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 01:31:26,941 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091967271]
[2020-10-16 01:31:26,941 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 01:31:26,941 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:31:26,942 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 01:31:26,942 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 01:31:26,943 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 157 out of 194
[2020-10-16 01:31:26,944 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 67 transitions, 546 flow. Second operand 4 states.
[2020-10-16 01:31:26,944 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:31:26,944 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 194
[2020-10-16 01:31:26,944 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:31:27,760 INFO  L129       PetriNetUnfolder]: 2523/4700 cut-off events.
[2020-10-16 01:31:27,760 INFO  L130       PetriNetUnfolder]: For 27729/32938 co-relation queries the response was YES.
[2020-10-16 01:31:27,805 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 22817 conditions, 4700 events. 2523/4700 cut-off events. For 27729/32938 co-relation queries the response was YES. Maximal size of possible extension queue 730. Compared 40413 event pairs, 221 based on Foata normal form. 818/4904 useless extension candidates. Maximal degree in co-relation 22784. Up to 2662 conditions per place. 
[2020-10-16 01:31:27,834 INFO  L132   encePairwiseOnDemand]: 187/194 looper letters, 13 selfloop transitions, 11 changer transitions 3/72 dead transitions.
[2020-10-16 01:31:27,834 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 72 transitions, 630 flow
[2020-10-16 01:31:27,835 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 01:31:27,835 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-10-16 01:31:27,837 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 646 transitions.
[2020-10-16 01:31:27,837 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8324742268041238
[2020-10-16 01:31:27,837 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 646 transitions.
[2020-10-16 01:31:27,838 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 646 transitions.
[2020-10-16 01:31:27,838 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:31:27,838 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 646 transitions.
[2020-10-16 01:31:27,840 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 5 states.
[2020-10-16 01:31:27,842 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states.
[2020-10-16 01:31:27,842 INFO  L81            ComplementDD]: Finished complementDD. Result 5 states.
[2020-10-16 01:31:27,842 INFO  L185             Difference]: Start difference. First operand has 75 places, 67 transitions, 546 flow. Second operand 4 states and 646 transitions.
[2020-10-16 01:31:27,842 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 72 transitions, 630 flow
[2020-10-16 01:31:27,874 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 72 transitions, 630 flow, removed 0 selfloop flow, removed 0 redundant places.
[2020-10-16 01:31:27,876 INFO  L241             Difference]: Finished difference. Result has 80 places, 65 transitions, 590 flow
[2020-10-16 01:31:27,876 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=590, PETRI_PLACES=80, PETRI_TRANSITIONS=65}
[2020-10-16 01:31:27,877 INFO  L342   CegarLoopForPetriNet]: 40 programPoint places, 40 predicate places.
[2020-10-16 01:31:27,877 INFO  L481      AbstractCegarLoop]: Abstraction has has 80 places, 65 transitions, 590 flow
[2020-10-16 01:31:27,877 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 01:31:27,877 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:31:27,877 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:31:27,877 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-10-16 01:31:27,878 INFO  L429      AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:31:27,878 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:31:27,878 INFO  L82        PathProgramCache]: Analyzing trace with hash 55954095, now seen corresponding path program 1 times
[2020-10-16 01:31:27,878 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:31:27,878 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171014590]
[2020-10-16 01:31:27,879 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:31:27,907 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:31:27,940 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:31:27,941 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171014590]
[2020-10-16 01:31:27,941 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:31:27,941 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 01:31:27,941 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878725095]
[2020-10-16 01:31:27,942 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 01:31:27,942 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:31:27,942 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 01:31:27,943 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 01:31:27,944 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 157 out of 194
[2020-10-16 01:31:27,945 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 65 transitions, 590 flow. Second operand 5 states.
[2020-10-16 01:31:27,945 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:31:27,945 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 194
[2020-10-16 01:31:27,945 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:31:28,430 INFO  L129       PetriNetUnfolder]: 1622/3232 cut-off events.
[2020-10-16 01:31:28,430 INFO  L130       PetriNetUnfolder]: For 20410/26291 co-relation queries the response was YES.
[2020-10-16 01:31:28,448 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 16313 conditions, 3232 events. 1622/3232 cut-off events. For 20410/26291 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 27369 event pairs, 55 based on Foata normal form. 627/3440 useless extension candidates. Maximal degree in co-relation 16276. Up to 2041 conditions per place. 
[2020-10-16 01:31:28,457 INFO  L132   encePairwiseOnDemand]: 187/194 looper letters, 13 selfloop transitions, 15 changer transitions 1/73 dead transitions.
[2020-10-16 01:31:28,457 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 73 transitions, 702 flow
[2020-10-16 01:31:28,458 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 01:31:28,458 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-10-16 01:31:28,459 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 808 transitions.
[2020-10-16 01:31:28,459 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8329896907216495
[2020-10-16 01:31:28,460 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 808 transitions.
[2020-10-16 01:31:28,460 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 808 transitions.
[2020-10-16 01:31:28,460 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:31:28,460 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 808 transitions.
[2020-10-16 01:31:28,462 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 6 states.
[2020-10-16 01:31:28,464 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states.
[2020-10-16 01:31:28,464 INFO  L81            ComplementDD]: Finished complementDD. Result 6 states.
[2020-10-16 01:31:28,464 INFO  L185             Difference]: Start difference. First operand has 80 places, 65 transitions, 590 flow. Second operand 5 states and 808 transitions.
[2020-10-16 01:31:28,465 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 73 transitions, 702 flow
[2020-10-16 01:31:28,485 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 73 transitions, 689 flow, removed 0 selfloop flow, removed 2 redundant places.
[2020-10-16 01:31:28,487 INFO  L241             Difference]: Finished difference. Result has 84 places, 68 transitions, 655 flow
[2020-10-16 01:31:28,488 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=655, PETRI_PLACES=84, PETRI_TRANSITIONS=68}
[2020-10-16 01:31:28,488 INFO  L342   CegarLoopForPetriNet]: 40 programPoint places, 44 predicate places.
[2020-10-16 01:31:28,488 INFO  L481      AbstractCegarLoop]: Abstraction has has 84 places, 68 transitions, 655 flow
[2020-10-16 01:31:28,488 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 01:31:28,488 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:31:28,488 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:31:28,489 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2020-10-16 01:31:28,489 INFO  L429      AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:31:28,489 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:31:28,489 INFO  L82        PathProgramCache]: Analyzing trace with hash 1713900479, now seen corresponding path program 1 times
[2020-10-16 01:31:28,489 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:31:28,490 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091835227]
[2020-10-16 01:31:28,490 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:31:28,512 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:31:28,553 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:31:28,554 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091835227]
[2020-10-16 01:31:28,554 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:31:28,554 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 01:31:28,555 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169259869]
[2020-10-16 01:31:28,555 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 01:31:28,555 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:31:28,555 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 01:31:28,556 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2020-10-16 01:31:28,557 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 156 out of 194
[2020-10-16 01:31:28,557 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 68 transitions, 655 flow. Second operand 4 states.
[2020-10-16 01:31:28,557 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:31:28,557 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 194
[2020-10-16 01:31:28,558 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:31:29,350 INFO  L129       PetriNetUnfolder]: 2166/4430 cut-off events.
[2020-10-16 01:31:29,350 INFO  L130       PetriNetUnfolder]: For 38780/46945 co-relation queries the response was YES.
[2020-10-16 01:31:29,385 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 24432 conditions, 4430 events. 2166/4430 cut-off events. For 38780/46945 co-relation queries the response was YES. Maximal size of possible extension queue 753. Compared 40838 event pairs, 241 based on Foata normal form. 307/4163 useless extension candidates. Maximal degree in co-relation 24393. Up to 3108 conditions per place. 
[2020-10-16 01:31:29,396 INFO  L132   encePairwiseOnDemand]: 190/194 looper letters, 16 selfloop transitions, 4 changer transitions 4/75 dead transitions.
[2020-10-16 01:31:29,396 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 75 transitions, 801 flow
[2020-10-16 01:31:29,397 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 01:31:29,397 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-10-16 01:31:29,399 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 634 transitions.
[2020-10-16 01:31:29,399 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8170103092783505
[2020-10-16 01:31:29,399 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 634 transitions.
[2020-10-16 01:31:29,400 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 634 transitions.
[2020-10-16 01:31:29,400 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:31:29,400 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 634 transitions.
[2020-10-16 01:31:29,402 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 5 states.
[2020-10-16 01:31:29,403 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states.
[2020-10-16 01:31:29,403 INFO  L81            ComplementDD]: Finished complementDD. Result 5 states.
[2020-10-16 01:31:29,403 INFO  L185             Difference]: Start difference. First operand has 84 places, 68 transitions, 655 flow. Second operand 4 states and 634 transitions.
[2020-10-16 01:31:29,404 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 75 transitions, 801 flow
[2020-10-16 01:31:29,455 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 75 transitions, 775 flow, removed 7 selfloop flow, removed 2 redundant places.
[2020-10-16 01:31:29,457 INFO  L241             Difference]: Finished difference. Result has 86 places, 68 transitions, 642 flow
[2020-10-16 01:31:29,458 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=629, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=642, PETRI_PLACES=86, PETRI_TRANSITIONS=68}
[2020-10-16 01:31:29,458 INFO  L342   CegarLoopForPetriNet]: 40 programPoint places, 46 predicate places.
[2020-10-16 01:31:29,458 INFO  L481      AbstractCegarLoop]: Abstraction has has 86 places, 68 transitions, 642 flow
[2020-10-16 01:31:29,458 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 01:31:29,458 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:31:29,459 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:31:29,459 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2020-10-16 01:31:29,459 INFO  L429      AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:31:29,459 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:31:29,459 INFO  L82        PathProgramCache]: Analyzing trace with hash -194517209, now seen corresponding path program 1 times
[2020-10-16 01:31:29,459 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:31:29,460 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686979937]
[2020-10-16 01:31:29,460 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:31:29,485 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:31:29,531 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:31:29,531 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686979937]
[2020-10-16 01:31:29,531 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:31:29,531 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 01:31:29,532 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411802554]
[2020-10-16 01:31:29,532 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 01:31:29,532 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:31:29,532 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 01:31:29,533 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 01:31:29,534 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 157 out of 194
[2020-10-16 01:31:29,535 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 68 transitions, 642 flow. Second operand 6 states.
[2020-10-16 01:31:29,535 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:31:29,535 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 194
[2020-10-16 01:31:29,535 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:31:30,111 INFO  L129       PetriNetUnfolder]: 1841/3760 cut-off events.
[2020-10-16 01:31:30,111 INFO  L130       PetriNetUnfolder]: For 26051/39008 co-relation queries the response was YES.
[2020-10-16 01:31:30,133 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 20422 conditions, 3760 events. 1841/3760 cut-off events. For 26051/39008 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 33507 event pairs, 15 based on Foata normal form. 930/4138 useless extension candidates. Maximal degree in co-relation 20382. Up to 2713 conditions per place. 
[2020-10-16 01:31:30,141 INFO  L132   encePairwiseOnDemand]: 187/194 looper letters, 13 selfloop transitions, 19 changer transitions 3/76 dead transitions.
[2020-10-16 01:31:30,141 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 76 transitions, 781 flow
[2020-10-16 01:31:30,142 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 01:31:30,142 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2020-10-16 01:31:30,145 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 970 transitions.
[2020-10-16 01:31:30,145 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8333333333333334
[2020-10-16 01:31:30,146 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 970 transitions.
[2020-10-16 01:31:30,146 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 970 transitions.
[2020-10-16 01:31:30,147 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:31:30,147 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 970 transitions.
[2020-10-16 01:31:30,149 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 7 states.
[2020-10-16 01:31:30,151 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states.
[2020-10-16 01:31:30,151 INFO  L81            ComplementDD]: Finished complementDD. Result 7 states.
[2020-10-16 01:31:30,151 INFO  L185             Difference]: Start difference. First operand has 86 places, 68 transitions, 642 flow. Second operand 6 states and 970 transitions.
[2020-10-16 01:31:30,151 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 76 transitions, 781 flow
[2020-10-16 01:31:30,177 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 76 transitions, 772 flow, removed 2 selfloop flow, removed 2 redundant places.
[2020-10-16 01:31:30,179 INFO  L241             Difference]: Finished difference. Result has 91 places, 69 transitions, 700 flow
[2020-10-16 01:31:30,180 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=700, PETRI_PLACES=91, PETRI_TRANSITIONS=69}
[2020-10-16 01:31:30,180 INFO  L342   CegarLoopForPetriNet]: 40 programPoint places, 51 predicate places.
[2020-10-16 01:31:30,180 INFO  L481      AbstractCegarLoop]: Abstraction has has 91 places, 69 transitions, 700 flow
[2020-10-16 01:31:30,180 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 01:31:30,180 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:31:30,181 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:31:30,181 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2020-10-16 01:31:30,181 INFO  L429      AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:31:30,181 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:31:30,181 INFO  L82        PathProgramCache]: Analyzing trace with hash -2083106945, now seen corresponding path program 1 times
[2020-10-16 01:31:30,181 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:31:30,182 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972629279]
[2020-10-16 01:31:30,182 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:31:30,214 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:31:30,261 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:31:30,262 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972629279]
[2020-10-16 01:31:30,262 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:31:30,262 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-16 01:31:30,262 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127578773]
[2020-10-16 01:31:30,262 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 01:31:30,263 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:31:30,263 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 01:31:30,263 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-10-16 01:31:30,264 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 157 out of 194
[2020-10-16 01:31:30,265 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 69 transitions, 700 flow. Second operand 7 states.
[2020-10-16 01:31:30,265 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:31:30,265 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 194
[2020-10-16 01:31:30,266 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:31:30,880 INFO  L129       PetriNetUnfolder]: 1718/3496 cut-off events.
[2020-10-16 01:31:30,880 INFO  L130       PetriNetUnfolder]: For 36506/51716 co-relation queries the response was YES.
[2020-10-16 01:31:30,900 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 22731 conditions, 3496 events. 1718/3496 cut-off events. For 36506/51716 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 31097 event pairs, 15 based on Foata normal form. 767/3709 useless extension candidates. Maximal degree in co-relation 22689. Up to 2623 conditions per place. 
[2020-10-16 01:31:30,905 INFO  L132   encePairwiseOnDemand]: 187/194 looper letters, 5 selfloop transitions, 18 changer transitions 24/69 dead transitions.
[2020-10-16 01:31:30,905 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 69 transitions, 756 flow
[2020-10-16 01:31:30,906 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 01:31:30,906 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-10-16 01:31:30,909 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1124 transitions.
[2020-10-16 01:31:30,909 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8276877761413843
[2020-10-16 01:31:30,910 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1124 transitions.
[2020-10-16 01:31:30,910 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1124 transitions.
[2020-10-16 01:31:30,911 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:31:30,911 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1124 transitions.
[2020-10-16 01:31:30,913 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 8 states.
[2020-10-16 01:31:30,916 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states.
[2020-10-16 01:31:30,916 INFO  L81            ComplementDD]: Finished complementDD. Result 8 states.
[2020-10-16 01:31:30,916 INFO  L185             Difference]: Start difference. First operand has 91 places, 69 transitions, 700 flow. Second operand 7 states and 1124 transitions.
[2020-10-16 01:31:30,916 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 69 transitions, 756 flow
[2020-10-16 01:31:31,164 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 69 transitions, 664 flow, removed 21 selfloop flow, removed 6 redundant places.
[2020-10-16 01:31:31,165 INFO  L241             Difference]: Finished difference. Result has 93 places, 45 transitions, 433 flow
[2020-10-16 01:31:31,165 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=433, PETRI_PLACES=93, PETRI_TRANSITIONS=45}
[2020-10-16 01:31:31,165 INFO  L342   CegarLoopForPetriNet]: 40 programPoint places, 53 predicate places.
[2020-10-16 01:31:31,165 INFO  L481      AbstractCegarLoop]: Abstraction has has 93 places, 45 transitions, 433 flow
[2020-10-16 01:31:31,166 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 01:31:31,166 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:31:31,166 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:31:31,166 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2020-10-16 01:31:31,166 INFO  L429      AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:31:31,166 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:31:31,166 INFO  L82        PathProgramCache]: Analyzing trace with hash 299132041, now seen corresponding path program 1 times
[2020-10-16 01:31:31,166 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:31:31,167 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145450095]
[2020-10-16 01:31:31,167 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:31:31,194 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 01:31:31,195 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 01:31:31,224 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 01:31:31,225 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 01:31:31,282 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-16 01:31:31,282 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-16 01:31:31,283 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2020-10-16 01:31:31,285 WARN  L264   etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available.
[2020-10-16 01:31:31,301 WARN  L124   codingBacktranslator]: Skipped backtranslation of ATE [954] [954] L3-->L841: Formula: (let ((.cse6 (= (mod ~z$w_buff1_used~0_In542374340 256) 0)) (.cse7 (= (mod ~z$r_buff1_thd0~0_In542374340 256) 0)) (.cse8 (= (mod ~z$w_buff0_used~0_In542374340 256) 0)) (.cse9 (= (mod ~z$r_buff0_thd0~0_In542374340 256) 0))) (let ((.cse0 (or .cse8 .cse9)) (.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse2 (not .cse7)) (.cse3 (not .cse6)) (.cse1 (or .cse6 .cse7))) (and (= ~z$r_buff1_thd0~0_Out542374340 ~z$r_buff1_thd0~0_In542374340) (= ~z$r_buff0_thd0~0_Out542374340 ~z$r_buff0_thd0~0_In542374340) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In542374340 0)) (or (and .cse0 (or (and (= ~z~0_Out542374340 ~z~0_In542374340) .cse1) (and .cse2 .cse3 (= ~z$w_buff1~0_In542374340 ~z~0_Out542374340)))) (and .cse4 (= ~z~0_Out542374340 ~z$w_buff0~0_In542374340) .cse5)) (or (and .cse0 (= ~z$w_buff0_used~0_In542374340 ~z$w_buff0_used~0_Out542374340)) (and .cse4 .cse5 (= ~z$w_buff0_used~0_Out542374340 0))) (or (and (= ~z$w_buff1_used~0_Out542374340 0) .cse2 .cse3) (and (= ~z$w_buff1_used~0_In542374340 ~z$w_buff1_used~0_Out542374340) .cse1)))))  InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In542374340, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In542374340, ~z$w_buff0_used~0=~z$w_buff0_used~0_In542374340, ~z$w_buff0~0=~z$w_buff0~0_In542374340, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In542374340, ~z$w_buff1_used~0=~z$w_buff1_used~0_In542374340, ~z$w_buff1~0=~z$w_buff1~0_In542374340, ~z~0=~z~0_In542374340}  OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out542374340, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out542374340|, ~z$w_buff0~0=~z$w_buff0~0_In542374340, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out542374340|, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out542374340, ~z$w_buff1~0=~z$w_buff1~0_In542374340, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out542374340|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out542374340|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out542374340|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out542374340|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out542374340, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In542374340, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out542374340, ~z~0=~z~0_Out542374340}  AuxVars[]  AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23] because there is no mapped edge
[2020-10-16 01:31:31,313 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:31:31,313 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:31:31,315 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:31:31,315 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:31:31,315 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:31:31,315 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:31:31,316 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:31:31,316 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:31:31,316 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:31:31,316 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:31:31,316 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:31:31,316 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:31:31,317 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:31:31,317 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:31:31,317 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:31:31,317 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:31:31,318 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:31:31,318 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:31:31,318 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:31:31,318 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:31:31,318 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:31:31,318 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:31:31,319 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:31:31,319 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:31:31,324 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:31:31,324 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:31:31,324 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:31:31,324 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:31:31,324 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:31:31,324 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:31:31,328 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:31:31,328 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:31:31,328 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:31:31,329 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:31:31,329 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:31:31,329 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:31:31,329 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:31:31,329 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:31:31,329 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:31:31,329 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:31:31,329 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:31:31,329 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:31:31,330 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:31:31,330 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:31:31,330 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:31:31,330 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:31:31,330 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:31:31,330 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:31:31,330 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:31:31,330 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:31:31,425 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:31:31 BasicIcfg
[2020-10-16 01:31:31,425 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-16 01:31:31,427 INFO  L168              Benchmark]: Toolchain (without parser) took 22893.36 ms. Allocated memory was 250.6 MB in the beginning and 824.7 MB in the end (delta: 574.1 MB). Free memory was 206.4 MB in the beginning and 483.3 MB in the end (delta: -276.9 MB). Peak memory consumption was 297.2 MB. Max. memory is 14.2 GB.
[2020-10-16 01:31:31,427 INFO  L168              Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 250.6 MB. Free memory is still 227.0 MB. There was no memory consumed. Max. memory is 14.2 GB.
[2020-10-16 01:31:31,428 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 838.87 ms. Allocated memory was 250.6 MB in the beginning and 313.0 MB in the end (delta: 62.4 MB). Free memory was 206.4 MB in the beginning and 263.9 MB in the end (delta: -57.5 MB). Peak memory consumption was 33.1 MB. Max. memory is 14.2 GB.
[2020-10-16 01:31:31,429 INFO  L168              Benchmark]: Boogie Procedure Inliner took 80.13 ms. Allocated memory is still 313.0 MB. Free memory was 263.9 MB in the beginning and 261.3 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:31:31,429 INFO  L168              Benchmark]: Boogie Preprocessor took 40.44 ms. Allocated memory is still 313.0 MB. Free memory was 261.3 MB in the beginning and 258.8 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:31:31,430 INFO  L168              Benchmark]: RCFGBuilder took 1933.08 ms. Allocated memory was 313.0 MB in the beginning and 357.0 MB in the end (delta: 44.0 MB). Free memory was 258.8 MB in the beginning and 208.7 MB in the end (delta: 50.1 MB). Peak memory consumption was 100.2 MB. Max. memory is 14.2 GB.
[2020-10-16 01:31:31,431 INFO  L168              Benchmark]: TraceAbstraction took 19993.26 ms. Allocated memory was 357.0 MB in the beginning and 824.7 MB in the end (delta: 467.7 MB). Free memory was 208.7 MB in the beginning and 483.3 MB in the end (delta: -274.6 MB). Peak memory consumption was 193.1 MB. Max. memory is 14.2 GB.
[2020-10-16 01:31:31,434 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.21 ms. Allocated memory is still 250.6 MB. Free memory is still 227.0 MB. There was no memory consumed. Max. memory is 14.2 GB.
 * CACSL2BoogieTranslator took 838.87 ms. Allocated memory was 250.6 MB in the beginning and 313.0 MB in the end (delta: 62.4 MB). Free memory was 206.4 MB in the beginning and 263.9 MB in the end (delta: -57.5 MB). Peak memory consumption was 33.1 MB. Max. memory is 14.2 GB.
 * Boogie Procedure Inliner took 80.13 ms. Allocated memory is still 313.0 MB. Free memory was 263.9 MB in the beginning and 261.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * Boogie Preprocessor took 40.44 ms. Allocated memory is still 313.0 MB. Free memory was 261.3 MB in the beginning and 258.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * RCFGBuilder took 1933.08 ms. Allocated memory was 313.0 MB in the beginning and 357.0 MB in the end (delta: 44.0 MB). Free memory was 258.8 MB in the beginning and 208.7 MB in the end (delta: 50.1 MB). Peak memory consumption was 100.2 MB. Max. memory is 14.2 GB.
 * TraceAbstraction took 19993.26 ms. Allocated memory was 357.0 MB in the beginning and 824.7 MB in the end (delta: 467.7 MB). Free memory was 208.7 MB in the beginning and 483.3 MB in the end (delta: -274.6 MB). Peak memory consumption was 193.1 MB. Max. memory is 14.2 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    1653 VarBasedMoverChecksPositive, 109 VarBasedMoverChecksNegative, 41 SemBasedMoverChecksPositive, 68 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 194 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.9s, 114 PlacesBefore, 40 PlacesAfterwards, 103 TransitionsBefore, 28 TransitionsAfterwards, 2352 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 87 TotalNumberOfCompositions, 6523 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_p3_EAX = 0;
[L703]               0  int a = 0;
[L704]               0  _Bool main$tmp_guard0;
[L705]               0  _Bool main$tmp_guard1;
[L707]               0  int x = 0;
[L709]               0  int y = 0;
[L711]               0  int z = 0;
[L712]               0  _Bool z$flush_delayed;
[L713]               0  int z$mem_tmp;
[L714]               0  _Bool z$r_buff0_thd0;
[L715]               0  _Bool z$r_buff0_thd1;
[L716]               0  _Bool z$r_buff0_thd2;
[L717]               0  _Bool z$r_buff0_thd3;
[L718]               0  _Bool z$r_buff0_thd4;
[L719]               0  _Bool z$r_buff1_thd0;
[L720]               0  _Bool z$r_buff1_thd1;
[L721]               0  _Bool z$r_buff1_thd2;
[L722]               0  _Bool z$r_buff1_thd3;
[L723]               0  _Bool z$r_buff1_thd4;
[L724]               0  _Bool z$read_delayed;
[L725]               0  int *z$read_delayed_var;
[L726]               0  int z$w_buff0;
[L727]               0  _Bool z$w_buff0_used;
[L728]               0  int z$w_buff1;
[L729]               0  _Bool z$w_buff1_used;
[L730]               0  _Bool weak$$choice0;
[L731]               0  _Bool weak$$choice2;
[L823]               0  pthread_t t1537;
[L824]  FCALL, FORK  0  pthread_create(&t1537, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L825]               0  pthread_t t1538;
[L826]  FCALL, FORK  0  pthread_create(&t1538, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L827]               0  pthread_t t1539;
[L828]  FCALL, FORK  0  pthread_create(&t1539, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L829]               0  pthread_t t1540;
[L830]  FCALL, FORK  0  pthread_create(&t1540, ((void *)0), P3, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L785]               4  z$w_buff1 = z$w_buff0
[L786]               4  z$w_buff0 = 2
[L787]               4  z$w_buff1_used = z$w_buff0_used
[L788]               4  z$w_buff0_used = (_Bool)1
[L7]    COND TRUE    4  !expression
[L7]                 4  __VERIFIER_error()
[L790]               4  z$r_buff1_thd0 = z$r_buff0_thd0
[L791]               4  z$r_buff1_thd1 = z$r_buff0_thd1
[L792]               4  z$r_buff1_thd2 = z$r_buff0_thd2
[L793]               4  z$r_buff1_thd3 = z$r_buff0_thd3
[L794]               4  z$r_buff1_thd4 = z$r_buff0_thd4
[L795]               4  z$r_buff0_thd4 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L798]               4  __unbuffered_p3_EAX = a
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L735]               1  a = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L738]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L750]               2  x = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L753]               2  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L765]               3  y = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L768]               3  z = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L771]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L771]               3  z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L772]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L772]               3  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L773]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L773]               3  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L774]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L774]               3  z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L775]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L775]               3  z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L801]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L801]  EXPR         4  z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z
[L801]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L801]               4  z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L802]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L802]               4  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L803]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used
[L803]               4  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used
[L804]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L804]               4  z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L805]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4
[L805]               4  z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4
[L758]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L760]               2  return 0;
[L743]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L745]               1  return 0;
[L778]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L780]               3  return 0;
[L808]               4  __unbuffered_cnt = __unbuffered_cnt + 1
[L810]               4  return 0;
[L832]               0  main$tmp_guard0 = __unbuffered_cnt == 4
        VAL             [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L843]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L844]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L845]               0  z$flush_delayed = weak$$choice2
[L846]               0  z$mem_tmp = z
[L847]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1)
[L847]               0  z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1)
[L848]  EXPR         0  weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L848]               0  z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L849]  EXPR         0  weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L849]               0  z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L850]  EXPR         0  weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L850]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)
[L850]  EXPR         0  weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L850]               0  z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L851]  EXPR         0  weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L851]               0  z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L852]  EXPR         0  weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L852]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)
[L852]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L852]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)
[L852]  EXPR         0  weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L852]               0  z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L853]  EXPR         0  weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L853]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L853]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0
[L853]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L853]  EXPR         0  weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L853]               0  z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L854]               0  main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0)
[L855]  EXPR         0  z$flush_delayed ? z$mem_tmp : z
[L855]               0  z = z$flush_delayed ? z$mem_tmp : z
[L856]               0  z$flush_delayed = (_Bool)0
[L7]    COND TRUE    0  !expression
[L7]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 5 procedures, 106 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: 19.6s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.1s, HoareTripleCheckerStatistics: 68 SDtfs, 50 SDslu, 29 SDs, 0 SdLazy, 321 SolverSat, 152 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=700occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 257 ConstructedInterpolants, 0 QuantifiedInterpolants, 21635 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...