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


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


This is Ultimate 0.1.25-7bb8cbd
[2020-10-16 01:27:36,543 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-16 01:27:36,546 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-16 01:27:36,583 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-16 01:27:36,583 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-16 01:27:36,591 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-16 01:27:36,594 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-16 01:27:36,599 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-16 01:27:36,601 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-16 01:27:36,605 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-16 01:27:36,606 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-16 01:27:36,607 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-16 01:27:36,607 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-16 01:27:36,610 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-16 01:27:36,612 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-16 01:27:36,614 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-16 01:27:36,615 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-16 01:27:36,617 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-16 01:27:36,619 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-16 01:27:36,627 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-16 01:27:36,629 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-16 01:27:36,630 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-16 01:27:36,631 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-16 01:27:36,632 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-16 01:27:36,644 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-16 01:27:36,647 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-16 01:27:36,647 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-16 01:27:36,648 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-16 01:27:36,649 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-16 01:27:36,652 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-16 01:27:36,652 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-16 01:27:36,653 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-16 01:27:36,653 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-16 01:27:36,657 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-16 01:27:36,658 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-16 01:27:36,659 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-16 01:27:36,659 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-16 01:27:36,660 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-16 01:27:36,660 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-16 01:27:36,663 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-16 01:27:36,664 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-16 01:27:36,665 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf
[2020-10-16 01:27:36,701 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-16 01:27:36,702 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-16 01:27:36,703 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-16 01:27:36,704 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-16 01:27:36,704 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-16 01:27:36,704 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-16 01:27:36,704 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-16 01:27:36,705 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-16 01:27:36,705 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-16 01:27:36,705 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-16 01:27:36,706 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-16 01:27:36,706 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-16 01:27:36,707 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-16 01:27:36,707 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-16 01:27:36,707 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-16 01:27:36,707 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-16 01:27:36,708 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-16 01:27:36,708 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-16 01:27:36,708 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-16 01:27:36,708 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-16 01:27:36,709 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-16 01:27:36,709 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 01:27:36,709 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-16 01:27:36,709 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-16 01:27:36,710 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-16 01:27:36,710 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-16 01:27:36,710 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-16 01:27:36,710 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2020-10-16 01:27:36,710 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-16 01:27:36,995 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-16 01:27:37,013 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-16 01:27:37,018 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-16 01:27:37,019 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-16 01:27:37,020 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-16 01:27:37,020 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046_power.opt.i
[2020-10-16 01:27:37,096 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fd333c91/11bf12b091c944ed86b4181085bcd682/FLAG888759aae
[2020-10-16 01:27:37,607 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-16 01:27:37,608 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046_power.opt.i
[2020-10-16 01:27:37,624 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fd333c91/11bf12b091c944ed86b4181085bcd682/FLAG888759aae
[2020-10-16 01:27:37,932 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fd333c91/11bf12b091c944ed86b4181085bcd682
[2020-10-16 01:27:37,940 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-16 01:27:37,942 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-16 01:27:37,943 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-16 01:27:37,943 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-16 01:27:37,946 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-16 01:27:37,946 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:27:37" (1/1) ...
[2020-10-16 01:27:37,949 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba0a647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:37, skipping insertion in model container
[2020-10-16 01:27:37,949 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:27:37" (1/1) ...
[2020-10-16 01:27:37,957 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-16 01:27:38,002 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-16 01:27:38,533 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 01:27:38,546 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-16 01:27:38,613 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 01:27:38,689 INFO  L208         MainTranslator]: Completed translation
[2020-10-16 01:27:38,690 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:38 WrapperNode
[2020-10-16 01:27:38,690 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-16 01:27:38,691 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-16 01:27:38,691 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-16 01:27:38,691 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-16 01:27:38,701 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:38" (1/1) ...
[2020-10-16 01:27:38,721 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:38" (1/1) ...
[2020-10-16 01:27:38,761 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-16 01:27:38,762 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-16 01:27:38,762 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-16 01:27:38,762 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-16 01:27:38,773 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:38" (1/1) ...
[2020-10-16 01:27:38,773 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:38" (1/1) ...
[2020-10-16 01:27:38,778 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:38" (1/1) ...
[2020-10-16 01:27:38,779 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:38" (1/1) ...
[2020-10-16 01:27:38,790 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:38" (1/1) ...
[2020-10-16 01:27:38,797 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:38" (1/1) ...
[2020-10-16 01:27:38,801 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:38" (1/1) ...
[2020-10-16 01:27:38,806 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-16 01:27:38,807 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-16 01:27:38,807 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-16 01:27:38,807 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-16 01:27:38,808 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:38" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 01:27:38,883 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-16 01:27:38,884 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-16 01:27:38,884 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-16 01:27:38,884 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-16 01:27:38,884 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-16 01:27:38,885 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-16 01:27:38,886 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-16 01:27:38,886 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-16 01:27:38,887 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-16 01:27:38,887 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-16 01:27:38,890 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2020-10-16 01:27:38,890 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2020-10-16 01:27:38,890 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-16 01:27:38,890 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-16 01:27:38,890 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-16 01:27:38,893 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-16 01:27:40,843 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-16 01:27:40,844 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-16 01:27:40,846 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:27:40 BoogieIcfgContainer
[2020-10-16 01:27:40,846 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-16 01:27:40,848 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-16 01:27:40,848 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-16 01:27:40,851 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-16 01:27:40,852 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:27:37" (1/3) ...
[2020-10-16 01:27:40,853 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc5ac95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:27:40, skipping insertion in model container
[2020-10-16 01:27:40,853 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:27:38" (2/3) ...
[2020-10-16 01:27:40,853 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc5ac95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:27:40, skipping insertion in model container
[2020-10-16 01:27:40,854 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:27:40" (3/3) ...
[2020-10-16 01:27:40,855 INFO  L111   eAbstractionObserver]: Analyzing ICFG mix046_power.opt.i
[2020-10-16 01:27:40,868 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-16 01:27:40,876 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-16 01:27:40,877 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-16 01:27:40,907 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,908 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,908 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,908 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,909 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,909 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,909 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,909 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,910 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,910 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,910 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,911 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,911 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,911 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,911 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,911 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,912 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,912 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,912 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,912 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,912 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,913 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,913 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,913 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,914 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,914 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,914 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,915 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,915 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,915 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,915 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,916 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,916 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,916 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,916 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,917 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,917 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,917 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,917 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,917 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,918 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,918 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,922 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,922 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,923 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,923 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,927 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,927 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,927 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,928 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,928 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,928 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,928 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,928 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,928 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,929 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,930 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,931 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,931 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,931 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,931 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,931 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,932 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,932 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,932 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,932 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,932 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,932 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,934 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,934 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,935 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,935 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:27:40,952 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2020-10-16 01:27:40,975 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-16 01:27:40,975 INFO  L378      AbstractCegarLoop]: Hoare is false
[2020-10-16 01:27:40,975 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-16 01:27:40,975 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-16 01:27:40,975 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-16 01:27:40,975 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-16 01:27:40,976 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-16 01:27:40,976 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-16 01:27:40,991 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 244 flow
[2020-10-16 01:27:41,044 INFO  L129       PetriNetUnfolder]: 2/108 cut-off events.
[2020-10-16 01:27:41,045 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 01:27:41,050 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. 
[2020-10-16 01:27:41,051 INFO  L82        GeneralOperation]: Start removeDead. Operand has 123 places, 112 transitions, 244 flow
[2020-10-16 01:27:41,058 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 119 places, 108 transitions, 228 flow
[2020-10-16 01:27:41,061 INFO  L129   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-16 01:27:41,063 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 108 transitions, 228 flow
[2020-10-16 01:27:41,066 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 108 transitions, 228 flow
[2020-10-16 01:27:41,067 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 119 places, 108 transitions, 228 flow
[2020-10-16 01:27:41,099 INFO  L129       PetriNetUnfolder]: 2/108 cut-off events.
[2020-10-16 01:27:41,100 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 01:27:41,101 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. 
[2020-10-16 01:27:41,105 INFO  L117        LiptonReduction]: Number of co-enabled transitions 2540
[2020-10-16 01:27:41,433 WARN  L193               SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45
[2020-10-16 01:27:41,834 WARN  L193               SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-16 01:27:41,957 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:41,958 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:41,960 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:27:41,960 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:42,007 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:42,008 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:42,010 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:27:42,010 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:42,052 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:42,052 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:42,054 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term
[2020-10-16 01:27:42,054 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:42,079 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:42,079 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:42,081 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:27:42,081 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:42,216 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:42,217 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:42,218 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:27:42,218 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:42,222 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:27:42,222 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 01:27:42,226 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 01:27:42,226 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:42,274 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:27:42,274 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:42,277 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:42,277 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:42,279 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:42,279 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:42,282 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:42,283 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:27:42,285 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:42,286 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:27:42,288 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:42,288 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:27:42,291 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 01:27:42,291 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:42,293 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:42,293 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:42,296 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:42,296 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:42,379 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:42,380 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:42,381 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:27:42,381 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:42,409 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:42,409 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:42,411 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:27:42,411 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:42,444 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:42,469 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:42,471 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:27:42,471 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:42,493 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:42,493 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:42,494 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:27:42,495 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:42,546 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:27:42,546 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:42,560 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:42,561 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:42,562 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:42,562 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:42,566 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:42,567 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:27:42,568 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:42,569 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:27:42,570 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:42,571 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:27:42,577 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 01:27:42,578 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:42,579 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:42,579 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:42,581 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:42,582 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:42,641 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:42,642 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:42,643 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:27:42,645 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:42,650 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:27:42,651 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 01:27:42,656 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 01:27:42,656 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:44,074 WARN  L193               SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 230 DAG size of output: 189
[2020-10-16 01:27:44,091 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2020-10-16 01:27:44,091 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:44,091 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:27:44,092 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:45,370 WARN  L193               SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 147 DAG size of output: 127
[2020-10-16 01:27:45,392 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:45,393 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:45,394 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:27:45,394 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:45,419 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:45,419 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:45,420 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term
[2020-10-16 01:27:45,420 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:45,471 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:45,471 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:45,473 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:45,473 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:45,474 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:45,475 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:45,478 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:45,478 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:27:45,480 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:45,481 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:27:45,483 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:45,483 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:27:45,485 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 01:27:45,485 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:45,487 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:45,488 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:45,489 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:45,489 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:45,530 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:45,531 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:45,532 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:27:45,532 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:45,534 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:27:45,535 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 01:27:45,537 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 01:27:45,537 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:45,588 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:45,588 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:45,589 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:27:45,589 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:45,605 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:45,605 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:45,606 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:27:45,606 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:45,668 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:45,669 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:45,669 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:27:45,670 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:45,690 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:27:45,690 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:45,691 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:27:45,691 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:45,768 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:27:45,769 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:45,770 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:45,770 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:45,771 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:45,771 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:45,773 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:27:45,773 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:45,785 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:45,786 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:45,786 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:45,787 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:45,788 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:45,788 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:27:45,790 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:27:45,790 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:27:45,840 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 01:27:45,840 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:46,209 WARN  L193               SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-10-16 01:27:46,558 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:27:46,559 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:46,560 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-16 01:27:46,560 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:46,561 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:46,561 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:46,562 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:46,562 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:46,564 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:46,564 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:46,566 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:46,566 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:46,567 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:27:46,567 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:46,569 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:46,569 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:46,570 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:46,571 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:46,591 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:27:46,591 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:27:46,593 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:27:46,593 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:46,863 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 01:27:46,864 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:46,953 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:27:46,953 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:27:46,955 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:27:46,956 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:46,988 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:27:46,988 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:46,989 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-16 01:27:46,989 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:46,990 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:46,990 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:46,991 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:46,991 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:46,995 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:46,995 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:46,996 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:46,997 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:47,002 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:27:47,003 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:47,004 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:47,004 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:47,005 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:47,005 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:48,460 WARN  L193               SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 138 DAG size of output: 129
[2020-10-16 01:27:48,773 WARN  L193               SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 126
[2020-10-16 01:27:49,448 WARN  L193               SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 111
[2020-10-16 01:27:49,746 WARN  L193               SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 108
[2020-10-16 01:27:49,911 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:27:49,911 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:49,912 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:49,912 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:49,913 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:49,913 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:49,914 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:27:49,914 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:49,927 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:27:49,927 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:49,928 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:49,928 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:49,930 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:49,930 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:27:49,932 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:27:49,932 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:27:50,904 WARN  L193               SmtUtils]: Spent 594.00 ms on a formula simplification that was a NOOP. DAG size: 136
[2020-10-16 01:27:51,244 WARN  L193               SmtUtils]: Spent 338.00 ms on a formula simplification that was a NOOP. DAG size: 134
[2020-10-16 01:27:51,252 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:27:51,252 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:51,253 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:51,253 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:51,255 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:51,255 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:27:51,257 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:27:51,257 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:27:51,269 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:51,269 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:51,270 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:51,271 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:27:51,273 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:27:51,273 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:51,275 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:27:51,275 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:27:51,820 WARN  L193               SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97
[2020-10-16 01:27:51,951 WARN  L193               SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 95
[2020-10-16 01:27:51,960 INFO  L132        LiptonReduction]: Checked pairs total: 6449
[2020-10-16 01:27:51,960 INFO  L134        LiptonReduction]: Total number of compositions: 89
[2020-10-16 01:27:51,963 INFO  L182   CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10905
[2020-10-16 01:27:51,970 INFO  L129       PetriNetUnfolder]: 0/17 cut-off events.
[2020-10-16 01:27:51,971 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 01:27:51,971 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:27:51,972 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:27:51,972 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:27:51,977 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:27:51,978 INFO  L82        PathProgramCache]: Analyzing trace with hash 445514123, now seen corresponding path program 1 times
[2020-10-16 01:27:51,988 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:27:51,988 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160485268]
[2020-10-16 01:27:51,989 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:27:52,121 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:27:52,241 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:27:52,242 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160485268]
[2020-10-16 01:27:52,243 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:27:52,243 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 01:27:52,244 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260425188]
[2020-10-16 01:27:52,254 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 01:27:52,255 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:27:52,269 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 01:27:52,272 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 01:27:52,274 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 171 out of 201
[2020-10-16 01:27:52,276 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand 3 states.
[2020-10-16 01:27:52,277 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:27:52,277 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 201
[2020-10-16 01:27:52,278 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:27:52,368 INFO  L129       PetriNetUnfolder]: 23/89 cut-off events.
[2020-10-16 01:27:52,369 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 01:27:52,369 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 150 conditions, 89 events. 23/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 326 event pairs, 3 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 139. Up to 37 conditions per place. 
[2020-10-16 01:27:52,371 INFO  L132   encePairwiseOnDemand]: 198/201 looper letters, 7 selfloop transitions, 2 changer transitions 2/31 dead transitions.
[2020-10-16 01:27:52,371 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 31 transitions, 96 flow
[2020-10-16 01:27:52,372 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 01:27:52,375 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2020-10-16 01:27:52,386 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions.
[2020-10-16 01:27:52,390 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8706467661691543
[2020-10-16 01:27:52,391 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 525 transitions.
[2020-10-16 01:27:52,392 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 525 transitions.
[2020-10-16 01:27:52,394 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:27:52,398 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 525 transitions.
[2020-10-16 01:27:52,402 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 4 states.
[2020-10-16 01:27:52,410 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states.
[2020-10-16 01:27:52,410 INFO  L81            ComplementDD]: Finished complementDD. Result 4 states.
[2020-10-16 01:27:52,412 INFO  L185             Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 3 states and 525 transitions.
[2020-10-16 01:27:52,413 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 31 transitions, 96 flow
[2020-10-16 01:27:52,416 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 92 flow, removed 0 selfloop flow, removed 4 redundant places.
[2020-10-16 01:27:52,418 INFO  L241             Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow
[2020-10-16 01:27:52,421 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26}
[2020-10-16 01:27:52,422 INFO  L342   CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places.
[2020-10-16 01:27:52,422 INFO  L481      AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow
[2020-10-16 01:27:52,423 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 01:27:52,423 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:27:52,423 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:27:52,423 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-16 01:27:52,423 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:27:52,424 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:27:52,424 INFO  L82        PathProgramCache]: Analyzing trace with hash -1357577055, now seen corresponding path program 1 times
[2020-10-16 01:27:52,424 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:27:52,424 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570255509]
[2020-10-16 01:27:52,424 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:27:52,475 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:27:52,540 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:27:52,540 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570255509]
[2020-10-16 01:27:52,541 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:27:52,541 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 01:27:52,541 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051470033]
[2020-10-16 01:27:52,542 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 01:27:52,543 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:27:52,543 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 01:27:52,544 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 01:27:52,545 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 178 out of 201
[2020-10-16 01:27:52,546 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand 3 states.
[2020-10-16 01:27:52,546 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:27:52,546 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 201
[2020-10-16 01:27:52,546 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:27:52,558 INFO  L129       PetriNetUnfolder]: 0/26 cut-off events.
[2020-10-16 01:27:52,558 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 01:27:52,559 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 42 conditions, 26 events. 0/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 32 event pairs, 0 based on Foata normal form. 1/27 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. 
[2020-10-16 01:27:52,559 INFO  L132   encePairwiseOnDemand]: 198/201 looper letters, 1 selfloop transitions, 2 changer transitions 0/26 dead transitions.
[2020-10-16 01:27:52,559 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 26 transitions, 70 flow
[2020-10-16 01:27:52,560 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 01:27:52,560 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2020-10-16 01:27:52,562 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 538 transitions.
[2020-10-16 01:27:52,562 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8922056384742952
[2020-10-16 01:27:52,562 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 538 transitions.
[2020-10-16 01:27:52,562 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 538 transitions.
[2020-10-16 01:27:52,563 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:27:52,563 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 538 transitions.
[2020-10-16 01:27:52,564 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 4 states.
[2020-10-16 01:27:52,566 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states.
[2020-10-16 01:27:52,566 INFO  L81            ComplementDD]: Finished complementDD. Result 4 states.
[2020-10-16 01:27:52,566 INFO  L185             Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 3 states and 538 transitions.
[2020-10-16 01:27:52,566 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 26 transitions, 70 flow
[2020-10-16 01:27:52,567 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 26 transitions, 66 flow, removed 0 selfloop flow, removed 2 redundant places.
[2020-10-16 01:27:52,568 INFO  L241             Difference]: Finished difference. Result has 38 places, 26 transitions, 68 flow
[2020-10-16 01:27:52,568 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=38, PETRI_TRANSITIONS=26}
[2020-10-16 01:27:52,569 INFO  L342   CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places.
[2020-10-16 01:27:52,569 INFO  L481      AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 68 flow
[2020-10-16 01:27:52,569 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 01:27:52,569 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:27:52,569 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:27:52,570 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-16 01:27:52,570 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:27:52,570 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:27:52,570 INFO  L82        PathProgramCache]: Analyzing trace with hash 990818122, now seen corresponding path program 1 times
[2020-10-16 01:27:52,570 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:27:52,571 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536926608]
[2020-10-16 01:27:52,571 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:27:52,606 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:27:52,690 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:27:52,690 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536926608]
[2020-10-16 01:27:52,691 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:27:52,691 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 01:27:52,691 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913717937]
[2020-10-16 01:27:52,691 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 01:27:52,692 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:27:52,692 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 01:27:52,692 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 01:27:52,694 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 161 out of 201
[2020-10-16 01:27:52,694 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 68 flow. Second operand 4 states.
[2020-10-16 01:27:52,694 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:27:52,694 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 201
[2020-10-16 01:27:52,695 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:27:52,791 INFO  L129       PetriNetUnfolder]: 64/161 cut-off events.
[2020-10-16 01:27:52,791 INFO  L130       PetriNetUnfolder]: For 10/10 co-relation queries the response was YES.
[2020-10-16 01:27:52,792 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 312 conditions, 161 events. 64/161 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 661 event pairs, 37 based on Foata normal form. 2/157 useless extension candidates. Maximal degree in co-relation 302. Up to 103 conditions per place. 
[2020-10-16 01:27:52,794 INFO  L132   encePairwiseOnDemand]: 196/201 looper letters, 10 selfloop transitions, 6 changer transitions 0/34 dead transitions.
[2020-10-16 01:27:52,794 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 34 transitions, 116 flow
[2020-10-16 01:27:52,795 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 01:27:52,795 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-10-16 01:27:52,796 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 661 transitions.
[2020-10-16 01:27:52,797 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.822139303482587
[2020-10-16 01:27:52,797 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 661 transitions.
[2020-10-16 01:27:52,797 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 661 transitions.
[2020-10-16 01:27:52,798 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:27:52,798 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 661 transitions.
[2020-10-16 01:27:52,800 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 5 states.
[2020-10-16 01:27:52,802 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states.
[2020-10-16 01:27:52,802 INFO  L81            ComplementDD]: Finished complementDD. Result 5 states.
[2020-10-16 01:27:52,802 INFO  L185             Difference]: Start difference. First operand has 38 places, 26 transitions, 68 flow. Second operand 4 states and 661 transitions.
[2020-10-16 01:27:52,803 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 34 transitions, 116 flow
[2020-10-16 01:27:52,804 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 34 transitions, 112 flow, removed 0 selfloop flow, removed 2 redundant places.
[2020-10-16 01:27:52,805 INFO  L241             Difference]: Finished difference. Result has 41 places, 31 transitions, 101 flow
[2020-10-16 01:27:52,805 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=41, PETRI_TRANSITIONS=31}
[2020-10-16 01:27:52,805 INFO  L342   CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places.
[2020-10-16 01:27:52,806 INFO  L481      AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 101 flow
[2020-10-16 01:27:52,806 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 01:27:52,806 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:27:52,806 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:27:52,806 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-16 01:27:52,806 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:27:52,807 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:27:52,807 INFO  L82        PathProgramCache]: Analyzing trace with hash 2080844396, now seen corresponding path program 1 times
[2020-10-16 01:27:52,807 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:27:52,807 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201518775]
[2020-10-16 01:27:52,807 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:27:52,836 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:27:52,919 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:27:52,922 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201518775]
[2020-10-16 01:27:52,923 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:27:52,923 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 01:27:52,923 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898457237]
[2020-10-16 01:27:52,923 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 01:27:52,923 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:27:52,924 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 01:27:52,924 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 01:27:52,925 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 158 out of 201
[2020-10-16 01:27:52,926 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 101 flow. Second operand 5 states.
[2020-10-16 01:27:52,926 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:27:52,926 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 201
[2020-10-16 01:27:52,927 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:27:53,023 INFO  L129       PetriNetUnfolder]: 47/148 cut-off events.
[2020-10-16 01:27:53,024 INFO  L130       PetriNetUnfolder]: For 47/49 co-relation queries the response was YES.
[2020-10-16 01:27:53,025 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 312 conditions, 148 events. 47/148 cut-off events. For 47/49 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 649 event pairs, 26 based on Foata normal form. 3/144 useless extension candidates. Maximal degree in co-relation 300. Up to 82 conditions per place. 
[2020-10-16 01:27:53,027 INFO  L132   encePairwiseOnDemand]: 196/201 looper letters, 8 selfloop transitions, 6 changer transitions 0/37 dead transitions.
[2020-10-16 01:27:53,027 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 37 transitions, 143 flow
[2020-10-16 01:27:53,028 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 01:27:53,028 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-10-16 01:27:53,030 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 646 transitions.
[2020-10-16 01:27:53,031 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8034825870646766
[2020-10-16 01:27:53,031 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 646 transitions.
[2020-10-16 01:27:53,031 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 646 transitions.
[2020-10-16 01:27:53,032 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:27:53,032 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 646 transitions.
[2020-10-16 01:27:53,033 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 5 states.
[2020-10-16 01:27:53,035 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states.
[2020-10-16 01:27:53,035 INFO  L81            ComplementDD]: Finished complementDD. Result 5 states.
[2020-10-16 01:27:53,035 INFO  L185             Difference]: Start difference. First operand has 41 places, 31 transitions, 101 flow. Second operand 4 states and 646 transitions.
[2020-10-16 01:27:53,036 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 37 transitions, 143 flow
[2020-10-16 01:27:53,037 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 37 transitions, 143 flow, removed 0 selfloop flow, removed 0 redundant places.
[2020-10-16 01:27:53,038 INFO  L241             Difference]: Finished difference. Result has 46 places, 35 transitions, 139 flow
[2020-10-16 01:27:53,038 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=46, PETRI_TRANSITIONS=35}
[2020-10-16 01:27:53,038 INFO  L342   CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places.
[2020-10-16 01:27:53,039 INFO  L481      AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 139 flow
[2020-10-16 01:27:53,039 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 01:27:53,039 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:27:53,039 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:27:53,039 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-16 01:27:53,039 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:27:53,040 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:27:53,040 INFO  L82        PathProgramCache]: Analyzing trace with hash -722801800, now seen corresponding path program 1 times
[2020-10-16 01:27:53,040 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:27:53,040 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930456831]
[2020-10-16 01:27:53,040 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:27:53,066 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:27:53,144 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:27:53,144 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930456831]
[2020-10-16 01:27:53,144 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:27:53,145 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 01:27:53,145 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728135448]
[2020-10-16 01:27:53,145 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 01:27:53,145 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:27:53,146 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 01:27:53,146 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2020-10-16 01:27:53,147 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 159 out of 201
[2020-10-16 01:27:53,148 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 139 flow. Second operand 6 states.
[2020-10-16 01:27:53,148 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:27:53,148 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 201
[2020-10-16 01:27:53,149 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:27:53,257 INFO  L129       PetriNetUnfolder]: 55/162 cut-off events.
[2020-10-16 01:27:53,257 INFO  L130       PetriNetUnfolder]: For 152/164 co-relation queries the response was YES.
[2020-10-16 01:27:53,259 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 430 conditions, 162 events. 55/162 cut-off events. For 152/164 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 780 event pairs, 5 based on Foata normal form. 7/162 useless extension candidates. Maximal degree in co-relation 414. Up to 83 conditions per place. 
[2020-10-16 01:27:53,261 INFO  L132   encePairwiseOnDemand]: 195/201 looper letters, 11 selfloop transitions, 7 changer transitions 0/41 dead transitions.
[2020-10-16 01:27:53,261 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 41 transitions, 189 flow
[2020-10-16 01:27:53,262 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 01:27:53,262 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-10-16 01:27:53,264 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 811 transitions.
[2020-10-16 01:27:53,265 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8069651741293532
[2020-10-16 01:27:53,265 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 811 transitions.
[2020-10-16 01:27:53,265 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 811 transitions.
[2020-10-16 01:27:53,266 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:27:53,266 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 811 transitions.
[2020-10-16 01:27:53,268 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 6 states.
[2020-10-16 01:27:53,270 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states.
[2020-10-16 01:27:53,270 INFO  L81            ComplementDD]: Finished complementDD. Result 6 states.
[2020-10-16 01:27:53,270 INFO  L185             Difference]: Start difference. First operand has 46 places, 35 transitions, 139 flow. Second operand 5 states and 811 transitions.
[2020-10-16 01:27:53,270 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 41 transitions, 189 flow
[2020-10-16 01:27:53,272 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 41 transitions, 187 flow, removed 1 selfloop flow, removed 0 redundant places.
[2020-10-16 01:27:53,273 INFO  L241             Difference]: Finished difference. Result has 51 places, 37 transitions, 166 flow
[2020-10-16 01:27:53,274 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=51, PETRI_TRANSITIONS=37}
[2020-10-16 01:27:53,274 INFO  L342   CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places.
[2020-10-16 01:27:53,274 INFO  L481      AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 166 flow
[2020-10-16 01:27:53,274 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 01:27:53,274 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:27:53,274 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:27:53,275 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-16 01:27:53,275 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:27:53,275 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:27:53,275 INFO  L82        PathProgramCache]: Analyzing trace with hash 532452578, now seen corresponding path program 2 times
[2020-10-16 01:27:53,275 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:27:53,276 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018409190]
[2020-10-16 01:27:53,276 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:27:53,297 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:27:53,355 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:27:53,355 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018409190]
[2020-10-16 01:27:53,356 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:27:53,356 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 01:27:53,356 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073434922]
[2020-10-16 01:27:53,357 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 01:27:53,357 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:27:53,357 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 01:27:53,357 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 01:27:53,359 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 160 out of 201
[2020-10-16 01:27:53,359 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 166 flow. Second operand 5 states.
[2020-10-16 01:27:53,359 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:27:53,360 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 201
[2020-10-16 01:27:53,360 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:27:53,475 INFO  L129       PetriNetUnfolder]: 63/178 cut-off events.
[2020-10-16 01:27:53,475 INFO  L130       PetriNetUnfolder]: For 289/305 co-relation queries the response was YES.
[2020-10-16 01:27:53,476 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 567 conditions, 178 events. 63/178 cut-off events. For 289/305 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 852 event pairs, 7 based on Foata normal form. 13/182 useless extension candidates. Maximal degree in co-relation 548. Up to 98 conditions per place. 
[2020-10-16 01:27:53,478 INFO  L132   encePairwiseOnDemand]: 194/201 looper letters, 9 selfloop transitions, 15 changer transitions 0/47 dead transitions.
[2020-10-16 01:27:53,479 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 47 transitions, 257 flow
[2020-10-16 01:27:53,479 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 01:27:53,480 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2020-10-16 01:27:53,482 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 977 transitions.
[2020-10-16 01:27:53,483 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8101160862354893
[2020-10-16 01:27:53,483 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 977 transitions.
[2020-10-16 01:27:53,483 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 977 transitions.
[2020-10-16 01:27:53,484 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:27:53,484 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 977 transitions.
[2020-10-16 01:27:53,487 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 7 states.
[2020-10-16 01:27:53,490 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states.
[2020-10-16 01:27:53,490 INFO  L81            ComplementDD]: Finished complementDD. Result 7 states.
[2020-10-16 01:27:53,490 INFO  L185             Difference]: Start difference. First operand has 51 places, 37 transitions, 166 flow. Second operand 6 states and 977 transitions.
[2020-10-16 01:27:53,490 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 47 transitions, 257 flow
[2020-10-16 01:27:53,493 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 47 transitions, 234 flow, removed 4 selfloop flow, removed 3 redundant places.
[2020-10-16 01:27:53,495 INFO  L241             Difference]: Finished difference. Result has 55 places, 45 transitions, 238 flow
[2020-10-16 01:27:53,495 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=55, PETRI_TRANSITIONS=45}
[2020-10-16 01:27:53,495 INFO  L342   CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places.
[2020-10-16 01:27:53,495 INFO  L481      AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 238 flow
[2020-10-16 01:27:53,496 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 01:27:53,496 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:27:53,496 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:27:53,496 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-16 01:27:53,496 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:27:53,497 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:27:53,497 INFO  L82        PathProgramCache]: Analyzing trace with hash 462568658, now seen corresponding path program 3 times
[2020-10-16 01:27:53,497 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:27:53,497 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418693680]
[2020-10-16 01:27:53,498 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:27:53,519 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:27:53,596 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:27:53,597 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418693680]
[2020-10-16 01:27:53,597 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:27:53,597 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 01:27:53,598 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813172229]
[2020-10-16 01:27:53,598 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 01:27:53,598 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:27:53,598 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 01:27:53,599 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-16 01:27:53,600 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 158 out of 201
[2020-10-16 01:27:53,601 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 238 flow. Second operand 6 states.
[2020-10-16 01:27:53,601 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:27:53,601 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 201
[2020-10-16 01:27:53,601 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:27:53,777 INFO  L129       PetriNetUnfolder]: 59/174 cut-off events.
[2020-10-16 01:27:53,777 INFO  L130       PetriNetUnfolder]: For 380/444 co-relation queries the response was YES.
[2020-10-16 01:27:53,779 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 680 conditions, 174 events. 59/174 cut-off events. For 380/444 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 842 event pairs, 7 based on Foata normal form. 30/195 useless extension candidates. Maximal degree in co-relation 660. Up to 86 conditions per place. 
[2020-10-16 01:27:53,783 INFO  L132   encePairwiseOnDemand]: 195/201 looper letters, 9 selfloop transitions, 19 changer transitions 0/51 dead transitions.
[2020-10-16 01:27:53,783 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 51 transitions, 337 flow
[2020-10-16 01:27:53,784 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 01:27:53,784 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2020-10-16 01:27:53,787 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 964 transitions.
[2020-10-16 01:27:53,788 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7993366500829188
[2020-10-16 01:27:53,788 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 964 transitions.
[2020-10-16 01:27:53,788 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 964 transitions.
[2020-10-16 01:27:53,789 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:27:53,789 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 964 transitions.
[2020-10-16 01:27:53,792 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 7 states.
[2020-10-16 01:27:53,794 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states.
[2020-10-16 01:27:53,795 INFO  L81            ComplementDD]: Finished complementDD. Result 7 states.
[2020-10-16 01:27:53,795 INFO  L185             Difference]: Start difference. First operand has 55 places, 45 transitions, 238 flow. Second operand 6 states and 964 transitions.
[2020-10-16 01:27:53,795 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 51 transitions, 337 flow
[2020-10-16 01:27:53,800 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 51 transitions, 332 flow, removed 2 selfloop flow, removed 1 redundant places.
[2020-10-16 01:27:53,802 INFO  L241             Difference]: Finished difference. Result has 60 places, 50 transitions, 328 flow
[2020-10-16 01:27:53,802 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=328, PETRI_PLACES=60, PETRI_TRANSITIONS=50}
[2020-10-16 01:27:53,802 INFO  L342   CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places.
[2020-10-16 01:27:53,802 INFO  L481      AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 328 flow
[2020-10-16 01:27:53,803 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 01:27:53,803 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:27:53,803 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:27:53,803 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-16 01:27:53,808 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:27:53,808 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:27:53,809 INFO  L82        PathProgramCache]: Analyzing trace with hash -780574363, now seen corresponding path program 1 times
[2020-10-16 01:27:53,810 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:27:53,812 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122049929]
[2020-10-16 01:27:53,812 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:27:53,843 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:27:54,017 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:27:54,017 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122049929]
[2020-10-16 01:27:54,018 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:27:54,018 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 01:27:54,018 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855074383]
[2020-10-16 01:27:54,018 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 01:27:54,019 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:27:54,019 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 01:27:54,019 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2020-10-16 01:27:54,072 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 154 out of 201
[2020-10-16 01:27:54,073 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 328 flow. Second operand 7 states.
[2020-10-16 01:27:54,074 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:27:54,074 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 201
[2020-10-16 01:27:54,075 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:27:54,253 INFO  L129       PetriNetUnfolder]: 63/201 cut-off events.
[2020-10-16 01:27:54,253 INFO  L130       PetriNetUnfolder]: For 723/867 co-relation queries the response was YES.
[2020-10-16 01:27:54,255 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 873 conditions, 201 events. 63/201 cut-off events. For 723/867 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1059 event pairs, 2 based on Foata normal form. 50/242 useless extension candidates. Maximal degree in co-relation 851. Up to 92 conditions per place. 
[2020-10-16 01:27:54,257 INFO  L132   encePairwiseOnDemand]: 194/201 looper letters, 15 selfloop transitions, 22 changer transitions 0/60 dead transitions.
[2020-10-16 01:27:54,258 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 60 transitions, 479 flow
[2020-10-16 01:27:54,259 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 01:27:54,259 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-10-16 01:27:54,262 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1102 transitions.
[2020-10-16 01:27:54,262 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.783226723525231
[2020-10-16 01:27:54,263 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1102 transitions.
[2020-10-16 01:27:54,263 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1102 transitions.
[2020-10-16 01:27:54,264 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:27:54,264 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1102 transitions.
[2020-10-16 01:27:54,266 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 8 states.
[2020-10-16 01:27:54,269 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states.
[2020-10-16 01:27:54,269 INFO  L81            ComplementDD]: Finished complementDD. Result 8 states.
[2020-10-16 01:27:54,269 INFO  L185             Difference]: Start difference. First operand has 60 places, 50 transitions, 328 flow. Second operand 7 states and 1102 transitions.
[2020-10-16 01:27:54,270 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 60 transitions, 479 flow
[2020-10-16 01:27:54,273 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 60 transitions, 454 flow, removed 5 selfloop flow, removed 2 redundant places.
[2020-10-16 01:27:54,275 INFO  L241             Difference]: Finished difference. Result has 67 places, 56 transitions, 434 flow
[2020-10-16 01:27:54,275 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=434, PETRI_PLACES=67, PETRI_TRANSITIONS=56}
[2020-10-16 01:27:54,276 INFO  L342   CegarLoopForPetriNet]: 41 programPoint places, 26 predicate places.
[2020-10-16 01:27:54,276 INFO  L481      AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 434 flow
[2020-10-16 01:27:54,276 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 01:27:54,276 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:27:54,276 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:27:54,276 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-16 01:27:54,277 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:27:54,277 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:27:54,277 INFO  L82        PathProgramCache]: Analyzing trace with hash 739804517, now seen corresponding path program 2 times
[2020-10-16 01:27:54,277 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:27:54,278 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706595002]
[2020-10-16 01:27:54,278 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:27:54,301 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:27:54,401 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:27:54,401 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706595002]
[2020-10-16 01:27:54,401 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:27:54,401 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 01:27:54,402 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592701819]
[2020-10-16 01:27:54,402 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 01:27:54,402 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:27:54,402 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 01:27:54,403 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2020-10-16 01:27:54,404 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 154 out of 201
[2020-10-16 01:27:54,405 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 434 flow. Second operand 7 states.
[2020-10-16 01:27:54,405 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:27:54,405 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 201
[2020-10-16 01:27:54,406 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:27:54,542 INFO  L129       PetriNetUnfolder]: 63/198 cut-off events.
[2020-10-16 01:27:54,542 INFO  L130       PetriNetUnfolder]: For 990/1094 co-relation queries the response was YES.
[2020-10-16 01:27:54,544 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 974 conditions, 198 events. 63/198 cut-off events. For 990/1094 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1053 event pairs, 9 based on Foata normal form. 22/211 useless extension candidates. Maximal degree in co-relation 948. Up to 103 conditions per place. 
[2020-10-16 01:27:54,546 INFO  L132   encePairwiseOnDemand]: 195/201 looper letters, 23 selfloop transitions, 14 changer transitions 0/60 dead transitions.
[2020-10-16 01:27:54,546 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 60 transitions, 538 flow
[2020-10-16 01:27:54,547 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 01:27:54,547 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-10-16 01:27:54,549 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 786 transitions.
[2020-10-16 01:27:54,550 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7820895522388059
[2020-10-16 01:27:54,550 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 786 transitions.
[2020-10-16 01:27:54,550 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 786 transitions.
[2020-10-16 01:27:54,551 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:27:54,551 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 786 transitions.
[2020-10-16 01:27:54,553 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 6 states.
[2020-10-16 01:27:54,555 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states.
[2020-10-16 01:27:54,555 INFO  L81            ComplementDD]: Finished complementDD. Result 6 states.
[2020-10-16 01:27:54,555 INFO  L185             Difference]: Start difference. First operand has 67 places, 56 transitions, 434 flow. Second operand 5 states and 786 transitions.
[2020-10-16 01:27:54,556 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 60 transitions, 538 flow
[2020-10-16 01:27:54,560 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 60 transitions, 508 flow, removed 3 selfloop flow, removed 3 redundant places.
[2020-10-16 01:27:54,562 INFO  L241             Difference]: Finished difference. Result has 69 places, 57 transitions, 455 flow
[2020-10-16 01:27:54,562 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=455, PETRI_PLACES=69, PETRI_TRANSITIONS=57}
[2020-10-16 01:27:54,562 INFO  L342   CegarLoopForPetriNet]: 41 programPoint places, 28 predicate places.
[2020-10-16 01:27:54,562 INFO  L481      AbstractCegarLoop]: Abstraction has has 69 places, 57 transitions, 455 flow
[2020-10-16 01:27:54,562 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 01:27:54,563 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:27:54,563 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:27:54,563 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-16 01:27:54,563 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:27:54,563 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:27:54,563 INFO  L82        PathProgramCache]: Analyzing trace with hash 1451815287, now seen corresponding path program 3 times
[2020-10-16 01:27:54,564 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:27:54,564 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695983045]
[2020-10-16 01:27:54,564 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:27:54,583 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:27:54,669 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:27:54,669 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695983045]
[2020-10-16 01:27:54,670 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:27:54,670 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 01:27:54,670 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248494873]
[2020-10-16 01:27:54,670 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 01:27:54,670 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:27:54,671 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 01:27:54,671 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-16 01:27:54,672 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 155 out of 201
[2020-10-16 01:27:54,673 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 57 transitions, 455 flow. Second operand 6 states.
[2020-10-16 01:27:54,673 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:27:54,674 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 201
[2020-10-16 01:27:54,674 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:27:54,917 INFO  L129       PetriNetUnfolder]: 59/221 cut-off events.
[2020-10-16 01:27:54,917 INFO  L130       PetriNetUnfolder]: For 1183/1275 co-relation queries the response was YES.
[2020-10-16 01:27:54,919 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 991 conditions, 221 events. 59/221 cut-off events. For 1183/1275 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1280 event pairs, 2 based on Foata normal form. 63/280 useless extension candidates. Maximal degree in co-relation 964. Up to 90 conditions per place. 
[2020-10-16 01:27:54,921 INFO  L132   encePairwiseOnDemand]: 195/201 looper letters, 8 selfloop transitions, 28 changer transitions 0/59 dead transitions.
[2020-10-16 01:27:54,921 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 59 transitions, 539 flow
[2020-10-16 01:27:54,922 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 01:27:54,922 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-10-16 01:27:54,925 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1103 transitions.
[2020-10-16 01:27:54,926 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7839374555792467
[2020-10-16 01:27:54,926 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1103 transitions.
[2020-10-16 01:27:54,926 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1103 transitions.
[2020-10-16 01:27:54,927 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:27:54,927 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1103 transitions.
[2020-10-16 01:27:54,929 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 8 states.
[2020-10-16 01:27:54,932 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states.
[2020-10-16 01:27:54,932 INFO  L81            ComplementDD]: Finished complementDD. Result 8 states.
[2020-10-16 01:27:54,932 INFO  L185             Difference]: Start difference. First operand has 69 places, 57 transitions, 455 flow. Second operand 7 states and 1103 transitions.
[2020-10-16 01:27:54,932 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 59 transitions, 539 flow
[2020-10-16 01:27:54,937 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 59 transitions, 512 flow, removed 3 selfloop flow, removed 3 redundant places.
[2020-10-16 01:27:54,942 INFO  L241             Difference]: Finished difference. Result has 73 places, 57 transitions, 502 flow
[2020-10-16 01:27:54,943 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=502, PETRI_PLACES=73, PETRI_TRANSITIONS=57}
[2020-10-16 01:27:54,944 INFO  L342   CegarLoopForPetriNet]: 41 programPoint places, 32 predicate places.
[2020-10-16 01:27:54,944 INFO  L481      AbstractCegarLoop]: Abstraction has has 73 places, 57 transitions, 502 flow
[2020-10-16 01:27:54,944 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 01:27:54,944 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:27:54,944 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:27:54,944 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-16 01:27:54,944 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:27:54,945 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:27:54,945 INFO  L82        PathProgramCache]: Analyzing trace with hash 807321941, now seen corresponding path program 1 times
[2020-10-16 01:27:54,945 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:27:54,946 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430682391]
[2020-10-16 01:27:54,946 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:27:55,007 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:27:55,047 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:27:55,047 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430682391]
[2020-10-16 01:27:55,048 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:27:55,048 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 01:27:55,048 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159225834]
[2020-10-16 01:27:55,049 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 01:27:55,049 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:27:55,049 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 01:27:55,050 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 01:27:55,051 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 169 out of 201
[2020-10-16 01:27:55,052 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 57 transitions, 502 flow. Second operand 4 states.
[2020-10-16 01:27:55,052 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:27:55,053 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 201
[2020-10-16 01:27:55,053 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:27:55,283 INFO  L129       PetriNetUnfolder]: 475/951 cut-off events.
[2020-10-16 01:27:55,283 INFO  L130       PetriNetUnfolder]: For 3108/3608 co-relation queries the response was YES.
[2020-10-16 01:27:55,291 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 3254 conditions, 951 events. 475/951 cut-off events. For 3108/3608 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 6586 event pairs, 182 based on Foata normal form. 157/989 useless extension candidates. Maximal degree in co-relation 3226. Up to 552 conditions per place. 
[2020-10-16 01:27:55,299 INFO  L132   encePairwiseOnDemand]: 194/201 looper letters, 13 selfloop transitions, 10 changer transitions 0/70 dead transitions.
[2020-10-16 01:27:55,299 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 70 transitions, 574 flow
[2020-10-16 01:27:55,300 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 01:27:55,300 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-10-16 01:27:55,302 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 867 transitions.
[2020-10-16 01:27:55,302 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8626865671641791
[2020-10-16 01:27:55,303 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 867 transitions.
[2020-10-16 01:27:55,303 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 867 transitions.
[2020-10-16 01:27:55,303 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:27:55,303 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 867 transitions.
[2020-10-16 01:27:55,305 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 6 states.
[2020-10-16 01:27:55,307 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states.
[2020-10-16 01:27:55,307 INFO  L81            ComplementDD]: Finished complementDD. Result 6 states.
[2020-10-16 01:27:55,307 INFO  L185             Difference]: Start difference. First operand has 73 places, 57 transitions, 502 flow. Second operand 5 states and 867 transitions.
[2020-10-16 01:27:55,307 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 70 transitions, 574 flow
[2020-10-16 01:27:55,317 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 70 transitions, 529 flow, removed 6 selfloop flow, removed 5 redundant places.
[2020-10-16 01:27:55,319 INFO  L241             Difference]: Finished difference. Result has 75 places, 66 transitions, 544 flow
[2020-10-16 01:27:55,319 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=544, PETRI_PLACES=75, PETRI_TRANSITIONS=66}
[2020-10-16 01:27:55,320 INFO  L342   CegarLoopForPetriNet]: 41 programPoint places, 34 predicate places.
[2020-10-16 01:27:55,320 INFO  L481      AbstractCegarLoop]: Abstraction has has 75 places, 66 transitions, 544 flow
[2020-10-16 01:27:55,320 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 01:27:55,320 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:27:55,320 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:27:55,320 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-16 01:27:55,321 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:27:55,321 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:27:55,321 INFO  L82        PathProgramCache]: Analyzing trace with hash 1328558480, now seen corresponding path program 1 times
[2020-10-16 01:27:55,321 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:27:55,321 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571928915]
[2020-10-16 01:27:55,322 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:27:55,346 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:27:55,380 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:27:55,380 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571928915]
[2020-10-16 01:27:55,380 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:27:55,381 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 01:27:55,381 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437085546]
[2020-10-16 01:27:55,381 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 01:27:55,381 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:27:55,382 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 01:27:55,382 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 01:27:55,383 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 169 out of 201
[2020-10-16 01:27:55,384 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 66 transitions, 544 flow. Second operand 5 states.
[2020-10-16 01:27:55,384 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:27:55,384 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 201
[2020-10-16 01:27:55,384 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:27:55,645 INFO  L129       PetriNetUnfolder]: 335/730 cut-off events.
[2020-10-16 01:27:55,645 INFO  L130       PetriNetUnfolder]: For 3218/5938 co-relation queries the response was YES.
[2020-10-16 01:27:55,650 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 3205 conditions, 730 events. 335/730 cut-off events. For 3218/5938 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 4907 event pairs, 57 based on Foata normal form. 307/956 useless extension candidates. Maximal degree in co-relation 3175. Up to 495 conditions per place. 
[2020-10-16 01:27:55,657 INFO  L132   encePairwiseOnDemand]: 194/201 looper letters, 13 selfloop transitions, 19 changer transitions 0/79 dead transitions.
[2020-10-16 01:27:55,657 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 79 transitions, 684 flow
[2020-10-16 01:27:55,658 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 01:27:55,658 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-10-16 01:27:55,661 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1214 transitions.
[2020-10-16 01:27:55,662 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8628287135749823
[2020-10-16 01:27:55,662 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1214 transitions.
[2020-10-16 01:27:55,662 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1214 transitions.
[2020-10-16 01:27:55,664 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:27:55,664 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1214 transitions.
[2020-10-16 01:27:55,666 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 8 states.
[2020-10-16 01:27:55,670 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states.
[2020-10-16 01:27:55,670 INFO  L81            ComplementDD]: Finished complementDD. Result 8 states.
[2020-10-16 01:27:55,670 INFO  L185             Difference]: Start difference. First operand has 75 places, 66 transitions, 544 flow. Second operand 7 states and 1214 transitions.
[2020-10-16 01:27:55,670 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 79 transitions, 684 flow
[2020-10-16 01:27:55,678 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 79 transitions, 679 flow, removed 0 selfloop flow, removed 1 redundant places.
[2020-10-16 01:27:55,681 INFO  L241             Difference]: Finished difference. Result has 83 places, 75 transitions, 685 flow
[2020-10-16 01:27:55,681 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=685, PETRI_PLACES=83, PETRI_TRANSITIONS=75}
[2020-10-16 01:27:55,681 INFO  L342   CegarLoopForPetriNet]: 41 programPoint places, 42 predicate places.
[2020-10-16 01:27:55,681 INFO  L481      AbstractCegarLoop]: Abstraction has has 83 places, 75 transitions, 685 flow
[2020-10-16 01:27:55,682 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 01:27:55,682 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:27:55,682 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:27:55,682 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-16 01:27:55,682 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:27:55,683 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:27:55,683 INFO  L82        PathProgramCache]: Analyzing trace with hash 395970656, now seen corresponding path program 1 times
[2020-10-16 01:27:55,683 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:27:55,683 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859002567]
[2020-10-16 01:27:55,683 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:27:55,702 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:27:55,722 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:27:55,722 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859002567]
[2020-10-16 01:27:55,723 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:27:55,723 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 01:27:55,723 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376874627]
[2020-10-16 01:27:55,723 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 01:27:55,723 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:27:55,724 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 01:27:55,724 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 01:27:55,725 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 178 out of 201
[2020-10-16 01:27:55,725 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 75 transitions, 685 flow. Second operand 3 states.
[2020-10-16 01:27:55,725 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:27:55,726 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 201
[2020-10-16 01:27:55,726 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:27:55,903 INFO  L129       PetriNetUnfolder]: 537/1076 cut-off events.
[2020-10-16 01:27:55,903 INFO  L130       PetriNetUnfolder]: For 6628/9770 co-relation queries the response was YES.
[2020-10-16 01:27:55,913 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 5478 conditions, 1076 events. 537/1076 cut-off events. For 6628/9770 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 7492 event pairs, 103 based on Foata normal form. 68/1008 useless extension candidates. Maximal degree in co-relation 5444. Up to 773 conditions per place. 
[2020-10-16 01:27:55,920 INFO  L132   encePairwiseOnDemand]: 198/201 looper letters, 4 selfloop transitions, 4 changer transitions 0/75 dead transitions.
[2020-10-16 01:27:55,920 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 75 transitions, 701 flow
[2020-10-16 01:27:55,921 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 01:27:55,922 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2020-10-16 01:27:55,923 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 540 transitions.
[2020-10-16 01:27:55,923 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8955223880597015
[2020-10-16 01:27:55,924 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 540 transitions.
[2020-10-16 01:27:55,924 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 540 transitions.
[2020-10-16 01:27:55,924 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:27:55,924 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 540 transitions.
[2020-10-16 01:27:55,925 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 4 states.
[2020-10-16 01:27:55,927 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states.
[2020-10-16 01:27:55,927 INFO  L81            ComplementDD]: Finished complementDD. Result 4 states.
[2020-10-16 01:27:55,927 INFO  L185             Difference]: Start difference. First operand has 83 places, 75 transitions, 685 flow. Second operand 3 states and 540 transitions.
[2020-10-16 01:27:55,927 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 75 transitions, 701 flow
[2020-10-16 01:27:55,942 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 75 transitions, 651 flow, removed 17 selfloop flow, removed 3 redundant places.
[2020-10-16 01:27:55,943 INFO  L241             Difference]: Finished difference. Result has 83 places, 75 transitions, 649 flow
[2020-10-16 01:27:55,944 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=649, PETRI_PLACES=83, PETRI_TRANSITIONS=75}
[2020-10-16 01:27:55,944 INFO  L342   CegarLoopForPetriNet]: 41 programPoint places, 42 predicate places.
[2020-10-16 01:27:55,944 INFO  L481      AbstractCegarLoop]: Abstraction has has 83 places, 75 transitions, 649 flow
[2020-10-16 01:27:55,944 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 01:27:55,944 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:27:55,944 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:27:55,944 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-16 01:27:55,945 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:27:55,945 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:27:55,945 INFO  L82        PathProgramCache]: Analyzing trace with hash -938498824, now seen corresponding path program 1 times
[2020-10-16 01:27:55,945 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:27:55,945 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398523073]
[2020-10-16 01:27:55,946 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:27:55,960 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:27:56,008 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:27:56,009 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398523073]
[2020-10-16 01:27:56,009 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:27:56,009 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 01:27:56,009 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730711790]
[2020-10-16 01:27:56,010 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 01:27:56,010 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:27:56,010 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 01:27:56,010 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2020-10-16 01:27:56,011 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 156 out of 201
[2020-10-16 01:27:56,012 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 75 transitions, 649 flow. Second operand 6 states.
[2020-10-16 01:27:56,012 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:27:56,012 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 201
[2020-10-16 01:27:56,012 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:27:56,591 INFO  L129       PetriNetUnfolder]: 1486/2942 cut-off events.
[2020-10-16 01:27:56,591 INFO  L130       PetriNetUnfolder]: For 20115/23036 co-relation queries the response was YES.
[2020-10-16 01:27:56,626 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 13436 conditions, 2942 events. 1486/2942 cut-off events. For 20115/23036 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 25025 event pairs, 296 based on Foata normal form. 227/2864 useless extension candidates. Maximal degree in co-relation 13402. Up to 1761 conditions per place. 
[2020-10-16 01:27:56,657 INFO  L132   encePairwiseOnDemand]: 196/201 looper letters, 37 selfloop transitions, 11 changer transitions 20/110 dead transitions.
[2020-10-16 01:27:56,657 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 110 transitions, 1211 flow
[2020-10-16 01:27:56,659 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 01:27:56,659 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2020-10-16 01:27:56,662 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 957 transitions.
[2020-10-16 01:27:56,663 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7935323383084577
[2020-10-16 01:27:56,663 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 957 transitions.
[2020-10-16 01:27:56,663 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 957 transitions.
[2020-10-16 01:27:56,665 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:27:56,665 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 957 transitions.
[2020-10-16 01:27:56,667 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 7 states.
[2020-10-16 01:27:56,671 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states.
[2020-10-16 01:27:56,671 INFO  L81            ComplementDD]: Finished complementDD. Result 7 states.
[2020-10-16 01:27:56,671 INFO  L185             Difference]: Start difference. First operand has 83 places, 75 transitions, 649 flow. Second operand 6 states and 957 transitions.
[2020-10-16 01:27:56,671 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 110 transitions, 1211 flow
[2020-10-16 01:27:56,761 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 110 transitions, 1205 flow, removed 1 selfloop flow, removed 1 redundant places.
[2020-10-16 01:27:56,764 INFO  L241             Difference]: Finished difference. Result has 90 places, 75 transitions, 673 flow
[2020-10-16 01:27:56,764 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=673, PETRI_PLACES=90, PETRI_TRANSITIONS=75}
[2020-10-16 01:27:56,764 INFO  L342   CegarLoopForPetriNet]: 41 programPoint places, 49 predicate places.
[2020-10-16 01:27:56,764 INFO  L481      AbstractCegarLoop]: Abstraction has has 90 places, 75 transitions, 673 flow
[2020-10-16 01:27:56,765 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 01:27:56,765 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:27:56,765 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:27:56,765 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-10-16 01:27:56,765 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:27:56,765 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:27:56,766 INFO  L82        PathProgramCache]: Analyzing trace with hash -1707024404, now seen corresponding path program 2 times
[2020-10-16 01:27:56,766 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:27:56,766 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685620202]
[2020-10-16 01:27:56,766 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:27:56,790 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:27:56,830 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:27:56,830 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685620202]
[2020-10-16 01:27:56,831 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:27:56,831 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 01:27:56,831 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658496625]
[2020-10-16 01:27:56,831 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 01:27:56,832 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:27:56,832 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 01:27:56,832 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 01:27:56,834 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 169 out of 201
[2020-10-16 01:27:56,835 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 75 transitions, 673 flow. Second operand 6 states.
[2020-10-16 01:27:56,835 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:27:56,835 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 201
[2020-10-16 01:27:56,835 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:27:57,232 INFO  L129       PetriNetUnfolder]: 773/1625 cut-off events.
[2020-10-16 01:27:57,232 INFO  L130       PetriNetUnfolder]: For 11799/19240 co-relation queries the response was YES.
[2020-10-16 01:27:57,246 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 8268 conditions, 1625 events. 773/1625 cut-off events. For 11799/19240 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 12782 event pairs, 24 based on Foata normal form. 947/2379 useless extension candidates. Maximal degree in co-relation 8230. Up to 1075 conditions per place. 
[2020-10-16 01:27:57,253 INFO  L132   encePairwiseOnDemand]: 194/201 looper letters, 6 selfloop transitions, 28 changer transitions 6/83 dead transitions.
[2020-10-16 01:27:57,253 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 83 transitions, 809 flow
[2020-10-16 01:27:57,254 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-10-16 01:27:57,254 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-10-16 01:27:57,258 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1561 transitions.
[2020-10-16 01:27:57,258 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8629076838032061
[2020-10-16 01:27:57,259 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1561 transitions.
[2020-10-16 01:27:57,259 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1561 transitions.
[2020-10-16 01:27:57,260 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:27:57,260 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1561 transitions.
[2020-10-16 01:27:57,263 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 10 states.
[2020-10-16 01:27:57,266 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states.
[2020-10-16 01:27:57,266 INFO  L81            ComplementDD]: Finished complementDD. Result 10 states.
[2020-10-16 01:27:57,266 INFO  L185             Difference]: Start difference. First operand has 90 places, 75 transitions, 673 flow. Second operand 9 states and 1561 transitions.
[2020-10-16 01:27:57,266 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 83 transitions, 809 flow
[2020-10-16 01:27:57,287 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 83 transitions, 766 flow, removed 2 selfloop flow, removed 7 redundant places.
[2020-10-16 01:27:57,289 INFO  L241             Difference]: Finished difference. Result has 94 places, 77 transitions, 715 flow
[2020-10-16 01:27:57,289 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=715, PETRI_PLACES=94, PETRI_TRANSITIONS=77}
[2020-10-16 01:27:57,290 INFO  L342   CegarLoopForPetriNet]: 41 programPoint places, 53 predicate places.
[2020-10-16 01:27:57,290 INFO  L481      AbstractCegarLoop]: Abstraction has has 94 places, 77 transitions, 715 flow
[2020-10-16 01:27:57,290 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 01:27:57,290 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:27:57,290 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:27:57,290 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2020-10-16 01:27:57,290 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:27:57,291 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:27:57,291 INFO  L82        PathProgramCache]: Analyzing trace with hash 1394632966, now seen corresponding path program 1 times
[2020-10-16 01:27:57,291 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:27:57,291 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831147649]
[2020-10-16 01:27:57,291 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:27:57,307 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:27:57,338 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:27:57,338 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831147649]
[2020-10-16 01:27:57,338 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:27:57,338 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 01:27:57,339 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548905484]
[2020-10-16 01:27:57,339 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 01:27:57,339 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:27:57,339 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 01:27:57,340 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 01:27:57,341 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 173 out of 201
[2020-10-16 01:27:57,341 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 77 transitions, 715 flow. Second operand 4 states.
[2020-10-16 01:27:57,341 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:27:57,341 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 201
[2020-10-16 01:27:57,341 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:27:57,734 INFO  L129       PetriNetUnfolder]: 1035/2222 cut-off events.
[2020-10-16 01:27:57,734 INFO  L130       PetriNetUnfolder]: For 18264/21635 co-relation queries the response was YES.
[2020-10-16 01:27:57,761 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 12106 conditions, 2222 events. 1035/2222 cut-off events. For 18264/21635 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 19229 event pairs, 36 based on Foata normal form. 45/1971 useless extension candidates. Maximal degree in co-relation 12068. Up to 1449 conditions per place. 
[2020-10-16 01:27:57,774 INFO  L132   encePairwiseOnDemand]: 198/201 looper letters, 4 selfloop transitions, 4 changer transitions 0/79 dead transitions.
[2020-10-16 01:27:57,775 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 79 transitions, 753 flow
[2020-10-16 01:27:57,775 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 01:27:57,776 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-10-16 01:27:57,777 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 699 transitions.
[2020-10-16 01:27:57,778 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8694029850746269
[2020-10-16 01:27:57,778 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 699 transitions.
[2020-10-16 01:27:57,778 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 699 transitions.
[2020-10-16 01:27:57,779 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:27:57,779 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 699 transitions.
[2020-10-16 01:27:57,781 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 5 states.
[2020-10-16 01:27:57,783 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states.
[2020-10-16 01:27:57,784 INFO  L81            ComplementDD]: Finished complementDD. Result 5 states.
[2020-10-16 01:27:57,784 INFO  L185             Difference]: Start difference. First operand has 94 places, 77 transitions, 715 flow. Second operand 4 states and 699 transitions.
[2020-10-16 01:27:57,784 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 79 transitions, 753 flow
[2020-10-16 01:27:58,028 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 79 transitions, 634 flow, removed 36 selfloop flow, removed 6 redundant places.
[2020-10-16 01:27:58,030 INFO  L241             Difference]: Finished difference. Result has 93 places, 78 transitions, 620 flow
[2020-10-16 01:27:58,031 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=620, PETRI_PLACES=93, PETRI_TRANSITIONS=78}
[2020-10-16 01:27:58,031 INFO  L342   CegarLoopForPetriNet]: 41 programPoint places, 52 predicate places.
[2020-10-16 01:27:58,031 INFO  L481      AbstractCegarLoop]: Abstraction has has 93 places, 78 transitions, 620 flow
[2020-10-16 01:27:58,031 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 01:27:58,032 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:27:58,032 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:27:58,032 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2020-10-16 01:27:58,032 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:27:58,032 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:27:58,032 INFO  L82        PathProgramCache]: Analyzing trace with hash -774247848, now seen corresponding path program 2 times
[2020-10-16 01:27:58,033 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:27:58,033 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940212478]
[2020-10-16 01:27:58,033 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:27:58,052 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:27:58,079 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:27:58,079 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940212478]
[2020-10-16 01:27:58,080 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:27:58,080 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 01:27:58,080 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741952237]
[2020-10-16 01:27:58,080 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 01:27:58,081 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:27:58,081 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 01:27:58,081 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 01:27:58,082 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 172 out of 201
[2020-10-16 01:27:58,083 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 78 transitions, 620 flow. Second operand 4 states.
[2020-10-16 01:27:58,083 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:27:58,083 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 201
[2020-10-16 01:27:58,083 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:27:58,596 INFO  L129       PetriNetUnfolder]: 1975/4127 cut-off events.
[2020-10-16 01:27:58,597 INFO  L130       PetriNetUnfolder]: For 17476/19054 co-relation queries the response was YES.
[2020-10-16 01:27:58,627 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 15807 conditions, 4127 events. 1975/4127 cut-off events. For 17476/19054 co-relation queries the response was YES. Maximal size of possible extension queue 849. Compared 39078 event pairs, 72 based on Foata normal form. 61/3481 useless extension candidates. Maximal degree in co-relation 15768. Up to 1329 conditions per place. 
[2020-10-16 01:27:58,638 INFO  L132   encePairwiseOnDemand]: 198/201 looper letters, 4 selfloop transitions, 2 changer transitions 0/80 dead transitions.
[2020-10-16 01:27:58,638 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 80 transitions, 652 flow
[2020-10-16 01:27:58,639 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 01:27:58,640 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-10-16 01:27:58,641 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 695 transitions.
[2020-10-16 01:27:58,642 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8644278606965174
[2020-10-16 01:27:58,642 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 695 transitions.
[2020-10-16 01:27:58,642 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 695 transitions.
[2020-10-16 01:27:58,643 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:27:58,643 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 695 transitions.
[2020-10-16 01:27:58,644 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 5 states.
[2020-10-16 01:27:58,646 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states.
[2020-10-16 01:27:58,646 INFO  L81            ComplementDD]: Finished complementDD. Result 5 states.
[2020-10-16 01:27:58,646 INFO  L185             Difference]: Start difference. First operand has 93 places, 78 transitions, 620 flow. Second operand 4 states and 695 transitions.
[2020-10-16 01:27:58,646 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 80 transitions, 652 flow
[2020-10-16 01:27:58,915 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 80 transitions, 643 flow, removed 3 selfloop flow, removed 2 redundant places.
[2020-10-16 01:27:58,916 INFO  L241             Difference]: Finished difference. Result has 96 places, 79 transitions, 626 flow
[2020-10-16 01:27:58,917 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=626, PETRI_PLACES=96, PETRI_TRANSITIONS=79}
[2020-10-16 01:27:58,917 INFO  L342   CegarLoopForPetriNet]: 41 programPoint places, 55 predicate places.
[2020-10-16 01:27:58,917 INFO  L481      AbstractCegarLoop]: Abstraction has has 96 places, 79 transitions, 626 flow
[2020-10-16 01:27:58,917 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 01:27:58,917 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:27:58,917 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:27:58,918 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2020-10-16 01:27:58,918 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:27:58,918 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:27:58,918 INFO  L82        PathProgramCache]: Analyzing trace with hash -1543486554, now seen corresponding path program 3 times
[2020-10-16 01:27:58,918 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:27:58,919 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616451910]
[2020-10-16 01:27:58,919 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:27:58,949 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:27:59,008 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 01:27:59,008 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616451910]
[2020-10-16 01:27:59,008 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:27:59,008 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-16 01:27:59,009 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470194343]
[2020-10-16 01:27:59,009 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 01:27:59,009 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:27:59,010 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 01:27:59,010 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-10-16 01:27:59,011 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 169 out of 201
[2020-10-16 01:27:59,012 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 79 transitions, 626 flow. Second operand 7 states.
[2020-10-16 01:27:59,012 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:27:59,012 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 201
[2020-10-16 01:27:59,012 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:27:59,715 INFO  L129       PetriNetUnfolder]: 1797/3794 cut-off events.
[2020-10-16 01:27:59,715 INFO  L130       PetriNetUnfolder]: For 21364/36748 co-relation queries the response was YES.
[2020-10-16 01:27:59,953 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 16958 conditions, 3794 events. 1797/3794 cut-off events. For 21364/36748 co-relation queries the response was YES. Maximal size of possible extension queue 840. Compared 36029 event pairs, 0 based on Foata normal form. 1977/5099 useless extension candidates. Maximal degree in co-relation 16918. Up to 1280 conditions per place. 
[2020-10-16 01:27:59,958 INFO  L132   encePairwiseOnDemand]: 194/201 looper letters, 2 selfloop transitions, 30 changer transitions 28/84 dead transitions.
[2020-10-16 01:27:59,958 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 84 transitions, 760 flow
[2020-10-16 01:27:59,959 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2020-10-16 01:27:59,959 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2020-10-16 01:27:59,963 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1900 transitions.
[2020-10-16 01:27:59,964 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8593396653098145
[2020-10-16 01:27:59,964 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1900 transitions.
[2020-10-16 01:27:59,964 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1900 transitions.
[2020-10-16 01:27:59,965 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:27:59,966 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1900 transitions.
[2020-10-16 01:27:59,969 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 12 states.
[2020-10-16 01:27:59,973 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states.
[2020-10-16 01:27:59,973 INFO  L81            ComplementDD]: Finished complementDD. Result 12 states.
[2020-10-16 01:27:59,973 INFO  L185             Difference]: Start difference. First operand has 96 places, 79 transitions, 626 flow. Second operand 11 states and 1900 transitions.
[2020-10-16 01:27:59,973 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 84 transitions, 760 flow
[2020-10-16 01:28:00,163 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 84 transitions, 747 flow, removed 5 selfloop flow, removed 2 redundant places.
[2020-10-16 01:28:00,165 INFO  L241             Difference]: Finished difference. Result has 107 places, 56 transitions, 479 flow
[2020-10-16 01:28:00,165 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=479, PETRI_PLACES=107, PETRI_TRANSITIONS=56}
[2020-10-16 01:28:00,165 INFO  L342   CegarLoopForPetriNet]: 41 programPoint places, 66 predicate places.
[2020-10-16 01:28:00,165 INFO  L481      AbstractCegarLoop]: Abstraction has has 107 places, 56 transitions, 479 flow
[2020-10-16 01:28:00,165 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 01:28:00,165 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:28:00,165 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:28:00,166 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2020-10-16 01:28:00,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:28:00,166 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:28:00,166 INFO  L82        PathProgramCache]: Analyzing trace with hash -518189360, now seen corresponding path program 1 times
[2020-10-16 01:28:00,166 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:28:00,166 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594572415]
[2020-10-16 01:28:00,166 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:28:00,197 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 01:28:00,198 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 01:28:00,227 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 01:28:00,227 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 01:28:00,264 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-16 01:28:00,264 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-16 01:28:00,264 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2020-10-16 01:28:00,265 WARN  L264   etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available.
[2020-10-16 01:28:00,279 WARN  L124   codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L846-->L853: Formula: (let ((.cse6 (= (mod ~z$w_buff0_used~0_In1558916496 256) 0)) (.cse7 (= (mod ~z$r_buff0_thd0~0_In1558916496 256) 0)) (.cse8 (= (mod ~z$r_buff1_thd0~0_In1558916496 256) 0)) (.cse9 (= (mod ~z$w_buff1_used~0_In1558916496 256) 0))) (let ((.cse3 (or .cse8 .cse9)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse4 (not .cse7)) (.cse5 (not .cse6)) (.cse0 (or .cse6 .cse7))) (and (= ~z$r_buff0_thd0~0_Out1558916496 ~z$r_buff0_thd0~0_In1558916496) (or (and .cse0 (or (and .cse1 .cse2 (= ~z$w_buff1~0_In1558916496 ~z~0_Out1558916496)) (and (= ~z~0_In1558916496 ~z~0_Out1558916496) .cse3))) (and .cse4 (= ~z~0_Out1558916496 ~z$w_buff0~0_In1558916496) .cse5)) (or (and .cse3 (= ~z$w_buff1_used~0_Out1558916496 ~z$w_buff1_used~0_In1558916496)) (and .cse1 .cse2 (= ~z$w_buff1_used~0_Out1558916496 0))) (or (and .cse4 (= ~z$w_buff0_used~0_Out1558916496 0) .cse5) (and .cse0 (= ~z$w_buff0_used~0_In1558916496 ~z$w_buff0_used~0_Out1558916496))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1558916496 0)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1558916496 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1558916496|) (= ~z$r_buff1_thd0~0_Out1558916496 ~z$r_buff1_thd0~0_In1558916496))))  InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1558916496|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1558916496, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1558916496, ~z$w_buff0~0=~z$w_buff0~0_In1558916496, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1558916496, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1558916496, ~z$w_buff1~0=~z$w_buff1~0_In1558916496, ~z~0=~z~0_In1558916496}  OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out1558916496, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1558916496|, ~z$w_buff0~0=~z$w_buff0~0_In1558916496, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1558916496|, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1558916496, ~z$w_buff1~0=~z$w_buff1~0_In1558916496, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1558916496|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1558916496|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1558916496|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1558916496|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1558916496|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out1558916496, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1558916496, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1558916496, ~z~0=~z~0_Out1558916496}  AuxVars[]  AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23] because there is no mapped edge
[2020-10-16 01:28:00,285 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:00,285 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:00,287 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:00,287 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:00,288 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:00,288 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:00,288 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:00,288 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:00,288 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:00,288 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:00,289 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:00,289 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:00,289 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:00,289 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:00,289 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:00,290 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:00,290 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:00,290 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:00,290 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:00,290 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:00,290 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:00,290 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:00,291 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:00,291 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:00,291 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:00,291 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:00,292 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:00,292 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:00,293 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:00,293 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:00,293 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:00,293 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:00,293 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:00,293 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:00,294 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:00,294 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:00,294 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:00,294 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:00,294 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:00,295 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:00,295 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:00,295 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:00,295 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:00,295 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:00,295 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 01:28:00,295 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:28:00,410 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:28:00 BasicIcfg
[2020-10-16 01:28:00,410 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-16 01:28:00,412 INFO  L168              Benchmark]: Toolchain (without parser) took 22470.07 ms. Allocated memory was 252.2 MB in the beginning and 716.2 MB in the end (delta: 464.0 MB). Free memory was 204.7 MB in the beginning and 510.0 MB in the end (delta: -305.3 MB). Peak memory consumption was 158.7 MB. Max. memory is 14.2 GB.
[2020-10-16 01:28:00,413 INFO  L168              Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 252.2 MB. Free memory was 227.7 MB in the beginning and 226.9 MB in the end (delta: 839.2 kB). Peak memory consumption was 839.2 kB. Max. memory is 14.2 GB.
[2020-10-16 01:28:00,414 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 747.69 ms. Allocated memory was 252.2 MB in the beginning and 318.2 MB in the end (delta: 66.1 MB). Free memory was 204.7 MB in the beginning and 268.8 MB in the end (delta: -64.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 14.2 GB.
[2020-10-16 01:28:00,415 INFO  L168              Benchmark]: Boogie Procedure Inliner took 70.50 ms. Allocated memory is still 318.2 MB. Free memory was 268.8 MB in the beginning and 265.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB.
[2020-10-16 01:28:00,415 INFO  L168              Benchmark]: Boogie Preprocessor took 44.90 ms. Allocated memory is still 318.2 MB. Free memory was 265.5 MB in the beginning and 263.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
[2020-10-16 01:28:00,416 INFO  L168              Benchmark]: RCFGBuilder took 2039.58 ms. Allocated memory was 318.2 MB in the beginning and 360.2 MB in the end (delta: 41.9 MB). Free memory was 263.0 MB in the beginning and 210.3 MB in the end (delta: 52.7 MB). Peak memory consumption was 99.1 MB. Max. memory is 14.2 GB.
[2020-10-16 01:28:00,416 INFO  L168              Benchmark]: TraceAbstraction took 19562.56 ms. Allocated memory was 360.2 MB in the beginning and 716.2 MB in the end (delta: 356.0 MB). Free memory was 208.1 MB in the beginning and 510.0 MB in the end (delta: -301.9 MB). Peak memory consumption was 54.1 MB. Max. memory is 14.2 GB.
[2020-10-16 01:28:00,420 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.45 ms. Allocated memory is still 252.2 MB. Free memory was 227.7 MB in the beginning and 226.9 MB in the end (delta: 839.2 kB). Peak memory consumption was 839.2 kB. Max. memory is 14.2 GB.
 * CACSL2BoogieTranslator took 747.69 ms. Allocated memory was 252.2 MB in the beginning and 318.2 MB in the end (delta: 66.1 MB). Free memory was 204.7 MB in the beginning and 268.8 MB in the end (delta: -64.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 14.2 GB.
 * Boogie Procedure Inliner took 70.50 ms. Allocated memory is still 318.2 MB. Free memory was 268.8 MB in the beginning and 265.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB.
 * Boogie Preprocessor took 44.90 ms. Allocated memory is still 318.2 MB. Free memory was 265.5 MB in the beginning and 263.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * RCFGBuilder took 2039.58 ms. Allocated memory was 318.2 MB in the beginning and 360.2 MB in the end (delta: 41.9 MB). Free memory was 263.0 MB in the beginning and 210.3 MB in the end (delta: 52.7 MB). Peak memory consumption was 99.1 MB. Max. memory is 14.2 GB.
 * TraceAbstraction took 19562.56 ms. Allocated memory was 360.2 MB in the beginning and 716.2 MB in the end (delta: 356.0 MB). Free memory was 208.1 MB in the beginning and 510.0 MB in the end (delta: -301.9 MB). Peak memory consumption was 54.1 MB. Max. memory is 14.2 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    1709 VarBasedMoverChecksPositive, 80 VarBasedMoverChecksNegative, 16 SemBasedMoverChecksPositive, 64 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 219 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.8s, 119 PlacesBefore, 41 PlacesAfterwards, 108 TransitionsBefore, 28 TransitionsAfterwards, 2540 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 89 TotalNumberOfCompositions, 6449 MoverChecksTotal
  - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L699]               0  int __unbuffered_cnt = 0;
[L701]               0  int __unbuffered_p0_EAX = 0;
[L703]               0  int __unbuffered_p3_EAX = 0;
[L705]               0  int __unbuffered_p3_EBX = 0;
[L707]               0  int a = 0;
[L709]               0  int b = 0;
[L710]               0  _Bool main$tmp_guard0;
[L711]               0  _Bool main$tmp_guard1;
[L713]               0  int x = 0;
[L715]               0  int y = 0;
[L717]               0  int z = 0;
[L718]               0  _Bool z$flush_delayed;
[L719]               0  int z$mem_tmp;
[L720]               0  _Bool z$r_buff0_thd0;
[L721]               0  _Bool z$r_buff0_thd1;
[L722]               0  _Bool z$r_buff0_thd2;
[L723]               0  _Bool z$r_buff0_thd3;
[L724]               0  _Bool z$r_buff0_thd4;
[L725]               0  _Bool z$r_buff1_thd0;
[L726]               0  _Bool z$r_buff1_thd1;
[L727]               0  _Bool z$r_buff1_thd2;
[L728]               0  _Bool z$r_buff1_thd3;
[L729]               0  _Bool z$r_buff1_thd4;
[L730]               0  _Bool z$read_delayed;
[L731]               0  int *z$read_delayed_var;
[L732]               0  int z$w_buff0;
[L733]               0  _Bool z$w_buff0_used;
[L734]               0  int z$w_buff1;
[L735]               0  _Bool z$w_buff1_used;
[L736]               0  _Bool weak$$choice0;
[L737]               0  _Bool weak$$choice2;
[L835]               0  pthread_t t1221;
[L836]  FCALL, FORK  0  pthread_create(&t1221, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L837]               0  pthread_t t1222;
[L838]  FCALL, FORK  0  pthread_create(&t1222, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L839]               0  pthread_t t1223;
[L840]  FCALL, FORK  0  pthread_create(&t1223, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L841]               0  pthread_t t1224;
[L842]  FCALL, FORK  0  pthread_create(&t1224, ((void *)0), P3, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L791]               4  z$w_buff1 = z$w_buff0
[L792]               4  z$w_buff0 = 2
[L793]               4  z$w_buff1_used = z$w_buff0_used
[L794]               4  z$w_buff0_used = (_Bool)1
[L7]    COND FALSE   4  !(!expression)
[L796]               4  z$r_buff1_thd0 = z$r_buff0_thd0
[L797]               4  z$r_buff1_thd1 = z$r_buff0_thd1
[L798]               4  z$r_buff1_thd2 = z$r_buff0_thd2
[L799]               4  z$r_buff1_thd3 = z$r_buff0_thd3
[L800]               4  z$r_buff1_thd4 = z$r_buff0_thd4
[L801]               4  z$r_buff0_thd4 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L804]               4  a = 1
[L807]               4  __unbuffered_p3_EAX = a
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L810]               4  __unbuffered_p3_EBX = b
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L741]               1  b = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L744]               1  __unbuffered_p0_EAX = x
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L756]               2  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L759]               2  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L771]               3  y = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L774]               3  z = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L777]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L777]  EXPR         3  z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z
[L777]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L777]               3  z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L778]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L778]               3  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L779]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L779]               3  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L780]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L780]               3  z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L781]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L781]               3  z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L813]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L813]  EXPR         4  z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z
[L813]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L813]               4  z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L814]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L814]               4  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L815]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used
[L815]               4  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used
[L816]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L816]               4  z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L817]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4
[L817]               4  z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4
[L749]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L751]               1  return 0;
[L764]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L766]               2  return 0;
[L784]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L786]               3  return 0;
[L820]               4  __unbuffered_cnt = __unbuffered_cnt + 1
[L822]               4  return 0;
[L844]               0  main$tmp_guard0 = __unbuffered_cnt == 4
[L855]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L856]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L857]               0  z$flush_delayed = weak$$choice2
[L858]               0  z$mem_tmp = z
[L859]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1)
[L859]               0  z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1)
[L860]  EXPR         0  weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L860]               0  z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L861]  EXPR         0  weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L861]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)
[L861]  EXPR         0  weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L861]               0  z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L862]  EXPR         0  weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L862]               0  z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L863]  EXPR         0  weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L863]               0  z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L864]  EXPR         0  weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L864]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)
[L864]  EXPR         0  weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L864]               0  z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L865]  EXPR         0  weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L865]               0  z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L866]               0  main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0)
[L867]  EXPR         0  z$flush_delayed ? z$mem_tmp : z
[L867]               0  z = z$flush_delayed ? z$mem_tmp : z
[L868]               0  z$flush_delayed = (_Bool)0
[L7]    COND TRUE    0  !expression
[L7]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 5 procedures, 111 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 19.2s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.9s, HoareTripleCheckerStatistics: 67 SDtfs, 56 SDslu, 30 SDs, 0 SdLazy, 466 SolverSat, 152 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=715occurred in iteration=15, 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.1s InterpolantComputationTime, 327 NumberOfCodeBlocks, 327 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 283 ConstructedInterpolants, 0 QuantifiedInterpolants, 25993 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...